On the power of quantum computation

  title={On the power of quantum computation},
  author={Daniel R. Simon},
  journal={Proceedings 35th Annual Symposium on Foundations of Computer Science},
  • Daniel R. Simon
  • Published 20 November 1994
  • Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machine, in which the laws of chance are those obeyed by particles on a quantum mechanical scale, rather than the rules familiar to us from the macroscopic world. We present here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an… 

Turing in Quantumland

It turns out that a quantum Turing-machine is not more powerful, in the sense of computability, than the machine originally constructed by Turing, but quantum Turingmachines do not violate the Church-Turing thesis.

Quantum Algorithms

The most striking demonstration of the computational power of quantum computers was given by Shor in 1994, who exhibited efficient quantum algorithms for factoring and the discrete logarithm, which demonstrated that, should a quantum computer be built, most current encryption schemes will be broken immediately.

Quantum complexity theory

This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.

Quantum computing and quantum complexity theory

  • U. Vazirani
  • Computer Science, Physics
    2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353)
  • 2000
This paper will describe two formal models for quantum computers: quantum circuits and quantum Turing Machines, introduced by Deutsch [1985].

Strengths and weaknesses of quantum computingCharles

This paper proves that relative to an oracle chosen uniformly at random, with probability 1, the class NP cannot be solved on a quantum Turing machine in time o(2 n=2).

Fourier Transforms and Quantum Computation

  • U. Vazirani
  • Computer Science
    Theoretical Aspects of Computer Science
  • 2000
This survey paper focusses on presenting the essential ideas in a simple way, rather than getting the best results.

Limits on Efficient Computation in the Physical World

This thesis attacks the common belief that quantum computing resembles classical exponential parallelism, by showing that quantum computers would face serious limitations on a wider range of problems than was previously known, and studies the relationship of the quantum computing model to physical reality.

Quantum computing, phase estimation and applications

Attention is paid to small experimental testbed applications with respect to the quantum phase estimation algorithm, the core approach for finding energy eigenvalues, and a short overview of quantum cryptography, with a particular focus on quantum steganography and authentication.

On Quantum Computation with Some Restricted Amplitudes

It is shown that exact computers with rational biased 'quantum coins' are equivalent to classical computers because of the power of quantum computers with restricted amplitudes.

Another Quantum Turing Machines

This paper considers that the superposition of configurations, a basic concept of the quantum Turing machines, should also be applied to the probabilistic Turing machines to solve the satisfiability and the validity problems in polynomial time.



Quantum complexity theory

This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.

Quantum theory, the Church–Turing principle and the universal quantum computer

  • D. Deutsch
  • Physics, Philosophy
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible

The quantum challenge to structural complexity theory

  • A. BerthiaumeG. Brassard
  • Physics, Computer Science
    [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
  • 1992
There are cryptographic tasks that are demonstrably impossible to implement with unlimited computing power probabilistic interactive turning machines, yet they can be implemented even in practice by quantum mechanical apparatus.

Quantum Circuit Complexity

  • A. Yao
  • Computer Science
  • 1993
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them.

Quantum mechanical hamiltonian models of turing machines

Quantum mechanical Hamiltonian models, which represent an aribtrary but finite number of steps of any Turing machine computation, are constructed here on a finite lattice of spin-1/2 systems.

Two-bit gates are universal for quantum computation.

  • DiVincenzo
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The

Oracle Quantum Computing

Oracles are constructed relative to which there is a decision problem that can be solved with certainty in worst-case polynomial time on the quantum computer, yet it cannot be solved classically in probabilistic expected polynometric time if errors are not tolerated.

Algorithms for quantum computation: discrete logarithms and factoring

  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.

A decision procedure for well-formed linear quantum cellular automata

An efficient algorithm is given which decides if a linear quantum cellular automaton is well-formed, and the complexity of the algorithm is O(n2) if the input automaton has continuous neighborhood.

A fast quantum mechanical algorithm for database search

In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .