Quantum Physics and Computers

Abstract

Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit quantum features could factor large composite integers. This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. The additional power of quantum computers comes from the possibility of employing a superposition of states, of following many distinct computation paths and of producing a final output that depends on the interference of all of them. This ``quantum parallelism'' outstrips by far any parallelism that can be thought of in classical computation and is responsible for the ``exponential'' speed-up of computation. This is a non-technical (or at least not too technical) introduction to the field of quantum computation. It does not cover very recent topics, such as error-correction.

27 pages, LaTeX, 8 PostScript figures embedded. A bug in one of the postscript files has been fixed. Reprints available from the author. The files are also available from http://eve.physics.ox.ac.uk/Articles/QC.Articles.html

Cited by in corpus (36)

• Quantum Computation with Quantum Dots
• Quantum state engineering with Josephson-junction devices
• Quantifying Entanglement
• Quantum Computing
• A Multiparticle Generalization of Entanglement Swapping
• Optimization of entanglement witnesses
• Cavity Loss Induced Generation of Entangled Atoms
• Quantum Manipulations of Small Josephson Junctions
• Entangled states and collective nonclassical effects in two-atom systems
• Optimal Creation of Entanglement Using a Two--Qubit Gate
• Optimal local implementation of non-local quantum gates
• Efficient polarization entanglement purification based on parametric down-conversion sources with cross-Kerr nonlinearity
• Magnetic qubits as hardware for quantum computers
• Entanglement dynamics of two independent qubits in environments with and without memory
• An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
• Effective Pure States for Bulk Quantum Computation
• Multi-Particle Entanglement Purification Protocols
• Quantum Computation in Quantum-Hall Systems
• Basics of Quantum Computation
• Purifying noisy entanglement requires collective measurements
• Speed of ion trap quantum information processors
• Non-Markovian disentanglement dynamics of two-qubit system
• Optimally Conclusive Discrimination of Non-orthogonal Entangled States Locally
• Distinguishing a set of full product bases needs only projective measurements and classical communication
• Simple experimental methods for trapped ion quantum processors
• Reconstruction of quantum states of spin systems via the Jaynes principle of maximum entropy
• An efficient scheme for the deterministic maximal entanglement of N trapped ions
• Entanglement dynamics of a two-qubit system coupled individually to Ohmic baths
• Gapped Quantum Criticality Gains Long Time Quantum Correlations
• Finite time decoherence could be suppressed efficiently in photonic crystal
• Factoring the unitary evolution operator and quantifying entanglement
• Multi-Receiver Quantum Dense Coding with Non-Symmetric Quantum Channel
• Non-dissipative decoherence bounds on quantum computation
• Dynamics of decoherence in a noisy driven environment
• Preparation of GHZ states via Grover's quantum searching algorithm
• Correlations in interference and diffraction