text:
Quantum computing
From Wikipedia, the free encyclopedia
Jump to: navigation, search
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (June 2015) (Learn how and when to remove this template message)
The Bloch sphere is a representation of a qubit, the fundamental building block of quantum computers.
Quantum mechanics
H ^ | ψ ( t ) ⟩ = i ℏ ∂ ∂ t | ψ ( t ) ⟩ {\displaystyle {\hat {H}}|\psi (t)\rangle =i\hbar {\frac {\partial }{\partial t}}|\psi (t)\rangle }
Schrödinger equation
Introduction
Glossary
History
Background[show]
Classical mechanics
Old quantum theory
Bra–ket notation
Hamiltonian
Interference
Fundamentals[show]
Complementarity
Decoherence
Entanglement
Energy level
Measurement
Nonlocality
Quantum number
State
Superposition
Symmetry
Tunnelling
Uncertainty
Wave function (collapse)
Experiments[show]
Afshar
Bell's inequality
Davisson–Germer
Double-slit
Elitzur–Vaidman
Franck–Hertz
Leggett–Garg inequality
Mach–Zehnder
Popper
Quantum eraser (delayed-choice)
Schrödinger's cat
Stern–Gerlach
Wheeler's delayed-choice
Formulations[show]
Overview
Heisenberg
Interaction
Matrix
Phase-space
Schrödinger
Sum-over-histories (path integral)
Equations[show]
Dirac
Klein–Gordon
Pauli
Rydberg
Schrödinger
Interpretations[show]
Overview
Consistent histories
Copenhagen
de Broglie–Bohm
Ensemble
Hidden-variable
Many-worlds
Objective collapse
Bayesian
Quantum logic
Relational
Stochastic
Scale relativity
Transactional
Advanced topics[show]
Relativistic quantum mechanics
Quantum field theory
Quantum information science
Quantum computing
Quantum chaos
Density matrix
Fractional quantum mechanics
Scattering theory
Quantum statistical mechanics
Quantum machine learning
Scientists[show]
Aharonov
Bell
Blackett
Bloch
Bohm
Bohr
Born
Bose
de Broglie
Candlin
Compton
Dirac
Davisson
Debye
Ehrenfest
Einstein
Everett
Fock
Fermi
Feynman
Glauber
Gutzwiller
Heisenberg
Hilbert
Jordan
Kramers
Pauli
Lamb
Landau
Laue
Moseley
Millikan
Onnes
Planck
Rabi
Raman
Rydberg
Schrödinger
Sommerfeld
von Neumann
Weyl
Wien
Wigner
Zeeman
Zeilinger
v
t
e
Quantum computing is computing using quantum-mechanical phenomena, such as superposition and entanglement.[1] A quantum computer is a device that performs quantum computing. They are different from binary digital electronic computers based on transistors. Whereas common digital computing requires that the data be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits, which can be in superpositions of states. A quantum Turing machine is a theoretical model of such a computer, and is also known as the universal quantum computer. The field of quantum computing was initiated by the work of Paul Benioff (de)[2] and Yuri Manin in 1980,[3] Richard Feynman in 1982,[4] and David Deutsch in 1985.[5] A quantum computer with spins as quantum bits was also formulated for use as a quantum spacetime in 1968.[6]
As of 2017,[update] the development of actual quantum computers is still in its infancy, but experiments have been carried out in which quantum computational operations were executed on a very small number of quantum bits.[7] Both practical and theoretical research continues, and many national governments and military agencies are funding quantum computing research in additional effort to develop quantum computers for civilian, business, trade, environmental and national security purposes, such as cryptanalysis.[8] A small 16-qubit quantum computer exists and is available for hobbyists to experiment with via the IBM quantum experience project. Along with the IBM computer a company called D-Wave has also been developing their own version of a quantum computer that uses a process called annealing.[9]
Large-scale quantum computers would theoretically be able to solve certain problems much more quickly than any classical computers that use even the best currently known algorithms, like integer factorization using Shor's algorithm or the simulation of quantum many-body systems. There exist quantum algorithms, such as Simon's algorithm, that run faster than any possible probabilistic classical algorithm.[10] A classical computer could in principle (with exponential resources) simulate a quantum algorithm, as quantum computation does not violate the Church–Turing thesis.[11]:202 On the other hand, quantum computers may be able to efficiently solve problems which are not practically feasible on classical computers.
Contents
[hide]
1 Basis
2 Principles of operation
3 Operation
4 Potential
4.1 Quantum supremacy
5 Obstacles
5.1 Quantum decoherence
6 Developments
6.1 Timeline
7 Relation to computational complexity theory
8 See also
9 References
10 Further reading
11 External links
Basis[edit]
A classical computer has a memory made up of bits, where each bit is represented by either a one or a zero. A quantum computer maintains a sequence of qubits. A single qubit can represent a one, a zero, or any quantum superposition of those two qubit states;[11]:13–16 a pair of qubits can be in any quantum superposition of 4 states,[11]:16 and three qubits in any superposition of 8 states. In general, a quantum computer with n {\displaystyle n} qubits can be in an arbitrary superposition of up to 2 n {\displaystyle 2^{n}} different states simultaneously[11]:17 (this compares to a normal computer that can only be in one of these 2 n {\displaystyle 2^{n}} states at any one time). A quantum computer operates on its qubits using quantum gates and measurement (which also alters the observed state). An algorithm is composed of a fixed sequence of quantum logic gates and a problem is encoded by setting the initial values of the qubits, similar to how a classical computer works. The calculation usually ends with a measurement, collapsing the system of qubits into one of the 2 n {\displaystyle 2^{n}} pure states, where each qubit is zero or one, decomposing into a classical state. The outcome can therefore be at most n {\displaystyle n} classical bits of information (or, if the algorithm did not end with a measurement, the result is an unobserved quantum state). Quantum algorithms are often probabilistic, in that they provide the correct solution only with a certain known probability.[12] Note that the term non-deterministic computing must not be used in that case to mean probabilistic (computing), because the term non-deterministic has a different meaning in computer science.
An example of an implementation of qubits of a quantum computer could start with the use of particles with two spin states: "down" and "up" (typically written | ↓ ⟩ {\displaystyle |{\downarrow }\rangle } and | ↑ ⟩ {\displaystyle |{\uparrow }\rangle } , or | 0 ⟩ {\displaystyle |0{\rangle }} and | 1 ⟩ {\displaystyle |1{\rangle }} ). This is true because any such system can be mapped onto an effective spin-1/2 system.
Principles of operation[edit]
A quantum computer with a given number of qubits is fundamentally different from a classical computer composed of the same number of classical bits. For example, representing the state of an n-qubit system on a classical computer requires the storage of 2n complex coefficients, while to characterize the state of a classical n-bit system it is sufficient to provide the values of the n bits, that is, only n numbers. Although this fact may seem to indicate that qubits can hold exponentially more information than their classical counterparts, care must be taken not to overlook the fact that the qubits are only in a probabilistic superposition of all of their states. This means that when the final state of the qubits is measured, they will only be found in one of the possible configurations they were in before the measurement. It is generally incorrect to think of a system of qubits as being in one particular state before the measurement, since the fact that they were in a superposition of states before the measurement was made directly affects the possible outcomes of the computation.
Qubits are made up of controlled particles and the means of control (e.g. devices that trap particles and switch them from one state to another).[13]
To better understand this point, consider a classical computer that operates on a three-bit register. If the exact state of the register at a given time is not known, it can be described as a probability distribution over the 2 3 = 8 {\displaystyle 2^{3}=8} different three-bit strings 000, 001, 010, 011, 100, 101, 110, and 111. If there is no uncertainty over its state, then it is in exactly one of these states with probability 1. However, if it is a probabilistic computer, then there is a possibility of it being in any one of a number of different states.
The state of a three-qubit quantum computer is similarly described by an eight-dimensional vector ( a 0 , a 1 , a 2 , a 3 , a 4 , a 5 , a 6 , a 7 ) {\displaystyle (a_{0},a_{1},a_{2},a_{3},a_{4},a_{5},a_{6},a_{7})} (or a one dimensional vector with each vector node holding the amplitude and the state as the bit string of qubits). Here, however, the coefficients a k {\displaystyle a_{k}} are complex numbers, and it is the sum of the squares of the coefficients' absolute values, ∑ i | a i | 2 {\displaystyle \sum _{i}|a_{i}|^{2}} , that must equal 1. For each k {\displaystyle k} , the absolute value squared | a k | 2 {\displaystyle \left|a_{k}\right|^{2}} gives the probability of the system being found after a measurement in the k {\displaystyle k} -th state. However, because a complex number encodes not just a magnitude but also a direction in the complex plane, the phase difference between any two coefficients (states) represents a meaningful parameter. This is a fundamental difference between quantum computing and probabilistic classical computing.[14]
If you measure the three qubits, you will observe a three-bit string. The probability of measuring a given string is the squared magnitude of that string's coefficient (i.e., the probability of measuring 000 = | a 0 | 2 {\displaystyle |a_{0}|^{2}} , the probability of measuring 001 = | a 1 | 2 {\displaystyle |a_{1}|^{2}} , etc.). Thus, measuring a quantum state described by complex coefficients ( a 0 , a 1 , a 2 , a 3 , a 4 , a 5 , a 6 , a 7 ) {\displaystyle (a_{0},a_{1},a_{2},a_{3},a_{4},a_{5},a_{6},a_{7})} gives the classical probability distribution ( | a 0 | 2 , | a 1 | 2 , | a 2 | 2 , | a 3 | 2 , | a 4 | 2 , | a 5 | 2 , | a 6 | 2 , | a 7 | 2 ) {\displaystyle (|a_{0}|^{2},|a_{1}|^{2},|a_{2}|^{2},|a_{3}|^{2},|a_{4}|^{2},|a_{5}|^{2},|a_{6}|^{2},|a_{7}|^{2})} and we say that the quantum state "collapses" to a classical state as a result of making the measurement.
An eight-dimensional vector can be specified in many different ways depending on what basis is chosen for the space. The basis of bit strings (e.g., 000, 001, …, 111) is known as the computational basis. Other possible bases are unit-length, orthogonal vectors and the eigenvectors of the Pauli-x operator. Ket notation is often used to make the choice of basis explicit. For example, the state ( a 0 , a 1 , a 2 , a 3 , a 4 , a 5 , a 6 , a 7 ) {\displaystyle (a_{0},a_{1},a_{2},a_{3},a_{4},a_{5},a_{6},a_{7})} in the computational basis can be written as:
a 0 | 000 ⟩ + a 1 | 001 ⟩ + a 2 | 010 ⟩ + a 3 | 011 ⟩ + a 4 | 100 ⟩ + a 5 | 101 ⟩ + a 6 | 110 ⟩ + a 7 | 111 ⟩ {\displaystyle a_{0}\,|000\rangle +a_{1}\,|001\rangle +a_{2}\,|010\rangle +a_{3}\,|011\rangle +a_{4}\,|100\rangle +a_{5}\,|101\rangle +a_{6}\,|110\rangle +a_{7}\,|111\rangle }
where, e.g., | 010 ⟩ = ( 0 , 0 , 1 , 0 , 0 , 0 , 0 , 0 ) {\displaystyle |010\rangle =\left(0,0,1,0,0,0,0,0\right)}
The computational basis for a single qubit (two dimensions) is | 0 ⟩ = ( 1 , 0 ) {\displaystyle |0\rangle =\left(1,0\right)} and | 1 ⟩ = ( 0 , 1 ) {\displaystyle |1\rangle =\left(0,1\right)} .
Using the eigenvectors of the Pauli-x operator, a single qubit is | + ⟩ = 1 2 ( 1 , 1 ) {\displaystyle |+\rangle ={\tfrac {1}{\sqrt {2}}}\left(1,1\right)} and | − ⟩ = 1 2 ( 1 , − 1 ) {\displaystyle |-\rangle ={\tfrac {1}{\sqrt {2}}}\left(1,-1\right)} .
Operation[edit]
Unsolved problem in physics:
Is a universal quantum computer sufficient to efficiently simulate an arbitrary physical system?
(more unsolved problems in physics)
While a classical 3-bit state and a quantum 3-qubit state are each eight-dimensional vectors, they are manipulated quite differently for classical or quantum computation. For computing in either case, the system must be initialized, for example into the all-zeros string, | 000 ⟩ {\displaystyle |000\rangle } , corresponding to the vector (1,0,0,0,0,0,0,0). In classical randomized computation, the system evolves according to the application of stochastic matrices, which preserve that the probabilities add up to one (i.e., preserve the L1 norm). In quantum computation, on the other hand, allowed operations are unitary matrices, which are effectively rotations (they preserve that the sum of the squares add up to one, the Euclidean or L2 norm). (Exactly what unitaries can be applied depend on the physics of the quantum device.) Consequently, since rotations can be undone by rotating backward, quantum computations are reversible. (Technically, quantum operations can be probabilistic combinations of unitaries, so quantum computation really does generalize classical computation. See quantum circuit for a more precise formulation.)
Finally, upon termination of the algorithm, the result needs to be read off. In the case of a classical computer, we sample from the probability distribution on the three-bit register to obtain one definite three-bit string, say 000. Quantum mechanically, one measures the three-qubit state, which is equivalent to collapsing the quantum state down to a classical distribution (with the coefficients in the classical state being the squared magnitudes of the coefficients for the quantum state, as described above), followed by sampling from that distribution. This destroys the original quantum state. Many algorithms will only give the correct answer with a certain probability. However, by repeatedly initializing, running and measuring the quantum computer's results, the probability of getting the correct answer can be increased. In contrast, counterfactual quantum computation allows the correct answer to be inferred when the quantum computer is not actually running in a technical sense, though earlier initialization and frequent measurements are part of the counterfactual computation protocol.
For more details on the sequences of operations used for various quantum algorithms, see universal quantum computer, Shor's algorithm, Grover's algorithm, Deutsch–Jozsa algorithm, amplitude amplification, quantum Fourier transform, quantum gate, quantum adiabatic algorithm and quantum error correction.
Potential[edit]
Integer factorization, which underpins the security of public key cryptographic systems, is believed to be computationally infeasible with an ordinary computer for large integers if they are the product of few prime numbers (e.g., products of two 300-digit primes).[15] By comparison, a quantum computer could efficiently solve this problem using Shor's algorithm to find its factors. This ability would allow a quantum computer to decrypt many of the cryptographic systems in use today, in the sense that there would be a polynomial time (in the number of digits of the integer) algorithm for solving the problem. In particular, most of the popular public key ciphers are based on the difficulty of factoring integers or the discrete logarithm problem, both of which can be solved by Shor's algorithm. In particular the RSA, Diffie-Hellman, and elliptic curve Diffie-Hellman algorithms could be broken. These are used to protect secure Web pages, encrypted email, and many other types of data. Breaking these would have significant ramifications for electronic privacy and security.
However, other cryptographic algorithms do not appear to be broken by those algorithms.[16][17] Some public-key algorithms are based on problems other than the integer factorization and discrete logarithm problems to which Shor's algorithm applies, like the McEliece cryptosystem based on a problem in coding theory.[16][18] Lattice-based cryptosystems are also not known to be broken by quantum computers, and finding a polynomial time algorithm for solving the dihedral hidden subgroup problem, which would break many lattice based cryptosystems, is a well-studied open problem.[19] It has been proven that applying Grover's algorithm to break a symmetric (secret key) algorithm by brute force requires time equal to roughly 2n/2 invocations of the underlying cryptographic algorithm, compared with roughly 2n in the classical case,[20] meaning that symmetric key lengths are effectively halved: AES-256 would have the same security against an attack using Grover's algorithm that AES-128 has against classical brute-force search (see Key size). Quantum cryptography could potentially fulfill some of the functions of public key cryptography.
Besides factorization and discrete logarithms, quantum algorithms offering a more than polynomial speedup over the best known classical algorithm have been found for several problems,[21] including the simulation of quantum physical processes from chemistry and solid state physics, the approximation of Jones polynomials, and solving Pell's equation. No mathematical proof has been found that shows that an equally fast classical algorithm cannot be discovered, although this is considered unlikely.[22] For some problems, quantum computers offer a polynomial speedup. The most well-known example of this is quantum database search, which can be solved by Grover's algorithm using quadratically fewer queries to the database than are required by classical algorithms. In this case the advantage is provable. Several other examples of provable quantum speedups for query problems have subsequently been discovered, such as for finding collisions in two-to-one functions and evaluating NAND trees.
Consider a problem that has these four properties:
The only way to solve it is to guess answers repeatedly and check them,
The number of possible answers to check is the same as the number of inputs,
Every possible answer takes the same amount of time to check, and
There are no clues about which answers might be better: generating possibilities randomly is just as good as checking them in some special order.
An example of this is a password cracker that attempts to guess the password for an encrypted file (assuming that the password has a maximum possible length).
For problems with all four properties, the time for a quantum computer to solve this will be proportional to the square root of the number of inputs. It can be used to attack symmetric ciphers such as Triple DES and AES by attempting to guess the secret key.[23]
Grover's algorithm can also be used to obtain a quadratic speed-up over a brute-force search for a class of problems known as NP-complete.
Since chemistry and nanotechnology rely on understanding quantum systems, and such systems are impossible to simulate in an efficient manner classically, many believe quantum simulation will be one of the most important applications of quantum computing.[24] Quantum simulation could also be used to simulate the behavior of atoms and particles at unusual conditions such as the reactions inside a collider.[25]
Quantum supremacy[edit]
Main article: Quantum supremacy
John Preskill has introduced the term quantum supremacy to refer to the hypothetical speedup advantage that a quantum computer would have over a classical computer in a certain field.[26] Google has announced that it expects to achieve quantum supremacy by the end of 2017, and IBM says that the best classical computers will be beaten on some task within about five years.[27] Quantum supremacy has not been achieved yet, and skeptics like Gil Kalai doubt that it will ever be.[28][29] Bill Unruh doubted the practicality of quantum computers in a paper published back in 1994.[30] Paul Davies pointed out that a 400-qubit computer would even come into conflict with the cosmological information bound implied by the holographic principle.[31] Those such as Roger Schlafly have pointed out that the claimed theoretical benefits of quantum computing go beyond the proven theory of quantum mechanics and imply non-standard interpretations, such as multiple worlds and negative probabilities. Schlafly maintains that the Born rule is just "metaphysical fluff" and that quantum mechanics doesn't rely on probability any more than other branches of science but simply calculates the expected values of observables. He also points out that arguments about Turing complexity cannot be run backwards.[32][33][34] Those who prefer Bayesian interpretations of quantum mechanics have questioned the physical nature of the mathematical abstractions employed.[35]
Obstacles[edit]
There are a number of technical challenges in building a large-scale quantum computer, and thus far quantum computers have yet to solve a problem faster than a classical computer. David DiVincenzo, of IBM, listed the following requirements for a practical quantum computer:[36]
scalable physically to increase the number of qubits;
qubits that can be initialized to arbitrary values;
quantum gates that are faster than decoherence time;
universal gate set;
qubits that can be read easily.
Quantum decoherence[edit]
Main article: Quantum decoherence
One of the greatest challenges is controlling or removing quantum decoherence. This usually means isolating the system from its environment as interactions with the external world cause the system to decohere. However, other sources of decoherence also exist. Examples include the quantum gates, and the lattice vibrations and background thermonuclear spin of the physical system used to implement the qubits. Decoherence is irreversible, as it is effectively non-unitary, and is usually something that should be highly controlled, if not avoided. Decoherence times for candidate systems, in particular the transverse relaxation time T2 (for NMR and MRI technology, also called the dephasing time), typically range between nanoseconds and seconds at low temperature.[14] Currently, some quantum computers require their qubits to be cooled to 20 millikelvins in order to prevent significant decoherence.[37]
As a result, time consuming tasks may render some quantum algorithms inoperable, as maintaining the state of qubits for a long enough duration will eventually corrupt the superpositions.[38]
These issues are more difficult for optical approaches as the timescales are orders of magnitude shorter and an often-cited approach to overcoming them is optical pulse shaping. Error rates are typically proportional to the ratio of operating time to decoherence time, hence any operation must be completed much more quickly than the decoherence time.
If the error rate is small enough, it is thought to be possible to use quantum error correction, which corrects errors due to decoherence, thereby allowing the total calculation time to be longer than the decoherence time. An often cited figure for required error rate in each gate is 10−4. This implies that each gate must be able to perform its task in one 10,000th of the coherence time of the system.
Meeting this scalability condition is possible for a wide range of systems. However, the use of error correction brings with it the cost of a greatly increased number of required qubits. The number required to factor integers using Shor's algorithm is still polynomial, and thought to be between L and L2, where L is the number of qubits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of L. For a 1000-bit number, this implies a need for about 104 bits without error correction.[39] With error correction, the figure would rise to about 107 bits. Computation time is about L2 or about 107 steps and at 1 MHz, about 10 seconds.
A very different approach to the stability-decoherence problem is to create a topological quantum computer with anyons, quasi-particles used as threads and relying on braid theory to form stable logic gates.[40][41]
Developments[edit]
There are a number of quantum computing models, distinguished by the basic elements in which the computation is decomposed. The four main models of practical importance are:
Quantum gate array (computation decomposed into sequence of few-qubit quantum gates)
One-way quantum computer (computation decomposed into sequence of one-qubit measurements applied to a highly entangled initial state or cluster state)
Adiabatic quantum computer, based on quantum annealing (computation decomposed into a slow continuous transformation of an initial Hamiltonian into a final Hamiltonian, whose ground states contain the solution)[42]
Topological quantum computer[43] (computation decomposed into the braiding of anyons in a 2D lattice)
The quantum Turing machine is theoretically important but direct implementation of this model is not pursued. All four models of computation have been shown to be equivalent; each can simulate the other with no more than polynomial overhead.
For physically implementing a quantum computer, many different candidates are being pursued, among them (distinguished by the physical system used to realize the qubits):
Superconducting quantum computing[44][45] (qubit implemented by the state of small superconducting circuits (Josephson junctions))
Trapped ion quantum computer (qubit implemented by the internal state of trapped ions)
Optical lattices (qubit implemented by internal states of neutral atoms trapped in an optical lattice)
Quantum dot computer, spin-based (e.g. the Loss-DiVincenzo quantum computer[46]) (qubit given by the spin states of trapped electrons)
Quantum dot computer, spatial-based (qubit given by electron position in double quantum dot)[47]
Nuclear magnetic resonance on molecules in solution (liquid-state NMR) (qubit provided by nuclear spins within the dissolved molecule)
Solid-state NMR Kane quantum computers (qubit realized by the nuclear spin state of phosphorus donors in silicon)
Electrons-on-helium quantum computers (qubit is the electron spin)
Cavity quantum electrodynamics (CQED) (qubit provided by the internal state of trapped atoms coupled to high-finesse cavities)
Molecular magnet[48] (qubit given by spin states)
Fullerene-based ESR quantum computer (qubit based on the electronic spin of atoms or molecules encased in fullerenes)
Linear optical quantum computer (qubits realized by processing states of different modes of light through linear elements e.g. mirrors, beam splitters and phase shifters)[49]
Diamond-based quantum computer[50][51][52] (qubit realized by electronic or nuclear spin of nitrogen-vacancy centers in diamond)
Bose–Einstein condensate-based quantum computer[53]
Transistor-based quantum computer – string quantum computers with entrainment of positive holes using an electrostatic trap
Rare-earth-metal-ion-doped inorganic crystal based quantum computers[54][55] (qubit realized by the internal electronic state of dopants in optical fibers)
Metallic-like carbon nanospheres based quantum computers[56]
The large number of candidates demonstrates that the topic, in spite of rapid progress, is still in its infancy. There is also a vast amount of flexibility.
Timeline[edit]
Main article: Timeline of quantum computing
In 1980 Russian mathematician, Yuri Manin proposed the idea.[57]
In 1981, at a conference co-organized by MIT and IBM, physicist Richard Feynman urged the world to build a quantum computer. He said "Nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical, and by golly it's a wonderful problem, because it doesn't look so easy."[58]
In 1984, BB84 is published, the world's first quantum cryptography protocol by IBM scientists Charles Bennett and Gilles Brassard.
In 1993, an international group of six scientists, including Charles Bennett, confirmed the intuitions of the majority of science fiction writers by showing that perfect quantum teleportation is indeed possible[59] in principle, but only if the original is destroyed.
In 1996, The DiVincenzo's criteria are published which is a list of conditions that are necessary for constructing a quantum computer proposed by the theoretical physicist David P. DiVincenzo in his 2000 paper "The Physical Implementation of Quantum Computation".
In 2001, researchers demonstrated Shor's algorithm to factor 15 using a 7-qubit NMR computer.[60]
In 2005, researchers at the University of Michigan built a semiconductor chip ion trap. Such devices from standard lithography, may point the way to scalable quantum computing.[61]
In 2009, researchers at Yale University created the first solid-state quantum processor. The two-qubit superconducting chip had artificial atom qubits made of a billion aluminum atoms that acted like a single atom that could occupy two states.[62][63]
A team at the University of Bristol, also created a silicon chip based on quantum optics, able to run Shor's algorithm.[64] Further developments were made in 2010.[65] Springer publishes a journal (Quantum Information Processing) devoted to the subject.[66]
In February 2010, Digital Combinational Circuits like adder, subtractor etc. are designed with the help of Symmetric Functions organized from different quantum gates.[67][68]
April 2011, a team of scientists from Australia and Japan made a breakthrough in quantum teleportation. They successfully transferred a complex set of quantum data with full transmission integrity, without affecting the qubits' superpositions.[69][70]
Photograph of a chip constructed by D-Wave Systems Inc., mounted and wire-bonded in a sample holder. The D-Wave processor is designed to use 128 superconducting logic elements that exhibit controllable and tunable coupling to perform operations.
In 2011, D-Wave Systems announced the first commercial quantum annealer, the D-Wave One, claiming a 128 qubit processor. On May 25, 2011 Lockheed Martin agreed to purchase a D-Wave One system.[71] Lockheed and the University of Southern California (USC) will house the D-Wave One at the newly formed USC Lockheed Martin Quantum Computing Center.[72] D-Wave's engineers designed the chips with an empirical approach, focusing on solving particular problems. Investors liked this more than academics, who said D-Wave had not demonstrated they really had a quantum computer. Criticism softened after a D-Wave paper in Nature, that proved the chips have some quantum properties.[73][74] Two published papers have suggested that the D-Wave machine's operation can be explained classically, rather than requiring quantum models.[75][76] Later work showed that classical models are insufficient when all available data is considered.[77] Experts remain divided on the ultimate classification of the D-Wave systems though their quantum behavior was established concretely with a demonstration of entanglement.[78]
During the same year, researchers at the University of Bristol created an all-bulk optics system that ran a version of Shor's algorithm to successfully factor 21.[79]
In September 2011 researchers proved quantum computers can be made with a Von Neumann architecture (separation of RAM).[80]
In November 2011 researchers factorized 143 using 4 qubits.[81]
In February 2012 IBM scientists said that they had made several breakthroughs in quantum computing with superconducting integrated circuits.[82]
In April 2012 a multinational team of researchers from the University of Southern California, Delft University of Technology, the Iowa State University of Science and Technology, and the University of California, Santa Barbara, constructed a two-qubit quantum computer on a doped diamond crystal that can easily be scaled up and is functional at room temperature. Two logical qubit directions of electron spin and nitrogen kernels spin were used, with microwave impulses. This computer ran Grover's algorithm generating the right answer from the first try in 95% of cases.[83]
In September 2012, Australian researchers at the University of New South Wales said the world's first quantum computer was just 5 to 10 years away, after announcing a global breakthrough enabling manufacture of its memory building blocks. A research team led by Australian engineers created the first working qubit based on a single atom in silicon, invoking the same technological platform that forms the building blocks of modern-day computers.[84][85]
In October 2012, Nobel Prizes were presented to David J. Wineland and Serge Haroche for their basic work on understanding the quantum world, which may help make quantum computing possible.[86][87]
In November 2012, the first quantum teleportation from one macroscopic object to another was reported by scientists at the University of Science and Technology of China in Hefei.[88][89]
In December 2012, the first dedicated quantum computing software company, 1QBit was founded in Vancouver, BC.[90] 1QBit is the first company to focus exclusively on commercializing software applications for commercially available quantum computers, including the D-Wave Two. 1QBit's research demonstrated the ability of superconducting quantum annealing processors to solve real-world problems.[91]
In February 2013, a new technique, boson sampling, was reported by two groups using photons in an optical lattice that is not a universal quantum computer but may be good enough for practical problems. Science Feb 15, 2013
In May 2013, Google announced that it was launching the Quantum Artificial Intelligence Lab, hosted by NASA's Ames Research Center, with a 512-qubit D-Wave quantum computer. The USRA (Universities Space Research Association) will invite researchers to share time on it with the goal of studying quantum computing for machine learning.[92]
In early 2014 it was reported, based on documents provided by former NSA contractor Edward Snowden, that the U.S. National Security Agency (NSA) is running a $79.7 million research program (titled "Penetrating Hard Targets") to develop a quantum computer capable of breaking vulnerable encryption.[93]
In 2014, a group of researchers from ETH Zürich, USC, Google and Microsoft reported a definition of quantum speedup, and were not able to measure quantum speedup with the D-Wave Two device, but did not explicitly rule it out.[94][95]
In 2014, researchers at University of New South Wales used silicon as a protectant shell around qubits, making them more accurate, increasing the length of time they will hold information and possibly made quantum computers easier to build.[96]
In April 2015 IBM scientists claimed two critical advances towards the realization of a practical quantum computer. They claimed the ability to detect and measure both kinds of quantum errors simultaneously, as well as a new, square quantum bit circuit design that could scale to larger dimensions.[97]
In October 2015 researchers at University of New South Wales built a quantum logic gate in silicon for the first time.[98]
In December 2015 NASA publicly displayed the world's first fully operational $15-million quantum computer made by the Canadian company D-Wave at the Quantum Artificial Intelligence Laboratory at its Ames Research Center in California's Moffett Field. The device was purchased in 2013 via a partnership with Google and Universities Space Research Association. The presence and use of quantum effects in the D-Wave quantum processing unit is more widely accepted.[99] In some tests it can be shown that the D-Wave quantum annealing processor outperforms Selby’s algorithm.[100]
In May 2016, IBM Research announced[101] that for the first time ever it is making quantum computing available to members of the public via the cloud, who can access and run experiments on IBM’s quantum processor. The service is called the IBM Quantum Experience. The quantum processor is composed of five superconducting qubits and is housed at the IBM T.J. Watson Research Center in New York.
In August 2016, scientists at the University of Maryland successfully built the first reprogrammable quantum computer.[102]
In October 2016 Basel University described a variant of the electron hole based quantum computer, which instead of manipulating electron spins uses electron holes in a semiconductor at low (mK) temperatures which are a lot less vulnerable to decoherence. This has been dubbed the "positronic" quantum computer as the quasi-particle behaves like it has a positive electrical charge.[103]
In March 2017, IBM announced an industry-first initiative to build commercially available universal quantum computing systems called IBM Q. The company also released a new API (Application Program Interface) for the IBM Quantum Experience that enables developers and programmers to begin building interfaces between its existing five quantum bit (qubit) cloud-based quantum computer and classical computers, without needing a deep background in quantum physics.
In May 2017, IBM announced[104] that it has successfully built and tested its most powerful universal quantum computing processors. The first is a 16 qubit processor that will allow for more complex experimentation than the previously available 5 qubit processor. The second is IBM's first prototype commercial processor with 17 qubits and leverages significant materials, device, and architecture improvements to make it the most powerful quantum processor created to date by IBM.
In July 2017, a group of U.S. researchers announced a quantum simulator with 51 qubits. The announcement was made by Mikhail Lukin of Harvard University at the International Conference on Quantum Technologies in Moscow.[105] A quantum simulator differs from a computer. Lukin’s simulator was designed to solve one equation. Solving a different equation would require building a new system. A computer can solve many different equations.
In November 2017, the University of Sydney research team in Australia successfully made a microwave circulator, an important quantum computer part, 1000 times smaller than a conventional circulator by using topological insulators to slow down the speed of light in a material.[106]
In December 2017, Microsoft released a preview version of a "Quantum Development Kit".[107] It includes a programming language, Q#, which can be used to write programs that are run on an emulated quantum computer.
Relation to computational complexity theory[edit]
Main article: Quantum complexity theory
The suspected relationship of BQP to other problem spaces.[108]
The class of problems that can be efficiently solved by quantum computers is called BQP, for "bounded error, quantum, polynomial time". Quantum computers only run probabilistic algorithms, so BQP on quantum computers is the counterpart of BPP ("bounded error, probabilistic, polynomial time") on classical computers. It is defined as the set of problems solvable with a polynomial-time algorithm, whose probability of error is bounded away from one half.[109] A quantum computer is said to "solve" a problem if, for every instance, its answer will be right with high probability. If that solution runs in polynomial time, then that problem is in BQP.
BQP is contained in the complexity class #P (or more precisely in the associated class of decision problems P#P),[110] which is a subclass of PSPACE.
BQP is suspected to be disjoint from NP-complete and a strict superset of P, but that is not known. Both integer factorization and discrete log are in BQP. Both of these problems are NP problems suspected to be outside BPP, and hence outside P. Both are suspected to not be NP-complete. There is a common misconception that quantum computers can solve NP-complete problems in polynomial time. That is not known to be true, and is generally suspected to be false.[110]
The capacity of a quantum computer to accelerate classical algorithms has rigid limits—upper bounds of quantum computation's complexity. The overwhelming part of classical calculations cannot be accelerated on a quantum computer.[111] A similar fact takes place for particular computational tasks, like the search problem, for which Grover's algorithm is optimal.[112]
Bohmian Mechanics is a non-local hidden variable interpretation of quantum mechanics. It has been shown that a non-local hidden variable quantum computer could implement a search of an N-item database at most in O ( N 3 ) {\displaystyle O({\sqrt[{3}]{N}})} steps. This is slightly faster than the O ( N ) {\displaystyle O({\sqrt {N}})} steps taken by Grover's algorithm. Neither search method will allow quantum computers to solve NP-Complete problems in polynomial time.[113]
Although quantum computers may be faster than classical computers for some problem types, those described above can't solve any problem that classical computers can't already solve. A Turing machine can simulate these quantum computers, so such a quantum computer could never solve an undecidable problem like the halting problem. The existence of "standard" quantum computers does not disprove the Church–Turing thesis.[114] It has been speculated that theories of quantum gravity, such as M-theory or loop quantum gravity, may allow even faster computers to be built. Currently, defining computation in such theories is an open problem due to the problem of time, i.e., there currently exists no obvious way to describe what it means for an observer to submit input to a computer and later receive output.[115][71]
See also[edit]
Chemical computer
DNA computing
Electronic quantum holography
Intelligence Advanced Research Projects Activity
Kane quantum computer
List of emerging technologies
List of quantum processors
Natural computing
Normal mode
Photonic computing
Post-quantum cryptography
Quantum annealing
Quantum bus
Quantum cognition
Quantum gate
Quantum machine learning
Quantum threshold theorem
Soliton
Theoretical computer science
Timeline of quantum computing
Topological quantum computer
Valleytronics
Quantum Computing portal
References[edit]
Jump up ^ Gershenfeld, Neil; Chuang, Isaac L. (June 1998). "Quantum Computing with Molecules" (PDF). Scientific American.
Jump up ^ Benioff, Paul (1980). "The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines". Journal of statistical physics. 22 (5): 563–591. Bibcode:1980JSP....22..563B. doi:10.1007/BF01011339.
Jump up ^ Manin, Yu. I. (1980). Vychislimoe i nevychislimoe [Computable and Noncomputable] (in Russian). Sov.Radio. pp. 13–15. Archived from the original on 2013-05-10. Retrieved 2013-03-04.
Jump up ^ Feynman, R. P.u (1982). "Simulating physics with computers". International Journal of Theoretical Physics. 21 (6): 467–488. Bibcode:1982IJTP...21..467F. doi:10.1007/BF02650179.
Jump up ^ Deutsch, David (1985). "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer". Proceedings of the Royal Society of London A. 400 (1818): 97–117. Bibcode:1985RSPSA.400...97D. CiteSeerX 10.1.1.144.7936  . doi:10.1098/rspa.1985.0070.
Jump up ^ Finkelstein, David (1968). "Space-Time Structure in High Energy Interactions". In Gudehus, T.; Kaiser, G. Fundamental Interactions at High Energy. New York: Gordon & Breach.
Jump up ^ Gershon, Eric (2013-01-14). "New qubit control bodes well for future of quantum computing". Phys.org. Retrieved 2014-10-26.
Jump up ^ Quantum Information Science and Technology Roadmap for a sense of where the research is heading.
Jump up ^ Explaining the upside and downside of D-Wave's new Quantum computer
Jump up ^ Simon, D.R. (1994). "On the power of quantum computation". Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on: 116–123. CiteSeerX 10.1.1.655.4355  . doi:10.1109/SFCS.1994.365701. ISBN 0-8186-6580-7.
^ Jump up to: a b c d Nielsen, Michael A.; Chuang, Isaac L. (2010). Quantum Computation and Quantum Information (2nd ed.). Cambridge: Cambridge University Press. ISBN 978-1-107-00217-3.
Jump up ^ Preskill, John (2015). "Lecture Notes for Ph219/CS219: Quantum Information Chapter 5" (PDF). p. 12.
Jump up ^ Waldner, Jean-Baptiste (2007). Nanocomputers and Swarm Intelligence. London: ISTE. p. 157. ISBN 2-7462-1516-0.
^ Jump up to: a b DiVincenzo, David P. (1995). "Quantum Computation". Science. 270 (5234): 255–261. Bibcode:1995Sci...270..255D. CiteSeerX 10.1.1.242.2165  . doi:10.1126/science.270.5234.255. (subscription required)
Jump up ^ Lenstra, Arjen K. (2000). "Integer Factoring" (PDF). Designs, Codes and Cryptography. 19 (2/3): 101–128. doi:10.1023/A:1008397921377. Archived from the original (PDF) on 2015-04-10.
^ Jump up to: a b Daniel J. Bernstein, Introduction to Post-Quantum Cryptography. Introduction to Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (editors). Post-quantum cryptography. Springer, Berlin, 2009. ISBN 978-3-540-88701-0
Jump up ^ See also pqcrypto.org, a bibliography maintained by Daniel J. Bernstein and Tanja Lange on cryptography not known to be broken by quantum computing.
Jump up ^ Robert J. McEliece. "A public-key cryptosystem based on algebraic coding theory." Jet Propulsion Laboratory DSN Progress Report 42–44, 114–116.
Jump up ^ Kobayashi, H.; Gall, F.L. (2006). "Dihedral Hidden Subgroup Problem: A Survey". Information and Media Technologies. 1 (1): 178–185.
Jump up ^ Bennett C.H., Bernstein E., Brassard G., Vazirani U., "The strengths and weaknesses of quantum computation". SIAM Journal on Computing 26(5): 1510–1523 (1997).
Jump up ^ Quantum Algorithm Zoo – Stephen Jordan's Homepage
Jump up ^ Jon Schiller, Phd. "Quantum Computers".
Jump up ^ Rich, Steven; Gellman, Barton (2014-02-01). "NSA seeks to build quantum computer that could crack most types of encryption". Washington Post.
Jump up ^ Norton, Quinn (2007-02-15). "The Father of Quantum Computing". Wired.com.
Jump up ^ Ambainis, Andris (Spring 2014). "What Can We Do with a Quantum Computer?". Institute for Advanced Study.
Jump up ^ Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.; Babbush, Ryan; Ding, Nan; Jiang, Zhang; Bremner, Michael J.; Martinis, John M.; Neven, Hartmut (31 July 2016). "Characterizing Quantum Supremacy in Near-Term Devices". arXiv:1608.00263  [quant-ph].
Jump up ^ Savage, Neil. "Quantum Computers Compete for "Supremacy"".
Jump up ^ "Quantum Supremacy and Complexity". 23 April 2016.
Jump up ^ Kalai, Gil. "The Quantum Computer Puzzle" (PDF). AMS.
Jump up ^ Unruh, Bill. "Maintaining coherence in Quantum Computers". arXiv.
Jump up ^ Davies, Paul. "The implications of a holographic universe for quantum information science and the nature of physical law" (PDF). Macquarie University.
Jump up ^ Schlafly, Roger. "Concise argument against quantum computing". Dark Buzz.
Jump up ^ Schlafly, Roger. "Impossibility of quantum computers". Dark Buzz.
Jump up ^ Schlafly, Roger. "No quantum probabilities needed". Dark Buzz.
Jump up ^ Hestenes, David. "Hunting for Snarks in Quantum Mechanics" (PDF). Arizona State University.
Jump up ^ DiVincenzo, David P. (2000-04-13). "The Physical Implementation of Quantum Computation". Fortschritte der Physik. 48 (9–11): 771–783. arXiv:quant-ph/0002077  [quant-ph]. Bibcode:2000ForPh..48..771D. doi:10.1002/1521-3978(200009)48:9/11<771::AID-PROP771>3.0.CO;2-E.
Jump up ^ Jones, Nicola (19 June 2013). "Computing: The quantum company". Nature. 498 (7454): 286–288. Bibcode:2013Natur.498..286J. doi:10.1038/498286a. PMID 23783610.
Jump up ^ Amy, Matthew; Matteo, Olivia; Gheorghiu, Vlad; Mosca, Michele; Parent, Alex; Schanck, John (November 30, 2016). "Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3". arXiv:1603.09383  [quant-ph].
Jump up ^ Dyakonov, M. I. (2006-10-14). "Is Fault-Tolerant Quantum Computation Really Possible?". In: Future Trends in Microelectronics. Up the Nano Creek, S. Luryi, J. Xu, and A. Zaslavsky (eds), Wiley, pp.: 4–18. arXiv:quant-ph/0610117  . Bibcode:2006quant.ph.10117D.
Jump up ^ Freedman, Michael H.; Kitaev, Alexei; Larsen, Michael J.; Wang, Zhenghan (2003). "Topological quantum computation". Bulletin of the American Mathematical Society. 40 (1): 31–38. arXiv:quant-ph/0101025  . doi:10.1090/S0273-0979-02-00964-3. MR 1943131.
Jump up ^ Monroe, Don (2008-10-01). "Anyons: The breakthrough quantum computing needs?". New Scientist.
Jump up ^ Das, A.; Chakrabarti, B. K. (2008). "Quantum Annealing and Analog Quantum Computation". Rev. Mod. Phys. 80 (3): 1061–1081. arXiv:0801.2193  . Bibcode:2008RvMP...80.1061D. CiteSeerX 10.1.1.563.9990  . doi:10.1103/RevModPhys.80.1061.
Jump up ^ Nayak, Chetan; Simon, Steven; Stern, Ady; Das Sarma, Sankar (2008). "Nonabelian Anyons and Quantum Computation". Rev Mod Phys. 80 (3): 1083–1159. arXiv:0707.1889  . Bibcode:2008RvMP...80.1083N. doi:10.1103/RevModPhys.80.1083.
Jump up ^ Clarke, John; Wilhelm, Frank (June 19, 2008). "Superconducting quantum bits". Nature. 453 (7198): 1031–1042. Bibcode:2008Natur.453.1031C. doi:10.1038/nature07128. PMID 18563154.
Jump up ^ Kaminsky, William M (2004). "Scalable Superconducting Architecture for Adiabatic Quantum Computation". arXiv:quant-ph/0403090  [quant-ph].
Jump up ^ Imamoğlu, Atac; Awschalom, D. D.; Burkard, Guido; DiVincenzo, D. P.; Loss, D.; Sherwin, M.; Small, A. (1999). "Quantum information processing using quantum dot spins and cavity-QED". Physical Review Letters. 83 (20): 4204–4207. Bibcode:1999PhRvL..83.4204I. doi:10.1103/PhysRevLett.83.4204.
Jump up ^ Fedichkin, Leonid; Yanchenko, Maxim; Valiev, Kamil (2000). "Novel coherent quantum bit using spatial quantization levels in semiconductor quantum dot". Quantum Computers and Computing. 1: 58–76. arXiv:quant-ph/0006097  . Bibcode:2000quant.ph..6097F.
Jump up ^ Leuenberger, MN; Loss, D (Apr 12, 2001). "Quantum computing in molecular magnets". Nature. 410 (6830): 789–93. arXiv:cond-mat/0011415  . Bibcode:2001Natur.410..789L. doi:10.1038/35071024. PMID 11298441.
Jump up ^ Knill, G. J.; Laflamme, R.; Milburn, G. J. (2001). "A scheme for efficient quantum computation with linear optics". Nature. 409 (6816): 46–52. Bibcode:2001Natur.409...46K. doi:10.1038/35051009. PMID 11343107.
Jump up ^ Nizovtsev, A. P. (August 2005). "A quantum computer based on NV centers in diamond: Optically detected nutations of single electron and nuclear spins". Optics and Spectroscopy. 99 (2): 248–260. Bibcode:2005OptSp..99..233N. doi:10.1134/1.2034610.
Jump up ^ Gruener, Wolfgang (2007-06-01). "Research indicates diamonds could be key to quantum storage". Retrieved 2007-06-04.
Jump up ^ Neumann, P.; et al. (June 6, 2008). "Multipartite Entanglement Among Single Spins in Diamond". Science. 320 (5881): 1326–1329. Bibcode:2008Sci...320.1326N. doi:10.1126/science.1157233. PMID 18535240.
Jump up ^ Millman, Rene (2007-08-03). "Trapped atoms could advance quantum computing". ITPro. Archived from the original on 2007-09-27. Retrieved 2007-07-26.
Jump up ^ Ohlsson, N.; Mohan, R. K.; Kröll, S. (January 1, 2002). "Quantum computer hardware based on rare-earth-ion-doped inorganic crystals". Opt. Commun. 201 (1–3): 71–77. Bibcode:2002OptCo.201...71O. doi:10.1016/S0030-4018(01)01666-2.
Jump up ^ Longdell, J. J.; Sellars, M. J.; Manson, N. B. (September 23, 2004). "Demonstration of conditional quantum phase shift between ions in a solid". Phys. Rev. Lett. 93 (13): 130503. arXiv:quant-ph/0404083  . Bibcode:2004PhRvL..93m0503L. doi:10.1103/PhysRevLett.93.130503. PMID 15524694.
Jump up ^ Náfrádi, Bálint; Choucair, Mohammad; Dinse, Klaus-Peter; Forró, László (July 18, 2016). "Room Temperature manipulation of long lifetime spins in metallic-like carbon nanospheres". Nature Communications. 7: 12232. arXiv:1611.07690  . Bibcode:2016NatCo...712232N. doi:10.1038/ncomms12232. PMC 4960311  . PMID 27426851.
Jump up ^ Manin, Yu I (1980). Vychislimoe i nevychislimoe (Computable and Noncomputable) (in Russian). Sov.Radio. pp. 13–15. Archived from the original Archived 2013-05-10 at the Wayback Machine. on May 10, 2013. Retrieved October 20, 2017.
Jump up ^ Gil, Dario (May 4, 2016). "The Dawn of Quantum Computing is Upon Us". Retrieved May 4, 2016.
Jump up ^ Bennett,, C. H. (29 March 1993). "Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels" (PDF). Physical Review Letters. 70 (13): 1895–1899. Bibcode:1993PhRvL..70.1895B. doi:10.1103/PhysRevLett.70.1895. PMID 10053414.
Jump up ^ Vandersypen, Lieven M. K.; Steffen, Matthias; Breyta, Gregory; Yannoni, Costantino S.; Sherwood, Mark H.; Chuang, Isaac L. (2001). "Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance". Nature. 414 (6866): 883–7. arXiv:quant-ph/0112176  . Bibcode:2001Natur.414..883V. doi:10.1038/414883a. PMID 11780055.
Jump up ^ "U-M develops scalable and mass-producible quantum computer chip". University of Michigan. 2005-12-12. Retrieved 2006-11-17.
Jump up ^ DiCarlo, L.; Chow, J. M.; Gambetta, J. M.; Bishop, Lev S.; Johnson, B. R.; Schuster, D. I.; Majer, J.; Blais, A.; Frunzio, L.; S. M. Girvin; R. J. Schoelkopf (9 July 2009). "Demonstration of two-qubit algorithms with a superconducting quantum processor" (PDF). Nature. 460 (7252): 240–4. arXiv:0903.2030  . Bibcode:2009Natur.460..240D. doi:10.1038/nature08121. PMID 19561592. Retrieved 2009-07-02.
Jump up ^ "Scientists Create First Electronic Quantum Processor". Yale University. 2009-07-02. Retrieved 2009-07-02.
Jump up ^ "Code-breaking quantum algorithm runs on a silicon chip". New Scientist. 2009-09-04. Retrieved 2009-10-14.
Jump up ^ "New Trends in Quantum Computation". Simons Conference on New Trends in Quantum Computation 2010: Program. C.N. Yang Institute for Theoretical Physics.
Jump up ^ "Quantum Information Processing". Springer.com. Retrieved on 2011-05-19.
Jump up ^ Bhattacharjee, Pijush Kanti (2010). "Digital Combinational Circuits Design by QCA Gates" (PDF). International Journal of Computer and Electrical Engineering (IJCEE), Singapore, vol. 2, no. 1, pp. 67–72, February 2010.
Jump up ^ Bhattacharjee, Pijush Kanti (2010). "Digital Combinational Circuits Design with the Help of Symmetric Functions Considering Heat Dissipation by Each QCA Gate" (PDF). International Journal of Computer and Electrical Engineering (IJCEE), Singapore, vol. 2, no. 4, pp. 666–672, August 2010.
Jump up ^ "Quantum teleporter breakthrough". University of New South Wales. 2011-04-15. Archived from the original on 2011-04-18.
Jump up ^ Lai, Richard (2011-04-18). "First light wave quantum teleportation achieved, opens door to ultra fast data transmission". Engadget.
^ Jump up to: a b "D-Wave Systems sells its first Quantum Computing System to Lockheed Martin Corporation". D-Wave. 2011-05-25. Retrieved 2011-05-30.
Jump up ^ "Operational Quantum Computing Center Established at USC". University of Southern California. 2011-10-29. Retrieved 2011-12-06.
Jump up ^ Johnson, M. W.; Amin, M. H. S.; Gildert, S.; Lanting, T.; Hamze, F.; Dickson, N.; Harris, R.; Berkley, A. J.; Johansson, J.; Bunyk, P.; Chapple, E. M.; Enderud, C.; Hilton, J. P.; Karimi, K.; Ladizinsky, E.; Ladizinsky, N.; Oh, T.; Perminov, I.; Rich, C.; Thom, M. C.; Tolkacheva, E.; Truncik, C. J. S.; Uchaikin, S.; Wang, J.; Wilson, B.; Rose, G. (12 May 2011). "Quantum annealing with manufactured spins". Nature. 473 (7346): 194–198. Bibcode:2011Natur.473..194J. doi:10.1038/nature10012. PMID 21562559.
Jump up ^ Simonite, Tom (October 4, 2012). "The CIA and Jeff Bezos Bet on Quantum Computing". Technology Review.
Jump up ^ Seung Woo Shin; Smith, Graeme; Smolin, John A.; Vazirani, Umesh (2014-05-02). "How "Quantum" is the D-Wave Machine?". arXiv:1401.7087  [quant-ph].
Jump up ^ Boixo, Sergio; Rønnow, Troels F.; Isakov, Sergei V.; Wang, Zhihui; Wecker, David; Lidar, Daniel A.; Martinis, John M.; Troyer, Matthias (2013-04-16). "Quantum Annealing With More Than 100 Qbits". Nature Physics. 10 (3): 218–224. arXiv:1304.4595  . Bibcode:2014NatPh..10..218B. doi:10.1038/nphys2900.
Jump up ^ Albash, Tameem; Rønnow, Troels F.; Troyer, Matthias; Lidar, Daniel A. (2014-09-12). "Reexamining classical and quantum models for the D-Wave One processor". The European Physical Journal Special Topics. 224 (111): 111–129. arXiv:1409.3827  . Bibcode:2015EPJST.224..111A. doi:10.1140/epjst/e2015-02346-0.
Jump up ^ Lanting, T.; Przybysz, A. J.; Smirnov, A. Yu.; Spedalieri, F. M.; Amin, M. H.; Berkley, A. J.; Harris, R.; Altomare, F.; Boixo, S.; Bunyk, P.; Dickson, N.; Enderud, C.; Hilton, J. P.; Hoskinson, E.; Johnson, M. W.; Ladizinsky, E.; Ladizinsky, N.; Neufeld, R.; Oh, T.; Perminov, I.; Rich, C.; Thom, M. C.; Tolkacheva, E.; Uchaikin, S.; Wilson, A. B.; Rose, G. (2014-05-29). "Entanglement in a quantum annealing processor". Physical Review X. prx. 4 (2): 021041. arXiv:1401.3500  . Bibcode:2014PhRvX...4b1041L. doi:10.1103/PhysRevX.4.021041.
Jump up ^ Lopez, Enrique Martin; Laing, Anthony; Lawson, Thomas; Alvarez, Roberto; Zhou, Xiao-Qi; O'Brien, Jeremy L. (2011). "Implementation of an iterative quantum order finding algorithm". Nature Photonics. 6 (11): 773–776. arXiv:1111.4147  . Bibcode:2012NaPho...6..773M. doi:10.1038/nphoton.2012.259.
Jump up ^ Mariantoni, Matteo; Wang, H.; Yamamoto, T.; Neeley, M.; Bialczak, Radoslaw C.; Chen, Y.; Lenander, M.; Lucero, Erik; O'Connell, A. D.; Sank, D.; Weides, M.; Wenner, J.; Yin, Y.; Zhao, J.; Korotkov, A. N.; Cleland, A. N.; Martinis, John M. (2011). "Quantum computer with Von Neumann architecture". Science. 334 (6052): 61–65. arXiv:1109.3743  . Bibcode:2011Sci...334...61M. doi:10.1126/science.1208517. PMID 21885732.
Jump up ^ Xu, Nanyang; Zhu, Jing; Lu, Dawei; Zhou, Xianyi; Peng, Xinhua; Du, Jiangfeng (2011). "Quantum Factorization of 143 on a Dipolar-Coupling NMR system". Physical Review Letters. 109 (26): 269902. arXiv:1111.3726  . Bibcode:2012PhRvL.109z9902X. doi:10.1103/PhysRevLett.109.269902.
Jump up ^ "IBM Says It's 'On the Cusp' of Building a Quantum Computer". PCMAG. Retrieved 2014-10-26.
Jump up ^ "Quantum computer built inside diamond". Futurity. Retrieved 2014-10-26.
Jump up ^ "Australian engineers write quantum computer 'qubit' in global breakthrough". The Australian. Retrieved 2012-10-03.
Jump up ^ "Breakthrough in bid to create first quantum computer". University of New South Wales. Retrieved 2012-10-03.
Jump up ^ Frank, Adam (October 14, 2012). "Cracking the Quantum Safe". New York Times. Retrieved 2012-10-14.
Jump up ^ Overbye, Dennis (October 9, 2012). "A Nobel for Teasing Out the Secret Life of Atoms". New York Times. Retrieved 2012-10-14.
Jump up ^ "First Teleportation from One Macroscopic Object to Another: The Physics arXiv Blog". MIT Technology Review. November 15, 2012. Retrieved 2012-11-17.
Jump up ^ Bao, Xiao-Hui; Xu, Xiao-Fan; Li, Che-Ming; Yuan, Zhen-Sheng; Lu, Chao-Yang; Pan, Jian-wei (November 13, 2012). "Quantum teleportation between remote atomic-ensemble quantum memories". Proceedings of the National Academy of Sciences. 109 (50): 20347–20351. arXiv:1211.2892  . Bibcode:2012PNAS..10920347B. doi:10.1073/pnas.1207329109. PMC 3528515  . PMID 23144222.
Jump up ^ "1QBit Founded". 1QBit.com. Retrieved 2014-06-22.
Jump up ^ "1QBit Research". 1QBit.com. Retrieved 2014-06-22.
Jump up ^ "Launching the Quantum Artificial Intelligence Lab". Research@Google Blog. Retrieved 2013-05-16.
Jump up ^ "NSA seeks to build quantum computer that could crack most types of encryption". Washington Post. January 2, 2014.
Jump up ^ Defining and detecting quantum speedup, Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, Matthias Troyer, 2014-01-13.
Jump up ^ "Quantum Chaos: After a Failed Speed Test, the D-Wave Debate Continues". Scientific American. 2014-06-19.
Jump up ^ Gaudin, Sharon (23 October 2014). "Researchers use silicon to push quantum computing toward reality". Computer World.
Jump up ^ "IBM achieves critical steps to first quantum computer". www-03.ibm.com. 29 April 2015.
Jump up ^ Condliffe, Jamie. "World's First Silicon Quantum Logic Gate Brings Quantum Computing One Step Closer".
Jump up ^ "3Q: Scott Aaronson on Google's new quantum-computing paper". MIT News. Retrieved 2016-01-05.
Jump up ^ Benchmarking a quantum annealing processor with the time-to-target metric, James King, Sheir Yarkoni, Mayssam M. Nevisi, Jeremy P. Hilton, Catherine C. McGeoch, 2015-08-20.
Jump up ^ "IBM Makes Quantum Computing Available on IBM Cloud to Accelerate Innovation". May 4, 2016. Retrieved May 4, 2016.
Jump up ^ MacDonald, Fiona. "Researchers have built the first reprogrammable quantum computer". ScienceAlert. Retrieved 8 August 2016.
Jump up ^ "A new Type of Quantum Bit". www.unibas.ch.
Jump up ^ "IBM Builds Its Most Powerful Universal Quantum Computing Processors". 17 May 2017. Retrieved 17 May 2017.
Jump up ^ Reynolds, Matt. "Quantum simulator with 51 qubits is largest ever". NewScientist. Retrieved 23 July 2017.
Jump up ^ https://www.sciencedaily.com/releases/2017/11/171128102924.htm
Jump up ^ https://www.youtube.com/watch?v=v7b4J2INq9c&feature=em-subs_digest
Jump up ^ Nielsen, p. 42
Jump up ^ Nielsen, p. 41
^ Jump up to: a b Bernstein, Ethan; Vazirani, Umesh (1997). "Quantum Complexity Theory". SIAM Journal on Computing. 26 (5): 1411–1473. CiteSeerX 10.1.1.144.7852  . doi:10.1137/S0097539796300921.
Jump up ^ Ozhigov, Yuri (1999). "Quantum Computers Speed Up Classical with Probability Zero". Chaos Solitons Fractals. 10 (10): 1707–1714. arXiv:quant-ph/9803064  . Bibcode:1998quant.ph..3064O. doi:10.1016/S0960-0779(98)00226-4.
Jump up ^ Ozhigov, Yuri (1999). "Lower Bounds of Quantum Search for Extreme Point". Proceedings of the London Royal Society. A455 (1986): 2165–2172. arXiv:quant-ph/9806001  . Bibcode:1999RSPSA.455.2165O. doi:10.1098/rspa.1999.0397.
Jump up ^ Aaronson, Scott. "Quantum Computing and Hidden Variables" (PDF).
Jump up ^ Nielsen, p. 126
Jump up ^ Scott Aaronson, NP-complete Problems and Physical Reality, ACM SIGACT News, Vol. 36, No. 1. (March 2005), pp. 30–52, section 7 "Quantum Gravity": "[…] to anyone who wants a test or benchmark for a favorite quantum gravity theory,[author's footnote: That is, one without all the bother of making numerical predictions and comparing them to observation] let me humbly propose the following: can you define Quantum Gravity Polynomial-Time? […] until we can say what it means for a 'user' to specify an 'input' and ‘later' receive an 'output'—there is no such thing as computation, not even theoretically." (emphasis in original)
Further reading[edit]
Nielsen, Michael; Chuang, Isaac (2000). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. ISBN 0-521-63503-9. OCLC 174527496.
Dibyendu Chatterjee; Arijit Roy (2015). "A transmon-based quantum half-adder scheme". Progress of Theoretical and Experimental Physics. 2015 (9): 093A02(16pages). Bibcode:2015PTEP.2015i3A02C. doi:10.1093/ptep/ptv122.
Abbot, Derek; Doering, Charles R.; Caves, Carlton M.; Lidar, Daniel M.; Brandt, Howard E.; Hamilton, Alexander R.; Ferry, David K.; Gea-Banacloche, Julio; Bezrukov, Sergey M.; Kish, Laszlo B. (2003). "Dreams versus Reality: Plenary Debate Session on Quantum Computing". Quantum Information Processing. 2 (6): 449–472. arXiv:quant-ph/0310130  . doi:10.1023/B:QINP.0000042203.24782.9a. hdl:2027.42/45526.
DiVincenzo, David P. (2000). "The Physical Implementation of Quantum Computation". Experimental Proposals for Quantum Computation. arXiv:quant-ph/0002077
DiVincenzo, David P. (1995). "Quantum Computation". Science. 270 (5234): 255–261. Bibcode:1995Sci...270..255D. CiteSeerX 10.1.1.242.2165  . doi:10.1126/science.270.5234.255. Table 1 lists switching and dephasing times for various systems.
Feynman, Richard (1982). "Simulating physics with computers". International Journal of Theoretical Physics. 21 (6–7): 467–488. Bibcode:1982IJTP...21..467F. doi:10.1007/BF02650179.
Jaeger, Gregg (2006). Quantum Information: An Overview. Berlin: Springer. ISBN 0-387-35725-4. OCLC 255569451.
Singer, Stephanie Frank (2005). Linearity, Symmetry, and Prediction in the Hydrogen Atom. New York: Springer. ISBN 0-387-24637-1. OCLC 253709076.
Benenti, Giuliano (2004). Principles of Quantum Computation and Information Volume 1. New Jersey: World Scientific. ISBN 981-238-830-3. OCLC 179950736.
Lomonaco, Sam. Four Lectures on Quantum Computing given at Oxford University in July 2006
C. Adami, N.J. Cerf. (1998). "Quantum computation with linear optics". arXiv:quant-ph/9806048v1.
Stolze, Joachim; Suter, Dieter (2004). Quantum Computing. Wiley-VCH. ISBN 3-527-40438-4.
Mitchell, Ian (1998). "Computing Power into the 21st Century: Moore's Law and Beyond".
Landauer, Rolf (1961). "Irreversibility and heat generation in the computing process" (PDF).
Moore, Gordon E. (1965). Cramming more components onto integrated circuits. Electronics Magazine.
Keyes, R. W. (1988). Miniaturization of electronics and its limits. IBM Journal of Research and Development.
Nielsen, M. A.; Knill, E.; Laflamme, R. "Complete Quantum Teleportation By Nuclear Magnetic Resonance".
Vandersypen, Lieven M.K.; Yannoni, Constantino S.; Chuang, Isaac L. (2000). Liquid state NMR Quantum Computing.
Hiroshi, Imai; Masahito, Hayashi (2006). Quantum Computation and Information. Berlin: Springer. ISBN 3-540-33132-8.
Berthiaume, Andre (1997). "Quantum Computation".
Simon, Daniel R. (1994). "On the Power of Quantum Computation". Institute of Electrical and Electronic Engineers Computer Society Press.
"Seminar Post Quantum Cryptology". Chair for communication security at the Ruhr-University Bochum. [permanent dead link]
Sanders, Laura (2009). "First programmable quantum computer created".
"New trends in quantum computation".
Wichert, Andreas (2014). Principles of Quantum Artificial Intelligence. World Scientific Publishing Co. ISBN 978-981-4566-74-2.
Akama, Seiki (2014). Elements of Quantum Computing: History, Theories and Engineering Applications. Springer International Publishing. ISBN 978-3-319-08284-4.
External links[edit]
Wikimedia Commons has media related to Quantum computer.
for video explanation click here
Stanford Encyclopedia of Philosophy: "Quantum Computing" by Amit Hagar.
Quantum Annealing and Computation: A Brief Documentary Note, A. Ghosh and S. Mukherjee
Maryland University Laboratory for Physical Sciences: conducts researches for the quantum computer-based project led by the NSA, named 'Penetrating Hard Target'.
Visualized history of quantum computing
Quantum Annealing and Analog Quantum Computation by Arnab Das and BK Chakrabarti
Hazewinkel, Michiel, ed. (2001) [1994], "Quantum computation, theory of", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4
Patenting in the field of quantum computing
Lectures
for video explanation click here
Quantum computing for the determined – 22 video lectures by Michael Nielsen
Video Lectures by David Deutsch
Lectures at the Institut Henri Poincaré (slides and videos)
Online lecture on An Introduction to Quantum Computing, Edward Gerjuoy (2008)
Quantum Computing research by Mikko Möttönen at Aalto University (video) on YouTube
[show]
v
t
e
Quantum information science
General
Quantum computer
Qubit
DiVincenzo's criteria
Quantum information
Quantum machine
Quantum programming
Timeline of quantum computing
Cloud-based quantum computing
Quantum communication
Quantum capacity
Classical capacity
Entanglement-assisted classical capacity
Quantum channel
Quantum network
Quantum cryptography
Quantum key distribution
Quantum energy teleportation
Quantum teleportation
Superdense coding
LOCC
Entanglement distillation
Quantum algorithms
Universal quantum simulator
Deutsch–Jozsa algorithm
Grover's algorithm
Quantum Fourier transform
Shor's algorithm
Simon's problem
Quantum phase estimation algorithm
Quantum counting algorithm
Quantum annealing
Algorithmic cooling
Quantum algorithm for linear systems of equations
Amplitude amplification
Quantum complexity theory
Quantum Turing machine
EQP
BQP
QMA
PostBQP
Quantum computing models
Quantum circuit
Quantum gate
One-way quantum computer
cluster state
Adiabatic quantum computation
Topological quantum computer
Decoherence prevention
Quantum error correction
Stabilizer codes
Entanglement-Assisted Quantum Error Correction
Quantum convolutional codes
Physical implementations
Quantum optics
Cavity QED
Circuit QED
Linear optical quantum computing
KLM protocol
Boson sampling
Ultracold atoms
Trapped ion quantum computer
Optical lattice
Spin-based
Nuclear magnetic resonance QC
Kane QC
Loss–DiVincenzo QC
Nitrogen-vacancy center
Superconducting quantum computing
Charge qubit
Flux qubit
Phase qubit
Transmon
[show]
v
t
e
Emerging technologies
Fields
Agriculture
Agricultural robot
Closed ecological systems
Cultured meat
Genetically modified food
Precision agriculture
Vertical farming
Architecture
Arcology
Building printing
Contour crafting
D-Shape
Domed city
Biomedical
Artificial uterus
Ampakine
Brain transplant
Cryonics
Cryoprotectant
Cryopreservation
Vitrification
Suspended animation
De-extinction
Genetic engineering
Gene therapy
Head transplant
Isolated brain
Life extension
Strategies for Engineered Negligible Senescence
Nanomedicine
Nanosensors
Personalized medicine
Regenerative medicine
Stem-cell therapy
Tissue engineering
Robot-assisted surgery
Synthetic biology
Synthetic genomics
Virotherapy
Oncolytic virus
Tricorder
Whole genome sequencing
Displays
Next generation
FED
FLCD
iMoD
Laser
LPD
OLED
OLET
QD-LED
SED
TPD
TDEL
TMOS
Screenless
Bionic contact lens
Head-mounted display
Head-up display
Optical head-mounted display
Virtual retinal display
Other
Autostereoscopy
Flexible display
Holographic display
Computer-generated holography
Multi-primary color display
Ultra HD
Volumetric display
Electronics
Electronic nose
E-textiles
Flexible electronics
Molecular electronics
Nanoelectromechanical systems
Memristor
Spintronics
Thermal copper pillar bump
Energy
Production
Airborne wind turbine
Artificial photosynthesis
Biofuels
Carbon-neutral fuel
Concentrated solar power
Fusion power
Home fuel cell
Hydrogen economy
Methanol economy
Molten salt reactor
Nantenna
Photovoltaic pavement
Space-based solar power
Vortex engine
Storage
Beltway battery
Compressed air energy storage
Flywheel energy storage
Grid energy storage
Lithium–air battery
Molten-salt battery
Nanowire battery
Research in lithium-ion batteries
Silicon–air battery
Thermal energy storage
Ultracapacitor
Other
Smart grid
Wireless power
Information and
communications
Ambient intelligence
Internet of things
Artificial intelligence
Applications of artificial intelligence
Progress in artificial intelligence
Machine translation
Mobile translation
Machine vision
Semantic Web
Speech recognition
Atomtronics
Carbon nanotube field-effect transistor
Cybermethodology
Fourth-generation optical discs
3D optical data storage
Holographic data storage
GPGPU
Memory
CBRAM
FRAM
Millipede
MRAM
NRAM
PRAM
Racetrack memory
RRAM
SONOS
Optical computing
RFID
Chipless RFID
Software-defined radio
Three-dimensional integrated circuit
Manufacturing
3D printing
Claytronics
Molecular assembler
Utility fog
Materials science
Aerogel
Amorphous metal
Artificial muscle
Conductive polymer
Femtotechnology
Fullerene
Graphene
High-temperature superconductivity
High-temperature superfluidity
Linear acetylenic carbon
Metamaterials
Metamaterial cloaking
Metal foam
Multi-function structures
Nanotechnology
Carbon nanotubes
Molecular nanotechnology
Nanomaterials
Picotechnology
Programmable matter
Quantum dots
Silicene
Superalloy
Synthetic diamond
Military
Antimatter weapon
Caseless ammunition
Directed-energy weapon
Laser
Maser
Particle-beam weapon
Sonic weapon
Coilgun
Railgun
Plasma weapon
Pure fusion weapon
Stealth technology
Vortex ring gun
Neuroscience
Artificial brain
Blue Brain Project
Brain–computer interface
Electroencephalography
Mind uploading
Brain-reading
Neuroinformatics
Neuroprosthetics
Bionic eye
Brain implant
Exocortex
Retinal implant
Quantum
Quantum algorithms
Quantum amplifier
Quantum bus
Quantum channel
Quantum circuit
Quantum complexity theory
Quantum computing
Quantum cryptography
Quantum dynamics
Quantum electronics
Quantum error correction
Quantum imaging
Quantum information
Quantum key distribution
Quantum logic
Quantum logic gates
Quantum machine
Quantum machine learning
Quantum metamaterial
Quantum metrology
Quantum network
Quantum neural network
Quantum optics
Quantum programming
Quantum sensing
Quantum simulator
Quantum teleportation
Robotics
Domotics
Nanorobotics
Powered exoskeleton
Self-reconfiguring modular robot
Swarm robotics
Uncrewed vehicle
Space science
Launch
Fusion rocket
Non-rocket spacelaunch
Mass driver
Orbital ring
Skyhook
Space elevator
Space fountain
Space tether
Reusable launch system
Propulsion
Beam-powered propulsion
Ion thruster
Laser propulsion
Plasma propulsion engine
Helicon thruster
VASIMR
Project Orion
Nuclear pulse propulsion
Solar sail
Other
Interstellar travel
Propellant depot
Transport
Aerial
Adaptive compliant wing
Aeroscraft
Backpack helicopter
Delivery drone
Flying car
High-altitude platform
Jet pack
Pulse detonation engine
Scramjet
Spaceplane
Skylon
Supersonic transport
Land
Airless tire
Tweel
Alternative fuel vehicle
Hydrogen vehicle
Driverless car
Ground effect train
Maglev train
Personal rapid transit
Vactrain
ET3 Global Alliance
Hyperloop
Vehicular communication systems
Pipeline
Pneumatic transport
Automated vacuum collection
Foodtubes
Other
Anti-gravity
Cloak of invisibility
Digital scent technology
Force field
Plasma window
Immersive virtual reality
VirtuSphere
Magnetic refrigeration
Phased-array optics
Topics
Collingridge dilemma
Differential technological development
Ephemeralization
Exploratory engineering
Fictional technology
Proactionary principle
Technological change
Technological unemployment
Technological convergence
Technological evolution
Technological paradigm
Technology forecasting
Accelerating change
Moore's law
Technological singularity
Technology scouting
Technology readiness level
Technology roadmap
Transhumanism
Category
List
[show]
v
t
e
Major fields of computer science
Note: This template roughly follows the 2012 ACM Computing Classification System.
Hardware
Printed circuit board
Peripheral
Integrated circuit
Very-large-scale integration
Energy consumption
Electronic design automation
Computer systems
organization
Computer architecture
Embedded system
Real-time computing
Dependability
Networks
Network architecture
Network protocol
Network components
Network scheduler
Network performance evaluation
Network service
Software organization
Interpreter
Middleware
Virtual machine
Operating system
Software quality
Software notations
and tools
Programming paradigm
Programming language
Compiler
Domain-specific language
Modeling language
Software framework
Integrated development environment
Software configuration management
Software library
Software repository
Software development
Software development process
Requirements analysis
Software design
Software construction
Software deployment
Software maintenance
Programming team
Open-source model
Theory of computation
Model of computation
Formal language
Automata theory
Computational complexity theory
Logic
Semantics
Algorithms
Algorithm design
Analysis of algorithms
Randomized algorithm
Computational geometry
Mathematics
of computing
Discrete mathematics
Probability
Statistics
Mathematical software
Information theory
Mathematical analysis
Numerical analysis
Information
systems
Database management system
Information storage systems
Enterprise information system
Social information systems
Geographic information system
Decision support system
Process control system
Multimedia information system
Data mining
Digital library
Computing platform
Digital marketing
World Wide Web
Information retrieval
Security
Cryptography
Formal methods
Security services
Intrusion detection system
Hardware security
Network security
Information security
Application security
Human–computer
interaction
Interaction design
Social computing
Ubiquitous computing
Visualization
Accessibility
Concurrency
Concurrent computing
Parallel computing
Distributed computing
Multithreading
Multiprocessing
Artificial
intelligence
Natural language processing
Knowledge representation and reasoning
Computer vision
Automated planning and scheduling
Search methodology
Control method
Philosophy of artificial intelligence
Distributed artificial intelligence
Machine learning
Supervised learning
Unsupervised learning
Reinforcement learning
Multi-task learning
Cross-validation
Graphics
Animation
Rendering
Image manipulation
Graphics processing unit
Mixed reality
Virtual reality
Image compression
Solid modeling
Applied
computing
E-commerce
Enterprise software
Computational mathematics
Computational physics
Computational chemistry
Computational biology
Computational social science
Computational engineering
Computational healthcare
Digital art
Electronic publishing
Cyberwarfare
Electronic voting
Video game
Word processing
Operations research
Educational technology
Document management
Book
Category
Portal
WikiProject
Commons
[show]
v
t
e
Quantum mechanics
Background
Introduction
History
timeline
Classical mechanics
Old quantum theory
Glossary
Fundamentals
Bra–ket notation
Complementarity
Density matrix
Energy level
ground state
excited state
degenerate levels
zero-point energy
Entanglement
Hamiltonian
Interference
Decoherence
Measurement
Nonlocality
Quantum state
Superposition
Tunnelling
Scattering theory
Symmetry in quantum mechanics
Uncertainty
Wave function
collapse
wave–particle duality
Formulations
Formulations
Heisenberg
Interaction
Matrix mechanics
Schrödinger
Path integral formulation
Phase space
Equations
Dirac
Klein–Gordon
Pauli
Rydberg
Schrödinger
Interpretations
Interpretations
Bayesian
Consistent histories
Copenhagen
de Broglie–Bohm
Ensemble
Hidden variables
Many-worlds
Objective collapse
Quantum logic
Relational
Stochastic
Transactional
Cosmological
Experiments
Afshar
Bell's inequality
Cold Atom Laboratory
Davisson–Germer
Delayed choice quantum eraser
Double-slit
Franck–Hertz experiment
Leggett–Garg inequality
Mach-Zehnder inter.
Elitzur–Vaidman
Popper
Quantum eraser
Schrödinger's cat
Stern–Gerlach
Wheeler's delayed choice
Science
Quantum Bayesianism
Quantum biology
Quantum calculus
Quantum chemistry
Quantum chaos
Quantum cognition
Quantum cosmology
Quantum differential calculus
Quantum dynamics
Quantum evolution
Quantum geometry
Quantum group
Quantum measurement problem
Quantum mind
Quantum probability
Quantum stochastic calculus
Quantum spacetime
Technology
Quantum algorithms
Quantum amplifier
Quantum bus
Quantum cellular automata
Quantum finite automata
Quantum channel
Quantum circuit
Quantum complexity theory
Quantum computing
Timeline
Quantum cryptography
Quantum electronics
Quantum error correction
Quantum imaging
Quantum image processing
Quantum information
Quantum key distribution
Quantum logic
Quantum logic gates
Quantum machine
Quantum machine learning
Quantum metamaterial
Quantum metrology
Quantum network
Quantum neural network
Quantum optics
Quantum programming
Quantum sensing
Quantum simulator
Quantum teleportation
Extensions
Quantum statistical mechanics
Relativistic quantum mechanics
Quantum field theory
history
Quantum gravity
Fractional quantum mechanics
Category
Portal:Physics
Commons
Authority control
LCCN: sh98002795
GND: 4533372-5
BNF: cb135068781 (data)
NDL: 01072652
BNE: XX556504
Retrieved from "https://en.wikipedia.org/w/index.php?title=Quantum_computing&oldid=818451671"
Categories:
Quantum information science
Quantum computing
Models of computation
Quantum cryptography
Information theory
Computational complexity theory
Classes of computers
Theoretical computer science
Open problems
Computer-related introductions in 1980
Emerging technologies
Hidden categories:
CS1 Russian-language sources (ru)
Pages containing links to subscription-only content
Webarchive template wayback links
Articles needing additional references from June 2015
All articles needing additional references
Interlanguage link template link number
Articles containing potentially dated statements from 2017
All articles containing potentially dated statements
All articles with dead external links
Articles with dead external links from November 2017
Articles with permanently dead external links
Wikipedia articles with LCCN identifiers
Wikipedia articles with GND identifiers
Wikipedia articles with BNF identifiers
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
In other projects
Wikimedia Commons
Wikiquote
Languages
Alemannisch
العربية
বাংলা
Български
Bosanski
Català
Čeština
Dansk
Deutsch
Eesti
Ελληνικά
Español
Euskara
فارسی
Français
Frysk
Gaeilge
Galego
한국어
हिन्दी
Hrvatski
Bahasa Indonesia
Íslenska
Italiano
עברית
ಕನ್ನಡ
ქართული
Latviešu
Lietuvių
Magyar
Malti
Nederlands
日本語
Norsk
ਪੰਜਾਬੀ
Polski
Português
Română
Русский
Scots
Shqip
Simple English
Slovenčina
Slovenščina
Српски / srpski
Srpskohrvatski / српскохрватски
Suomi
Svenska
தமிழ்
Türkçe
Українська
Tiếng Việt
中文
Edit links
This page was last edited on 3 January 2018, at 17:05.
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

values: mw-page-base noprint

values: mw-head-base noprint

values: firstHeading firstHeading en

values: siteSub noprint

values: jump-to-nav mw-jump

value: img

attrs: href class

attrs: class href

values: Help:Introduction to referencing with Wiki Markup/1

value: span

value: i

value: small

values: plainlinks metadata ambox ambox-content ambox-Refimprove

values: vertical-align: -2.005ex; width:21.692ex; height:5.509ex;

values: Glossary of elementary quantum mechanics

values: padding:0.3em 0.4em 0.3em;font-weight:bold;border-top: 1px solid #aaa; border-bottom: 1px solid #aaa;display:block;margin-bottom:0.4em;

values: font-size: 105%; padding: 0.2em 0px 0.4em; text-align: center; border-top-width: 1px; border-top-style: solid; border-top-color: rgb(170, 170, 170); border-bottom-width: 1px; border-bottom-style: solid; border-bottom-color: rgb(170, 170, 170); display: none;

values: Mathematical formulation of quantum mechanics

values:
/wiki/Roy_Glauber
mw-redirect
Roy Glauber

values: text-align:right;font-size:115%;padding-top: 0.6em;border-top:1px solid #aaa;padding-top:0.1em;

values: vertical-navbox nowraplinks plainlist nowraplinks

values: float:right;clear:right;width:22.0em;margin:0 0 1.0em 1.0em;background:#f9f9f9;border:1px solid #aaa;padding:0.2em;border-spacing:0.4em 0;text-align:center;line-height:1.4em;font-size:88%;width:19.0em;

values:
noprint
font-size:85%; font-style: normal;

values: plainlinks noexcerpt noprint asof-tag update

values:
/wiki/Simon%27s_algorithm
mw-redirect
Simon's algorithm

values: vertical-align: -0.338ex; width:1.395ex; height:1.676ex;

values: vertical-align: -0.338ex; width:2.381ex; height:2.343ex;

values: vertical-align: -0.838ex; width:2.714ex; height:2.843ex;

values: vertical-align: -0.338ex; width:6.478ex; height:2.676ex;

values: vertical-align: -0.838ex; width:27.319ex; height:2.843ex;

values: vertical-align: -0.671ex; width:2.319ex; height:2.009ex;

values: vertical-align: -3.005ex; width:8.119ex; height:5.509ex;

values: vertical-align: -0.338ex; width:1.211ex; height:2.176ex;

values: vertical-align: -0.838ex; width:4.666ex; height:3.343ex;

values: vertical-align: -0.838ex; width:4.632ex; height:3.343ex;

values: vertical-align: -0.838ex; width:46.103ex; height:3.343ex;

