2003 · 10 citations · 4 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureQuantum ComputingQuantum MechanicsHardware AccelerationQuantum AlgorithmsQuantum BitsQuantum ComputationQuantum Hardware ArchitecturesQuantum SimulationBoolean Satisfiability ProblemQuantum Algorithms For Information ProcessingQuantum Circuit SimulationQuantum Computing ArchitectureSatisfiabilitySatisfiability Problem
A high-speed and large-scale processor dedicated to quantum computing is proposed, which has the minimum operation function needed for execution of a quantum algorithm. In this processor, the probability amplitudes determined by the states of the quantum bits in the quantum computer are described using only one bit, and we named it a logic quantum processor. It is found that for this processor an execution speed 275 times higher than that of a software simulation is obtained when the processor executing the quantum algorithm for 16 qubit has been implemented in a FPGA. As an example application, it is shown that the processor can solve the satisfiability problem and that it can also simulate the decoherence in the quantum computer at high speed.
4
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996 · 8.6K citations · Full text
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Lieven M. K. Vandersypen, Matthias Steffen, Gregory Breyta et al. · Nature · 2001 · 1.7K citations · Full text
Computing, Computer Science, Physics +15
An 8-qubit quantum-circuit processor
S. O’uchi, Minoru Fujishima, K. Hoh · 2003 · 11 citations