Quantum algorithms revisited

  title={Quantum algorithms revisited},
  author={Richard Cleve and A. Ekert and Chiara Macchiavello and Michele Mosca},
  journal={Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences},
  pages={339 - 354}
  • R. Cleve, A. Ekert, M. Mosca
  • Published 8 August 1997
  • Physics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference. We use this approach to review (and improve) some of the existing quantum algorithms and to show how they are related to different instances of quantum phase estimation. We provide an explicit algorithm for… 

Figures from this paper

On quantum algorithms
It is shown how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner.
Quantum interferometers as quantum computers
Quantum computers which use quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations can be viewed as multiparticle
Quantum information and precision measurement
Some applications of quantum information theory to the analysis of quantum limits on measurement sensitivity are described, including superdense coding, fast database search, and the quantum Fourier transform.
Quantum computation and quantum information
A survey of all the important aspects and results that have shaped the field of quantum computation and quantum information and their applications to the general theory of information, cryptography, algorithms, computational complexity and error-correction.
Entanglement in Phase Estimation Algorithm and Quantum Counting Algorithm
Investigation of the entanglement features of the quantum states employed in quantum phase estimation algorithm and quantum counting algorithm shows that whether these two algorithms generateEntanglement depend on whether the input quantum state of the second register is a superposition state ofThe eigenstates.
Quantum search by measurement
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution,
Self-protected quantum algorithms based on quantum state tomography
New quantum algorithms are given which are based on quantum state tomography which include an algorithm for the calculation of several quantum mechanical expectation values and an algorithms for the determination of polynomial factors.
Quantum Algorithms with Applications to Simulating Physical Systems
This dissertation aims to improve the resource requirements of quantum computers for solving simulation problems, by providing both novel quantum algorithms and improved implementations of existing ones by presenting three main results that cover diverse aspects of simulation including equilibrium physics, the preparation of useful quantum states, and simulations based on classical stochastic processes.
Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
This work shall investigate how multipartite entanglement and non-locality among qubits vary as the quantum computation runs, and encounter that quantum measures on the whole system cannot account for their corresponding speedup.
Quantum entanglement and quantum computational algorithms
  • Arvind
  • Physics, Computer Science
  • 2001
It is demonstrated that the one- and the two-bit Deutsch-Jozsa algorithm does not require entanglement and can be mapped onto a classical optical scheme.


Quantum Computation and Shor's Factoring Algorithm
The authors give an exposition of Shor's algorithm together with an introduction to quantum computation and complexity theory, and discuss experiments that may contribute to its practical implementation.
Quantum measurements and the Abelian Stabilizer Problem
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor’s results [7]. Our method is based on
Quantum measurements and the Abelian Stabilizer Problem
  • A. Kitaev
  • Mathematics
    Electron. Colloquium Comput. Complex.
  • 1996
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator.
Rapid solution of problems by quantum computation
  • D. Deutsch, R. Jozsa
  • Computer Science
    Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  • 1992
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
Optimal extraction of information from finite quantum ensembles.
It is proved that optimal measurement procedures must necessarily view the ensemble as a single composite system rather than as the sum of its components, i.e., optimal measurements cannot be realized by separate measurements on each particle.
Semiclassical Fourier transform for quantum computation.
  • Griffiths, Niu
  • Physics, Computer Science
    Physical review letters
  • 1996
It is shown that the Fourier transform preceding the final measurement in Shor's algorithm for factorization on a quantum computer can be carried out in a semiclassical way by using the ``classical''
An approximate Fourier transform useful in quantum factoring", IBM Research Report RC19642 ,; R. Cle
We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
It is shown that any cryptosystem based on what is referred to as a ‘hidden linear form’ can be broken in quantum polynomial time and the notion of ‘junk bits’ is introduced which are helpful when performing classical computations that are not injective.
Elementary gates for quantum computation.
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Advances in Cryptology
The undecidable word problem for groups and semlgroups is investigated as a basis for a public-key cryptosystem, and the type of cryptos System shown is randomized, with infinitely many ciphertexts corresponding t o each plaintext.