values:
/wiki/Bra-ket_notation
mw-redirect
Bra-ket notation

values: vertical-align: -0.838ex; width:81.563ex; height:2.843ex;

values: vertical-align: -0.838ex; width:26.484ex; height:2.843ex;

values: vertical-align: -0.838ex; width:10.981ex; height:2.843ex;

values: vertical-align: -1.838ex; width:15.04ex; height:4.176ex;

values: |+\rangle ={\tfrac {1}{\sqrt {2}}}\left(1,1\right)

values: vertical-align: -1.838ex; width:16.848ex; height:4.176ex;

values: |-\rangle ={\tfrac {1}{\sqrt {2}}}\left(1,-1\right)

values:
/wiki/Universal_quantum_computer
mw-redirect
Universal quantum computer

values: float:right; width:30%; margin:0em 1em 1em 1em; background:#eee; border:#ccc solid

values: vertical-align: -0.838ex; width:5.039ex; height:2.843ex;

values:
/wiki/Public_key_cryptography
mw-redirect
Public key cryptography

values:
/wiki/Polynomial_time
mw-redirect
Polynomial time

values:
/wiki/Asymmetric_Algorithms
mw-redirect
Asymmetric Algorithms

values:
/wiki/RSA_(algorithm)
mw-redirect
RSA (algorithm)

