In Transfinancial Economics, references are made to supercomputers. However, quantum computers, could possibly do an infinitely better job of monitoring, and controlling the economy in RealTime. http://www.p2pfoundation.net/Transfinancial_Economics
........Quantum computing is the area of study focused on developing computer technology based on the principles of quantum theory, which explains the nature and behavior of energy and matter on the quantum (atomic and subatomic) level. Development of a quantum computer, if practical, would mark a leap forward in computing capability far greater than that from the abacus to a modern day supercomputer, with performance gains in the billionfold realm and beyond. The quantum computer, following the laws of quantum physics, would gain enormous processing power through the ability to be in multiple states, and to perform tasks using all possible permutations simultaneously. Current centers of research in quantum computing include MIT, IBM, Oxford University, and the Los Alamos National Laboratory. Ref WhatIs.com
The following article below maybe of interest to the technically minded..
From Wikipedia, the free encyclopedia
Quantum computing studies theoretical computation systems (quantum computers) that make direct use of quantummechanical phenomena, such as superposition and entanglement, to perform operations on data.^{[1]} Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses qubits (quantum bits), which can be in superpositions of states. A theoretical model is the quantum Turing machine, also known as the universal quantum computer. Quantum computers share theoretical similarities with nondeterministic and probabilistic computers; one example is the ability to be in more than one state simultaneously. The field of quantum computing was first introduced by Yuri Manin in 1980^{[2]} and Richard Feynman in 1982.^{[3]}^{[4]} A quantum computer with spins as quantum bits was also formulated for use as a quantum space–time in 1968.^{[5]}
As of 2014^{[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 qubits.^{[6]} Both practical and theoretical research continues, and many national governments and military funding agencies support quantum computing research to develop quantum computers for both civilian and national security purposes, such as cryptanalysis.^{[7]}
Largescale quantum computers will be able to solve certain problems much more quickly than any classical computer using the best currently known algorithms, like integer factorization using Shor's algorithm or the simulation of quantum manybody systems. There exist quantum algorithms, such as Simon's algorithm, that run faster than any possible probabilistic classical algorithm.^{[8]} Given sufficient computational resources, however, a classical computer could be made to simulate any quantum algorithm, as quantum computation does not violate the Church–Turing thesis. ^{[9]}
An example of an implementation of qubits for a quantum computer could start with the use of particles with two spin states: "down" and "up" (typically written and , or and ). But in fact any system possessing an observable quantity A, which is conserved under time evolution such that A has at least two discrete and sufficiently spaced consecutive eigenvalues, is a suitable candidate for implementing a qubit. This is true because any such system can be mapped onto an effective spin1/2 system.
For example: Consider first a classical computer that operates on a threebit register. The state of the computer at any time is a probability distribution over the different threebit strings 000, 001, 010, 011, 100, 101, 110, 111. If it is a deterministic computer, 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. We can describe this probabilistic state by eight nonnegative numbers A,B,C,D,E,F,G,H (where A = probability computer is in state 000, B = probability computer is in state 001, etc.). There is a restriction that these probabilities sum to 1.
The state of a threequbit quantum computer is similarly described by an eightdimensional vector (a,b,c,d,e,f,g,h), called a ket. Here, however, the coefficients can have complex values, and it is the sum of the squares of the coefficients' magnitudes, , that must equal 1. These square magnitudes represent the probability amplitudes of given states. 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.^{[11]}
If you measure the three qubits, you will observe a threebit string. The probability of measuring a given string is the squared magnitude of that string's coefficient (i.e., the probability of measuring 000 = , the probability of measuring 001 = , etc..). Thus, measuring a quantum state described by complex coefficients (a,b,...,h) gives the classical probability distribution and we say that the quantum state "collapses" to a classical state as a result of making the measurement.
Note that an eightdimensional 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 unitlength, orthogonal vectors and the eigenvectors of the Paulix operator. Ket notation is often used to make the choice of basis explicit. For example, the state (a,b,c,d,e,f,g,h) in the computational basis can be written as:
Using the eigenvectors of the Paulix operator, a single qubit is and .
While a classical threebit state and a quantum threequbit state are both eightdimensional 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 allzeros string, , 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 threebit register to obtain one definite threebit string, say 000. Quantum mechanically, we measure the threequbit 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. Note that 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, the probability of getting the correct answer can be increased.
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.
However, other cryptographic algorithms do not appear to be broken by these algorithms.^{[13]}^{[14]} Some publickey 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.^{[13]}^{[15]} Latticebased 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 wellstudied open problem.^{[16]} It has been proven that applying Grover's algorithm to break a symmetric (secret key) algorithm by brute force requires time equal to roughly 2^{n/2} invocations of the underlying cryptographic algorithm, compared with roughly 2^{n} in the classical case,^{[17]} meaning that symmetric key lengths are effectively halved: AES256 would have the same security against an attack using Grover's algorithm that AES128 has against classical bruteforce 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,^{[18]} 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. For some problems, quantum computers offer a polynomial speedup. The most wellknown 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 twotoone functions and evaluating NAND trees.
Consider a problem that has these four properties:
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.^{[19]}
Grover's algorithm can also be used to obtain a quadratic speedup over a bruteforce search for a class of problems known as NPcomplete.
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.^{[20]} Quantum simulation could also be used to study the behavior of atoms and particles at unusual conditions such as the reactions inside a collider, but in a virtual environment rather than actually making these conditions.^{[21]}
There are a number of technical challenges in building a largescale 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:^{[22]}
These issues are more difficult for optical approaches as the timescales are orders of magnitude shorter and an oftencited 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 decoherence 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 L^{2}, where L is the number of bits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of L. For a 1000bit number, this implies a need for about 10^{4} qubits without error correction.^{[23]} With error correction, the figure would rise to about 10^{7} qubits. Note that computation time is about L^{2} or about 10^{7} steps and on 1 MHz, about 10 seconds.
A very different approach to the stabilitydecoherence problem is to create a topological quantum computer with anyons, quasiparticles used as threads and relying on braid theory to form stable logic gates.^{[24]}^{[25]}
For physically implementing a quantum computer, many different candidates are being pursued, among them (distinguished by the physical system used to realize the qubits):
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.^{[41]}
In 2009, researchers at Yale University created the first solidstate quantum processor. The twoqubit superconducting chip had artificial atom qubits made of a billion aluminum atoms that acted like a single atom that could occupy two states.^{[42]}^{[43]}
A team at the University of Bristol, also created a silicon chip based on quantum optics, able to run Shor's algorithm.^{[44]} Further developments were made in 2010.^{[45]} Springer publishes a journal ("Quantum Information Processing") devoted to the subject.^{[46]}
In 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.^{[47]}^{[48]}
In 2011, DWave Systems announced the first commercial quantum annealer, the DWave One, claiming a 128 qubit processor.^{[49]} On May 25, 2011 Lockheed Martin agreed to purchase a DWave One system.^{[50]} Lockheed and the University of Southern California (USC) will house the DWave One at the newly formed USC Lockheed Martin Quantum Computing Center.^{[51]} DWave's engineers designed the chips with an empirical approach, focusing on solving particular problems. Investors liked this more than academics, saying DWave had not demonstrated they really had a quantum computer. Criticism softened after a DWave paper in Nature, that proved the chips have some quantum properties.^{[52]}^{[53]} Experts remain skeptical of DWaves claims. Two published papers have concluded that the DWave machine operates classically, not via quantum computing.^{[54]}^{[55]}
During the same year, researchers at the University of Bristol created an allbulk optics system that ran a version of Shor's algorithm to successfully factored 21.^{[56]}
In September 2011 researchers proved quantum computers can be made with a Von Neumann architecture (separation of RAM).^{[57]}
In November 2011 researchers factorized 143 using 4 qubits.^{[58]}
In February 2012 IBM scientists said that they had made several breakthroughs in quantum computing with superconducting integrated circuits.^{[59]}
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 twoqubit quantum computer on a doped diamond crystal, that can easily be scaled up, 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.^{[60]}
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.^{[61]} ^{[62]}
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.^{[63]}^{[64]}
In November 2012, the first quantum teleportation from one macroscopic object to another was reported.^{[65]}^{[66]}
In December 2012, the first dedicated quantum computing software company, 1QBit was founded in Vancouver, BC.^{[67]} 1QBit is the first company to focus exclusively on commercializing software applications for commercially available quantum computers, including the DWave Two. 1QBit's research demonstrated the ability of superconducting quantum annealing processors to solve realworld problems.^{[68]}
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 512qubit DWave 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.^{[69]}
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.^{[70]}
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 DWave Two device, but did not explicitly rule it out.^{[71]}^{[72]}
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'll hold information and possibly made quantum computers easier to build.^{[73]}
BQP is contained in the complexity class #P (or more precisely in the associated class of decision problems P^{#P}),^{[76]} which is a subclass of PSPACE.
BQP is suspected to be disjoint from NPcomplete 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 NPcomplete. There is a common misconception that quantum computers can solve NPcomplete problems in polynomial time. That is not known to be true, and is generally suspected to be false.^{[76]}
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.^{[77]} A similar fact takes place for particular computational tasks, like the search problem, for which Grover's algorithm is optimal.^{[78]}
Although quantum computers may be faster than classical computers, those described above can't solve any problems that classical computers can't solve, given enough time and memory (however, those amounts might be practically infeasible). 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.^{[79]} It has been speculated that theories of quantum gravity, such as Mtheory 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.^{[80]}
As of 2014^{[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 qubits.^{[6]} Both practical and theoretical research continues, and many national governments and military funding agencies support quantum computing research to develop quantum computers for both civilian and national security purposes, such as cryptanalysis.^{[7]}
Largescale quantum computers will be able to solve certain problems much more quickly than any classical computer using the best currently known algorithms, like integer factorization using Shor's algorithm or the simulation of quantum manybody systems. There exist quantum algorithms, such as Simon's algorithm, that run faster than any possible probabilistic classical algorithm.^{[8]} Given sufficient computational resources, however, a classical computer could be made to simulate any quantum algorithm, as quantum computation does not violate the Church–Turing thesis. ^{[9]}
Contents
[hide]Basis[edit]
A classical computer has a memory made up of bits, where each bit represents 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 these two qubit states; moreover, a pair of qubits can be in any quantum superposition of 4 states, and three qubits in any superposition of 8. In general, a quantum computer with qubits can be in an arbitrary superposition of up to different states simultaneously (this compares to a normal computer that can only be in one of these states at any one time). A quantum computer operates by setting the qubits in a controlled initial state that represents the problem at hand and by manipulating those qubits with a fixed sequence of quantum logic gates. The sequence of gates to be applied is called a quantum algorithm. The calculation ends with a measurement, collapsing the system of qubits into one of the pure states, where each qubit is purely zero or one. The outcome can therefore be at most classical bits of information. Quantum algorithms are often nondeterministic, in that they provide the correct solution only with a certain known probability.An example of an implementation of qubits for a quantum computer could start with the use of particles with two spin states: "down" and "up" (typically written and , or and ). But in fact any system possessing an observable quantity A, which is conserved under time evolution such that A has at least two discrete and sufficiently spaced consecutive eigenvalues, is a suitable candidate for implementing a qubit. This is true because any such system can be mapped onto an effective spin1/2 system.
Bits vs. qubits[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, to represent the state of an nqubit system on a classical computer would require the storage of 2^{n} complex coefficients. 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 measurement. Moreover, it is incorrect to think of the qubits as only being in one particular state before 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.For example: Consider first a classical computer that operates on a threebit register. The state of the computer at any time is a probability distribution over the different threebit strings 000, 001, 010, 011, 100, 101, 110, 111. If it is a deterministic computer, 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. We can describe this probabilistic state by eight nonnegative numbers A,B,C,D,E,F,G,H (where A = probability computer is in state 000, B = probability computer is in state 001, etc.). There is a restriction that these probabilities sum to 1.
The state of a threequbit quantum computer is similarly described by an eightdimensional vector (a,b,c,d,e,f,g,h), called a ket. Here, however, the coefficients can have complex values, and it is the sum of the squares of the coefficients' magnitudes, , that must equal 1. These square magnitudes represent the probability amplitudes of given states. 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.^{[11]}
If you measure the three qubits, you will observe a threebit string. The probability of measuring a given string is the squared magnitude of that string's coefficient (i.e., the probability of measuring 000 = , the probability of measuring 001 = , etc..). Thus, measuring a quantum state described by complex coefficients (a,b,...,h) gives the classical probability distribution and we say that the quantum state "collapses" to a classical state as a result of making the measurement.
Note that an eightdimensional 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 unitlength, orthogonal vectors and the eigenvectors of the Paulix operator. Ket notation is often used to make the choice of basis explicit. For example, the state (a,b,c,d,e,f,g,h) in the computational basis can be written as:
 where, e.g.,
Using the eigenvectors of the Paulix operator, a single qubit is and .
Operation[edit]
Is a universal quantum computer sufficient to efficiently simulate an arbitrary physical system? 
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 threebit register to obtain one definite threebit string, say 000. Quantum mechanically, we measure the threequbit 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. Note that 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, the probability of getting the correct answer can be increased.
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 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 300digit primes).^{[12]} 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, which can both 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 these algorithms.^{[13]}^{[14]} Some publickey 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.^{[13]}^{[15]} Latticebased 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 wellstudied open problem.^{[16]} It has been proven that applying Grover's algorithm to break a symmetric (secret key) algorithm by brute force requires time equal to roughly 2^{n/2} invocations of the underlying cryptographic algorithm, compared with roughly 2^{n} in the classical case,^{[17]} meaning that symmetric key lengths are effectively halved: AES256 would have the same security against an attack using Grover's algorithm that AES128 has against classical bruteforce 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,^{[18]} 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. For some problems, quantum computers offer a polynomial speedup. The most wellknown 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 twotoone 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.
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.^{[19]}
Grover's algorithm can also be used to obtain a quadratic speedup over a bruteforce search for a class of problems known as NPcomplete.
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.^{[20]} Quantum simulation could also be used to study the behavior of atoms and particles at unusual conditions such as the reactions inside a collider, but in a virtual environment rather than actually making these conditions.^{[21]}
There are a number of technical challenges in building a largescale 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:^{[22]}
 scalable physically to increase the number of qubits;
 qubits can be initialized to arbitrary values;
 quantum gates faster than decoherence time;
 universal gate set;
 qubits can be read easily.
Quantum decoherence[edit]
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 nuclear spin of the physical system used to implement the qubits. Decoherence is irreversible, as it is nonunitary, and is usually something that should be highly controlled, if not avoided. Decoherence times for candidate systems, in particular the transverse relaxation time T_{2} (for NMR and MRI technology, also called the dephasing time), typically range between nanoseconds and seconds at low temperature.^{[11]}These issues are more difficult for optical approaches as the timescales are orders of magnitude shorter and an oftencited 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 decoherence 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 L^{2}, where L is the number of bits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of L. For a 1000bit number, this implies a need for about 10^{4} qubits without error correction.^{[23]} With error correction, the figure would rise to about 10^{7} qubits. Note that computation time is about L^{2} or about 10^{7} steps and on 1 MHz, about 10 seconds.
A very different approach to the stabilitydecoherence problem is to create a topological quantum computer with anyons, quasiparticles used as threads and relying on braid theory to form stable logic gates.^{[24]}^{[25]}
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 fewqubit quantum gates)
 Oneway quantum computer (computation decomposed into sequence of onequbit 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 contains the solution)^{[26]}
 Topological quantum computer^{[27]} (computation decomposed into the braiding of anyons in a 2D lattice)
For physically implementing a quantum computer, many different candidates are being pursued, among them (distinguished by the physical system used to realize the qubits):
 Superconductorbased quantum computers (including SQUIDbased quantum computers)^{[28]}^{[29]} (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, spinbased (e.g. the LossDiVincenzo quantum computer ^{[30]}) (qubit given by the spin states of trapped electrons)
 Quantum dot computer, spatialbased (qubit given by electron position in double quantum dot)^{[31]}
 Nuclear magnetic resonance on molecules in solution (liquidstate NMR) (qubit provided by nuclear spins within the dissolved molecule)
 Solidstate NMR Kane quantum computers (qubit realized by the nuclear spin state of phosphorus donors in silicon)
 Electronsonhelium quantum computers (qubit is the electron spin)
 Cavity quantum electrodynamics (CQED) (qubit provided by the internal state of trapped atoms coupled to highfinesse cavities)
 Molecular magnet^{[32]} (qubit given by spin states)
 Fullerenebased 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)^{[33]}
 Diamondbased quantum computer^{[34]}^{[35]}^{[36]} (qubit realized by electronic or nuclear spin of nitrogenvacancy centers in diamond)
 Bose–Einstein condensatebased quantum computer^{[37]}
 Transistorbased quantum computer – string quantum computers with entrainment of positive holes using an electrostatic trap
 Rareearthmetaliondoped inorganic crystal based quantum computers^{[38]}^{[39]} (qubit realized by the internal electronic state of dopants in optical fibers)
Timeline[edit]
In 2001, researchers demonstrated Shor's algorithm to factor 15 using a 7qubit NMR computer.^{[40]}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.^{[41]}
In 2009, researchers at Yale University created the first solidstate quantum processor. The twoqubit superconducting chip had artificial atom qubits made of a billion aluminum atoms that acted like a single atom that could occupy two states.^{[42]}^{[43]}
A team at the University of Bristol, also created a silicon chip based on quantum optics, able to run Shor's algorithm.^{[44]} Further developments were made in 2010.^{[45]} Springer publishes a journal ("Quantum Information Processing") devoted to the subject.^{[46]}
In 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.^{[47]}^{[48]}
In 2011, DWave Systems announced the first commercial quantum annealer, the DWave One, claiming a 128 qubit processor.^{[49]} On May 25, 2011 Lockheed Martin agreed to purchase a DWave One system.^{[50]} Lockheed and the University of Southern California (USC) will house the DWave One at the newly formed USC Lockheed Martin Quantum Computing Center.^{[51]} DWave's engineers designed the chips with an empirical approach, focusing on solving particular problems. Investors liked this more than academics, saying DWave had not demonstrated they really had a quantum computer. Criticism softened after a DWave paper in Nature, that proved the chips have some quantum properties.^{[52]}^{[53]} Experts remain skeptical of DWaves claims. Two published papers have concluded that the DWave machine operates classically, not via quantum computing.^{[54]}^{[55]}
During the same year, researchers at the University of Bristol created an allbulk optics system that ran a version of Shor's algorithm to successfully factored 21.^{[56]}
In September 2011 researchers proved quantum computers can be made with a Von Neumann architecture (separation of RAM).^{[57]}
In November 2011 researchers factorized 143 using 4 qubits.^{[58]}
In February 2012 IBM scientists said that they had made several breakthroughs in quantum computing with superconducting integrated circuits.^{[59]}
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 twoqubit quantum computer on a doped diamond crystal, that can easily be scaled up, 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.^{[60]}
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.^{[61]} ^{[62]}
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.^{[63]}^{[64]}
In November 2012, the first quantum teleportation from one macroscopic object to another was reported.^{[65]}^{[66]}
In December 2012, the first dedicated quantum computing software company, 1QBit was founded in Vancouver, BC.^{[67]} 1QBit is the first company to focus exclusively on commercializing software applications for commercially available quantum computers, including the DWave Two. 1QBit's research demonstrated the ability of superconducting quantum annealing processors to solve realworld problems.^{[68]}
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 512qubit DWave 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.^{[69]}
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.^{[70]}
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 DWave Two device, but did not explicitly rule it out.^{[71]}^{[72]}
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'll hold information and possibly made quantum computers easier to build.^{[73]}
Relation to computational complexity theory[edit]
Main article: Quantum complexity theory
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 polynomialtime algorithm, whose probability of error is bounded away from one half.^{[75]} 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}),^{[76]} which is a subclass of PSPACE.
BQP is suspected to be disjoint from NPcomplete 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 NPcomplete. There is a common misconception that quantum computers can solve NPcomplete problems in polynomial time. That is not known to be true, and is generally suspected to be false.^{[76]}
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.^{[77]} A similar fact takes place for particular computational tasks, like the search problem, for which Grover's algorithm is optimal.^{[78]}
Although quantum computers may be faster than classical computers, those described above can't solve any problems that classical computers can't solve, given enough time and memory (however, those amounts might be practically infeasible). 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.^{[79]} It has been speculated that theories of quantum gravity, such as Mtheory 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.^{[80]}
See also[edit]
 Chemical computer
 DNA computer
 Electronic quantum holography
 List of emerging technologies
 Natural computing
 Normal mode
 Photonic computing
 Postquantum cryptography
 Quantum annealing
 Quantum bus
 Quantum cognition
 Quantum gate
 Quantum processing unit or QPU
 Quantum threshold theorem
 Soliton
 Timeline of quantum computing
 Topological quantum computer
 Valleytronics
References[edit]
 Jump up ^ "Quantum Computing with Molecules" article in Scientific American by Neil Gershenfeld and Isaac L. Chuang
 Jump up ^ Manin, Yu. I. (1980). Vychislimoe i nevychislimoe [Computable and Noncomputable] (in Russian). Sov.Radio. pp. 13–15. Retrieved 4 March 2013.
 Jump up ^ Feynman, R. P. (1982). "Simulating physics with computers". International Journal of Theoretical Physics 21 (6): 467–488. doi:10.1007/BF02650179.
 Jump up ^ Deutsch, David (19920106). "Quantum computation". Physics World.
 Jump up ^ Finkelstein, David (1968). "SpaceTime Structure in High Energy Interactions". In Gudehus, T.; Kaiser, G. Fundamental Interactions at High Energy. New York: Gordon & Breach.
 Jump up ^ "New qubit control bodes well for future of quantum computing". Retrieved 26 October 2014.
 Jump up ^ Quantum Information Science and Technology Roadmap for a sense of where the research is heading.
 Jump up ^ Simon, D.R. (1994). "On the power of quantum computation". Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on: 116–123. doi:10.1109/SFCS.1994.365701. ISBN 0818665807.
 Jump up ^ Nielsen, Michael A.; Chuang, Isaac L. Quantum Computation and Quantum Information. p. 202.
 Jump up ^ Waldner, JeanBaptiste (2007). Nanocomputers and Swarm Intelligence. London: ISTE. p. 157. ISBN 2746215160.
 ^ Jump up to: ^{a} ^{b} David P. DiVincenzo (1995). "Quantum Computation". Science 270 (5234): 255–261. Bibcode:1995Sci...270..255D. doi:10.1126/science.270.5234.255. (subscription required)
 Jump up ^ Arjen K. Lenstra (2000). "Integer Factoring". Designs, Codes and Cryptography 19 (2/3): 101–128. doi:10.1023/A:1008397921377.
 ^ Jump up to: ^{a} ^{b} Daniel J. Bernstein, Introduction to PostQuantum Cryptography. Introduction to Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (editors). Postquantum cryptography. Springer, Berlin, 2009. ISBN 9783540887010
 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 publickey 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 ^ NSA seeks to build quantum computer that could crack most types of encryption By Steven Rich & Barton Gellman 1 February 2014, Washington Post
 Jump up ^ The Father of Quantum Computing by Quinn Norton 02.15.2007, Wired.com
 Jump up ^ What Can We Do with a Quantum Computer?
 Jump up ^ David P. DiVincenzo (20000413). "The Physical Implementation of Quantum Computation". arXiv:quantph/0002077 [quantph].
 Jump up ^ M. I. Dyakonov (20061014). "Is FaultTolerant 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:quantph/0610117.
 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:quantph/0101025. doi:10.1090/S0273097902009643. MR 1943131.
 Jump up ^ Monroe, Don, "Anyons: The breakthrough quantum computing needs?", New Scientist, 1 October 2008
 Jump up ^ Das, A.; Chakrabarti, B. K. (2008). "Quantum Annealing and Analog Quantum Computation". Rev. Mod. Phys. 80 (3): 1061–1081. 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. 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 ^ William M Kaminsky (2004). "Scalable Superconducting Architecture for Adiabatic Quantum Computation". arXiv:quantph/0403090 [quantph].
 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 cavityQED". Physical Review Letters 83 (20): 4204. 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:quantph/0006097. Bibcode:2000quant.ph..6097F.
 Jump up ^ "Quantum computing in molecular magnets.". Nature. Apr 12, 2001. 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. (October 19, 2004). "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 ^ Wolfgang Gruener (20070601). "Research indicates diamonds could be key to quantum storage". Retrieved 20070604.
 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 ^ Rene Millman (20070803). "Trapped atoms could advance quantum computing". Retrieved 20070726.
 Jump up ^ Ohlsson, N.; Mohan, R. K.; Kröll, S. (January 1, 2002). "Quantum computer hardware based on rareearthiondoped inorganic crystals". Opt. Commun. 201 (1–3): 71–77. Bibcode:2002OptCo.201...71O. doi:10.1016/S00304018(01)016662.
 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:quantph/0404083. Bibcode:2004PhRvL..93m0503L. doi:10.1103/PhysRevLett.93.130503. PMID 15524694.
 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. doi:10.1038/414883a. PMID 11780055.
 Jump up ^ "UM develops scalable and massproducible quantum computer chip". 20051212. Retrieved 20061117.
 Jump up ^ L. DiCarlo; J. M. Chow; J. M. Gambetta; Lev S. Bishop; B. R. Johnson; D. I. Schuster; J. Majer; A. Blais; L. Frunzio; S. M. Girvin; R. J. Schoelkopf (9 July 2009). "Demonstration of twoqubit algorithms with a superconducting quantum processor". Nature 460 (7252): 240–4. Bibcode:2009Natur.460..240D. doi:10.1038/nature08121. PMID 19561592. Retrieved 20090702.
 Jump up ^ "Scientists Create First Electronic Quantum Processor". 20090702. Retrieved 20090702.
 Jump up ^ "Codebreaking quantum algorithm runs on a silicon chip". New Scientist. 20090904. Retrieved 20091014.
 Jump up ^ "New Trends in Quantum Computation".
 Jump up ^ Quantum Information Processing. Springer.com. Retrieved on 20110519.
 Jump up ^ "University of New South Wales".
 Jump up ^ "Engadget, First light wave quantum teleportation achieved, opens door to ultra fast data transmission".
 Jump up ^ "Learning to program the DWave One". Retrieved 11 May 2011.
 Jump up ^ "DWave Systems sells its first Quantum Computing System to Lockheed Martin Corporation". 20110525. Retrieved 20110530.
 Jump up ^ "Operational Quantum Computing Center Established at USC". 20111029. Retrieved 20111206.
 Jump up ^ Quantum annealing with manufactured spins Nature 473, 194–198, 12 May 2011
 Jump up ^ The CIA and Jeff Bezos Bet on Quantum Computing Technology Review October 4, 2012 by Tom Simonite
 Jump up ^ "How "Quantum" is the DWave Machine?". Arxiv. 02052014. Check date values in:
date=
(help)  Jump up ^ "Quantum Annealing With More Than 100 Qbits". Arxiv. 16042013. Check date values in:
date=
(help)  Jump up ^ Enrique Martin Lopez; Anthony Laing; Thomas Lawson; Roberto Alvarez; XiaoQi Zhou; Jeremy L. O'Brien (2011). "Implementation of an iterative quantum order finding algorithm". Nature Photonics 6 (11): 773–776. arXiv:1111.4147. doi:10.1038/nphoton.2012.259.
 Jump up ^ "Quantum computer with Von Neumann architecture". Retrieved 26 October 2014.
 Jump up ^ "Quantum Factorization of 143 on a DipolarCoupling NMR system". Retrieved 26 October 2014.
 Jump up ^ "IBM Says It's 'On the Cusp' of Building a Quantum Computer". PCMAG. Retrieved 26 October 2014.
 Jump up ^ "Quantum computer built inside diamond". Futurity. Retrieved 26 October 2014.
 Jump up ^ "Australian engineers write quantum computer 'qubit' in global breakthrough". The Australian. Retrieved 3 October 2012.
 Jump up ^ "Breakthrough in bid to create first quantum computer". University of New South Wales. Retrieved 3 October 2012.
 Jump up ^ Frank, Adam (October 14, 2012). "Cracking the Quantum Safe". New York Times. Retrieved October 14, 2012.
 Jump up ^ Overbye, Dennis (October 9, 2012). "A Nobel for Teasing Out the Secret Life of Atoms". New York Times. Retrieved October 14, 2012.
 Jump up ^ "First Teleportation from One Macroscopic Object to Another: The Physics arXiv Blog". MIT Technology Review. November 15, 2012. Retrieved November 17, 2012.
 Jump up ^ Bao, XiaoHui; Xu, XiaoFan; Li, CheMing; Yuan, ZhenSheng; Lu, ChaoYang; Pan, Jianwei (November 13, 2012). "Quantum teleportation between remote atomicensemble quantum memories". arXiv. arXiv:1211.2892.
 Jump up ^ "1QBit Founded". 1QBit.com. Retrieved 22 June 2014.
 Jump up ^ "1QBit Research". 1QBit.com. Retrieved 22 June 2014.
 Jump up ^ "Launching the Quantum Artificial Intelligence Lab". Research@Google Blog. Retrieved 16 May 2013.
 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, 20140113.
 Jump up ^ Quantum Chaos: After a Failed Speed Test, the DWave Debate Continues, Scientific American, 20140619.
 Jump up ^ Researchers use silicon to push quantum computing toward reality, Computer World, 23 October 2014, Sharon Gaudin
 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. 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:quantph/9803064. Bibcode:1998quant.ph..3064O. doi:10.1016/S09600779(98)002264.
 Jump up ^ Ozhigov, Yuri (1999). "Lower Bounds of Quantum Search for Extreme Point". Proceedings of the London Royal Society A455 (1986): 2165–2172. arXiv:quantph/9806001. Bibcode:1999RSPSA.455.2165O. doi:10.1098/rspa.1999.0397.
 Jump up ^ Nielsen, p. 126
 Jump up ^ Scott Aaronson, NPcomplete 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 PolynomialTime? […] 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)
