Rapid solution of problems by quantum computation

@article{Deutsch1992RapidSO,
  title={Rapid solution of problems by quantum computation},
  author={David Deutsch and Richard Jozsa},
  journal={Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences},
  year={1992},
  volume={439},
  pages={553 - 558}
}
  • D. DeutschR. Jozsa
  • Published 1 October 1992
  • Computer Science
  • Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
A class of problems is described which can be solved more efficiently by quantum computation than by any classical or stochastic method. The quantum computation solves the problem with certainty in exponentially less time than any classical deterministic computation. 

Tables from this paper

Distributed Quantum Computing

A short introduction to quantum computing is given and the results in the area of distributed quantum computing and its applications to physics are surveyed.

Quantum Computing and Communication Complexity

A short introduction to quantum computing is given and the results in the area of quantum communiC4tion compluity are surveyed.

Effectiveness of quantum algorithms on classical computing complexities

This study focuses in this study on several famous quantum algorithms, where they discussed their impact on classical computing using in computer science.

Physical quantum algorithms

Quantum search algorithms in science and engineering

The kinds of search algorithms that can run on quantum computers are qualitatively different from those that run on classical computers. As this article shows, quantum searches are thus vastly more

Computation And Quantum Superposition

  • R. Jozsa
  • Physics
    Workshop on Physics and Computation
  • 1992
For certain problems, these new modes of computation can provide an exponential reduction in complexity over any classical computer demonstrating the importance of quantum processes for issues in complexity theory.

Quantum Computation and NP-Complete Problems

In this paper, we show that the Deutsch's universal quantum Turing machine can solve any NP-complete problem in polynomial time under a physical assumption that we can observe the existence of a

LIMITS OF QUANTUM COMPUTING: ANALYSIS OF A CONCRETE ALGORITHM

Discussing a concrete example, the Simons’ problem, one shows how powerful a quantum computer can be in principle, and the error rate introduced by the influence of the environment is calculated in the case of cavity QED implementation.

The Effective Solving of the Tasks from NP by a Quantum Computer

The new model of quantum computation is proposed, for which an effective algorithm of solving any task in NP is described, and the provided model and algorithm exhibit the exponential speedup over that described by Grover.

Analysis of Quantum Functions (Preliminary Version)

This work investigates quantum gap functions, which compute the gap between acceptance and rejection probabilities of quantum computation, and quantum functions, functions that are defined in terms of quantum mechanical computation.
...

References

SHOWING 1-4 OF 4 REFERENCES

Quantum Concepts in Space and Time

Recent developments in quantum theory have focused attention on fundamental questions, in particular on whether it might be necessary to modify quantum mechanics to reconcile quantum gravity and

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

Characterizing classes of functions computable by quantum parallelism

  • R. Jozsa
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  • 1991
Computation by quantum parallelism involves associating a quantum state v(f) to each function f: Zm → Zn. v(f) is formed from superpositions of states labelled by the values of f, the standard choice

Computers and intractability

  • Proc. R. Soc. Lond. A
  • 1979