values:
/wiki/Elliptic_curve_Diffie-Hellman
mw-redirect
Elliptic curve Diffie-Hellman

values:
/wiki/David_P._DiVincenzo
mw-redirect
David P. DiVincenzo

values:
/wiki/Josephson_junctions
mw-redirect
Josephson junctions

values:
/wiki/Loss-DiVincenzo_quantum_computer
mw-redirect
Loss-DiVincenzo quantum computer

values: Nuclear magnetic resonance quantum computer

values:
/wiki/Nuclear_spin
mw-redirect
Nuclear spin

values:
/wiki/Molecular_magnet
mw-redirect
Molecular magnet

values:
/wiki/Diamond-based_quantum_computer
mw-redirect
Diamond-based quantum computer

values:
/wiki/Quantum_cryptography_protocol
mw-redirect
Quantum cryptography protocol

values:
/wiki/Semiconductor_chip
mw-redirect
Semiconductor chip

values: Iowa State University of Science and Technology

values: University of Science and Technology of China

values:
/wiki/ETH_Z%C3%BCrich
mw-redirect
ETH Zürich

values:
nofollow
http://www.nas.nasa.gov/quantum/
external text

values:
nofollow
https://www.nasa.gov/centers/ames/home/
external text

values:
nofollow
http://www.usra.edu/
external text