Bibliography[edit]
 Nielsen, Michael; Chuang, Isaac (2000). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. ISBN 0521635039. OCLC 174527496.
General references[edit]
 Derek Abbot; Charles R. Doering; Carlton M. Caves; Daniel M. Lidar; Howard E. Brandt; Alexander R. Hamilton; David K. Ferry; Julio GeaBanacloche; Sergey M. Bezrukov; Laszlo B. Kish (2003). "Dreams versus Reality: Plenary Debate Session on Quantum Computing". Quantum Information Processing 2 (6): 449–472. arXiv:quantph/0310130. doi:10.1023/B:QINP.0000042203.24782.9a. hdl:2027.42/45526.
 David P. DiVincenzo (2000). "The Physical Implementation of Quantum Computation". Experimental Proposals for Quantum Computation. arXiv:quantph/0002077
 David P. DiVincenzo (1995). "Quantum Computation". Science 270 (5234): 255–261. Bibcode:1995Sci...270..255D. doi:10.1126/science.270.5234.255. Table 1 lists switching and dephasing times for various systems.
 Richard Feynman (1982). "Simulating physics with computers". International Journal of Theoretical Physics 21 (6–7): 467. Bibcode:1982IJTP...21..467F. doi:10.1007/BF02650179.
 Gregg Jaeger (2006). Quantum Information: An Overview. Berlin: Springer. ISBN 0387357254. OCLC 255569451.
 Stephanie Frank Singer (2005). Linearity, Symmetry, and Prediction in the Hydrogen Atom. New York: Springer. ISBN 0387246371. OCLC 253709076.
 Giuliano Benenti (2004). Principles of Quantum Computation and Information Volume 1. New Jersey: World Scientific. ISBN 9812388303. OCLC 179950736.
 Sam Lomonaco Four Lectures on Quantum Computing given at Oxford University in July 2006
 C. Adami, N.J. Cerf. (1998). "Quantum computation with linear optics". arXiv:quantph/9806048v1.
 Joachim Stolze; Dieter Suter (2004). Quantum Computing. WileyVCH. ISBN 3527404384.
 Ian Mitchell (1998). "Computing Power into the 21st Century: Moore's Law and Beyond".
 Rolf Landauer (1961). "Irreversibility and heat generation in the computing process".
 Gordon E. Moore (1965). Cramming more components onto integrated circuits. Electronics Magazine.
 R. W. Keyes (1988). Miniaturization of electronics and its limits. "IBM Journal of Research and Development".
 M. A. Nielsen; E. Knill; R. Laflamme. "Complete Quantum Teleportation By Nuclear Magnetic Resonance".
 Lieven M.K. Vandersypen; Constantino S. Yannoni; Isaac L. Chuang (2000). Liquid state NMR Quantum Computing.
 Imai Hiroshi; Hayashi Masahito (2006). Quantum Computation and Information. Berlin: Springer. ISBN 3540331328.
 Andre Berthiaume (1997). "Quantum Computation".
 Daniel R. Simon (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 RuhrUniversity Bochum.
 Laura Sanders (2009). "First programmable quantum computer created".
 "New trends in quantum computation".
External links[edit]
Wikimedia Commons has media related to Quantum computer. 
 Stanford Encyclopedia of Philosophy: "Quantum Computing" by Amit Hagar.
 Quantiki – Wiki and portal with freecontent related to quantum information science.
 Scott Aaronson's blog, which features informative and critical commentary on developments in the field
 DWave thinks it has built the world's first commercial quantum computer. Mother Nature has other ideas, in the January 2014 issue of Inc. magazine
 Quantum Annealing and Computation: A Brief Documentary Note, A. Ghosh and S. Mukherjee
 Maryland University Laboratory for Physical Sciences: conducts researches for the quantum computerbased project led by the NSA, named 'Penetrating Hard Target'.
 Lectures
 Quantum Mechanics and Quantum Computation – Coursera course by Umesh Vazirani
 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



No comments:
Post a Comment