values:
/wiki/IBM_T.J._Watson_Research_Center
mw-redirect
IBM T.J. Watson Research Center

values:
/wiki/University_of_Maryland
mw-redirect
University of Maryland

values:
/wiki/Application_Program_Interface
mw-redirect
Application Program Interface

values:
nofollow
http://conference.rqc.ru/
external text

values:
/wiki/Microwave_circulator
mw-redirect
Microwave circulator

values:
/wiki/Topological_insulators
mw-redirect
Topological insulators

values: Edit section: Relation to computational complexity theory

values:
/wiki/Probabilistic_algorithm
mw-redirect
Probabilistic algorithm

values:
/wiki/Discrete_logarithm_problem
mw-redirect
Discrete logarithm problem

values: vertical-align: -0.838ex; width:7.582ex; height:3.176ex;

values: Intelligence Advanced Research Projects Activity

values:
/wiki/Photonic_computing
mw-redirect
Photonic computing

values: margin:0.5em 0 0.5em 1em;border:solid #aaa 1px

values:
/wiki/Portal:Quantum_Computing
mw-redirect
Portal:Quantum Computing

values: display:table-cell;padding:0.2em 0.2em 0.2em 0.3em;vertical-align:middle

values: -moz-column-width: 20em; -webkit-column-width: 20em; column-width: 20em;

values:
/wiki/Isaac_L._Chuang
mw-redirect
Isaac L. Chuang

values:
nofollow
external text
//doi.org/10.1007%2FBF01011339

values: International Journal of Theoretical Physics

values:
nofollow
external text
//doi.org/10.1007%2FBF02650179

values:
nofollow
external text
//doi.org/10.1098%2Frspa.1985.0070

values:
nofollow
external text
http://qist.lanl.gov/qcomp_map.shtml

values:
nofollow
external text
//doi.org/10.1109%2FSFCS.1994.365701

values:
/wiki/Michael_A._Nielsen
mw-redirect
Michael A. Nielsen

values: Quantum Computation and Quantum Information (book)

values: International Society for Technology in Education

values: font-size:0.95em; font-size: 90%; color: #555

values:
nofollow
external text
//doi.org/10.1023%2FA%3A1008397921377

values:
nofollow
http://pqcrypto.org/
external text

values:
nofollow
http://math.nist.gov/quantum/zoo/
external text

values:
nofollow
external text
//arxiv.org/abs/1608.00263

values:
nofollow
external text
//arxiv.org/archive/quant-ph

values:
nofollow
external text
https://arxiv.org/abs/hep-th/9406058

values:
nofollow
external text
http://power.itp.ac.cn/~mli/pdavies.pdf

values:
nofollow
external text
//arxiv.org/abs/quant-ph/0002077

values:
nofollow
external text
//doi.org/10.1038%2F498286a

values:
/wiki/PubMed_Identifier
mw-redirect
PubMed Identifier

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/23783610

values:
nofollow
external text
//arxiv.org/abs/1603.09383

values:
nofollow
external text
//arxiv.org/abs/quant-ph/0610117

values:
nofollow
external text
//arxiv.org/abs/quant-ph/0101025

values:
nofollow
external text
//arxiv.org/abs/0801.2193

values:
nofollow
external text
//doi.org/10.1103%2FRevModPhys.80.1061

values:
nofollow
external text
//arxiv.org/abs/0707.1889

values:
nofollow
external text
//doi.org/10.1103%2FRevModPhys.80.1083

values:
nofollow
external text
//doi.org/10.1038%2Fnature07128

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/18563154

values:
nofollow
external text
//arxiv.org/abs/quant-ph/0403090

values:
nofollow
external text
//doi.org/10.1103%2FPhysRevLett.83.4204

values:
nofollow
external text
//arxiv.org/abs/quant-ph/0006097

values:
nofollow
external text
//arxiv.org/abs/cond-mat/0011415

values:
nofollow
external text
//doi.org/10.1038%2F35071024

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/11298441

values:
nofollow
external text
//doi.org/10.1038%2F35051009

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/11343107

values:
nofollow
external text
//doi.org/10.1134%2F1.2034610

values:
nofollow
external text
//doi.org/10.1126%2Fscience.1157233

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/18535240

values:
nofollow
external text
//arxiv.org/abs/quant-ph/0404083

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/15524694

values:
nofollow
external text
//arxiv.org/abs/1611.07690

values:
nofollow
external text
//doi.org/10.1038%2Fncomms12232

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/27426851

values:
nofollow
external text
//doi.org/10.1103%2FPhysRevLett.70.1895

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/10053414

values:
nofollow
external text
//arxiv.org/abs/quant-ph/0112176

values:
nofollow
external text
//doi.org/10.1038%2F414883a

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/11780055

values:
nofollow
external text
//arxiv.org/abs/0903.2030

values:
nofollow
external text
//doi.org/10.1038%2Fnature08121

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/19561592

values:
nofollow
external text
http://www.ijcee.org/papers/115.pdf

values:
nofollow
external text
//doi.org/10.1038%2Fnature10012

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/21562559

values:
nofollow
external text
//arxiv.org/abs/1401.7087

values:
nofollow
external text
//arxiv.org/abs/1304.4595

values:
nofollow
external text
//doi.org/10.1038%2Fnphys2900

values:
nofollow
external text
//arxiv.org/abs/1409.3827

values:
nofollow
external text
//arxiv.org/abs/1401.3500

values:
nofollow
external text
//doi.org/10.1103%2FPhysRevX.4.021041

values:
nofollow
external text
//arxiv.org/abs/1111.4147

values:
nofollow
external text
//doi.org/10.1038%2Fnphoton.2012.259

values:
nofollow
external text
//arxiv.org/abs/1109.3743

values:
nofollow
external text
//doi.org/10.1126%2Fscience.1208517

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/21885732

values:
nofollow
external text
//arxiv.org/abs/1111.3726

values:
/wiki/New_York_Times
mw-redirect
New York Times

values:
nofollow
external text
//arxiv.org/abs/1211.2892

values:
nofollow
external text
//doi.org/10.1073%2Fpnas.1207329109

values:
nofollow
external text
//www.ncbi.nlm.nih.gov/pubmed/23144222

values:
nofollow
external text
http://1qbit.com/press.html

values:
nofollow
external text
http://1qbit.com/research.html

values:
nofollow
external text
http://arxiv.org/pdf/1401.2910v1.pdf

values:
nofollow
external text
https://arxiv.org/abs/1508.05087

values:
nofollow
external text
//arxiv.org/abs/quant-ph/9803064

values:
nofollow
external text
//arxiv.org/abs/quant-ph/9806001

values:
nofollow
external text
//doi.org/10.1098%2Frspa.1999.0397

values:
nofollow
external text
http://arxiv.org/abs/quant-ph/0502072

values: -moz-column-width: 30em; -webkit-column-width: 30em; column-width: 30em; list-style-type: decimal;

values:
nofollow
external text
//www.worldcat.org/oclc/174527496

values:
nofollow
external text
//doi.org/10.1093%2Fptep%2Fptv122

values:
nofollow
external text
//arxiv.org/abs/quant-ph/0310130

values:
nofollow
external text
//hdl.handle.net/2027.42%2F45526

values:
nofollow
external text
//www.worldcat.org/oclc/255569451

values:
nofollow
external text
//www.worldcat.org/oclc/253709076

values:
nofollow
external text
//www.worldcat.org/oclc/179950736

values:
/wiki/Gordon_E._Moore
mw-redirect
Gordon E. Moore

values:
nofollow
external text
http://citeseer.ist.psu.edu/595490.html

values:
nofollow
external text
http://arxiv.org/pdf/1310.1339.pdf

values:
nofollow
external text
http://arxiv.org/pdf/0801.2193.pdf

values:
nofollow
external text
http://nanohub.org/resources/4778

values:
/wiki/Quantum_computer
mw-redirect
Quantum computer

values:
navbox-image
7
width:1px;padding:0px 0px 0px 2px

values:
/wiki/Universal_quantum_simulator
mw-redirect
Universal quantum simulator

values: Quantum algorithm for linear systems of equations

values: nowraplinks collapsible autocollapse navbox-inner

values:
row
navbox-group
text-align: center;;width:1%

values:
row
navbox-group
width:1%;text-align: center;

values: Strategies for Engineered Negligible Senescence

values: Thick-film dielectric electroluminescent technology

values:
/wiki/Photovoltaic_pavement
mw-redirect
Photovoltaic pavement

values: Information and communications technology

values: General-purpose computing on graphics processing units

values:
/wiki/Quantum_electronics
mw-redirect
Quantum electronics

values: Variable Specific Impulse Magnetoplasma Rocket

values: nowraplinks hlist collapsible collapsed navbox-inner

values:
/wiki/Network_protocol
mw-redirect
Network protocol

values:
/wiki/Compiler_construction
mw-redirect
Compiler construction

values:
/wiki/Database_management_system
mw-redirect
Database management system

values: Computer security compromised by hardware failure

values:
/wiki/Visualization_(computer_graphics)
mw-redirect
Visualization (computer graphics)

values: nowraplinks hlist collapsible autocollapse navbox-inner

values: Cosmological interpretation of quantum mechanics

values:
nofollow
external text
https://d-nb.info/gnd/4533372-5

values: Category:Computer-related introductions in 1980

values: Category:CS1 Russian-language sources (ru)

values: Category:Pages containing links to subscription-only content

values: Category:Webarchive template wayback links

values: Category:Articles needing additional references from June 2015

values: Category:All articles needing additional references

values: Category:Interlanguage link template link number

values: Category:Articles containing potentially dated statements from 2017

values: Category:All articles containing potentially dated statements

values: Category:All articles with dead external links

values: Category:Articles with dead external links from November 2017

values: Category:Articles with permanently dead external links

values: Category:Wikipedia articles with LCCN identifiers

values: Category:Wikipedia articles with GND identifiers

values: Category:Wikipedia articles with BNF identifiers

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values: You are encouraged to create an account and log in; however, it is not mandatory

values: You're encouraged to log in; however, it's not mandatory. [ctrl-alt-o]

values:
/wiki/Quantum_computing
View the content page [ctrl-alt-c]
c

values: Discussion about the content page [ctrl-alt-t]

values: p-namespaces navigation vectorTabs p-namespaces-label

values:
p-variants
navigation
vectorMenu emptyPortlet
p-variants-label

values: Past revisions of this page [ctrl-alt-h]

values: p-views navigation vectorTabs p-views-label

values:
p-cactions
navigation
vectorMenu emptyPortlet
p-cactions-label

values:
mw-wiki-logo
/wiki/Main_Page
Visit the main page

values:
/wiki/Main_Page
Visit the main page [ctrl-alt-z]
z

values: Featured content – the best of Wikipedia

values: Find background information on current events

values: portal navigation p-wikibase-otherprojects p-wikibase-otherprojects-label

values: حاسوب كمومي – Arabic

values: কোয়ান্টাম গণনা – Bangla

values: Квантов компютър – Bulgarian

values: Κβαντικός υπολογιστής – Greek

values: رایانش کوانتومی – Persian

values: 양자 컴퓨터 – Korean

values: क्वाण्टम कम्प्यूटर – Hindi

values: מחשב קוונטי – Hebrew

values: ಕ್ವಾಂಟಮ್ ಗಣಕಯಂತ್ರ – Kannada

values: კვანტური კომპიუტერი – Georgian

values: 量子コンピュータ – Japanese

values: ਕੁਆਂਟਮ ਕੰਪਿਊਟਿੰਗ – Punjabi

values: Квантовый компьютер – Russian

values: Квантни рачунар – Serbian

values: குவாண்டக் கணினியியல் – Tamil

values: Квантовий комп'ютер – Ukrainian

values: /static/images/wikimedia-button-1.5x.png 1.5x, /static/images/wikimedia-button-2x.png 2x

values: /static/images/poweredby_mediawiki_132x47.png 1.5x, /static/images/poweredby_mediawiki_176x62.png 2x

values:
suggestions
display: none; font-size: 13px;

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Quantum_computing rootpage-Quantum_computing skin-vector action-view