Quantum algorithms for algebraic problems

  title={Quantum algorithms for algebraic problems},
  author={Andrew M. Childs and Wim van Dam},
  journal={Reviews of Modern Physics},
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a… 

Figures and Tables from this paper

Quantum Computation and Isomorphism Testing

It is shown that when the process is allowed to be randomized, there are problems that have a constant quantum query complexity but cannot be solved classically no matter how many queries are made, and how to construct such an infinity-vs-one separation from any weaker separation between the classical and quantum query complexities.

Quantum Computing, Quantum Games and Geometric Algebra

Geometric algebra (GA) was found to provide a simple algebraic solution to the exact Grover search problem as well providing a simple visual picture describing the general solution to Meyer’s quantum penny flip game, which is a simple two-player quantum game based on the manipulation of a single qubit and hence closely analogous to theGrover search process.

Quantum Algorithm Implementations for Beginners

This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations and shows how these algorithms can be implemented on IBM’s quantum computer.

A quantum algorithm to solve nonlinear differential equations

A quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials and its expected resource requirements are polylogarithmic in the number of variables and exponential in the integration time.

Mathematics on a Quantum Computer

In this chapter we gave but a taste of these developments. The quantum counting algorithm is especially noteworthy since it combines ideas from both Grover’s algorithm and phase estimation. Moreover,

Hybrid Quantum-Classical Approach to Quantum Optimal Control.

It is shown that the most computationally demanding part of gradient-based algorithms, namely, computing the fitness function and its gradient for a control input, can be accomplished by the process of evolution and measurement on a quantum simulator.

Quantum Chemistry in the Age of Quantum Computing.

This Review provides an overview of the algorithms and results that are relevant for quantum chemistry and aims to help quantum chemists who seek to learn more about quantum computing and quantum computing researchers who would like to explore applications in quantum chemistry.

Quantum algorithms for highly non-linear Boolean functions

New quantum algorithms are presented that solve the hidden shift problems for several well-known classes of bent functions in polynomial time and with a constant number of queries, while the classical query complexity is shown to be exponential.

Quantum algorithm for solving hyperelliptic curve discrete logarithm problem

A quantum algorithm is proposed for solving the HCDLP by applying the framework of quantum algorithm designed by Shor and the key of the algorithm is the realization of divisor addition, which can be efficiently realized on a quantum computer using the basic modular arithmetic operations.



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 Algorithms for Hidden Nonlinear Structures

This work suggests an alternative generalization of the nonAbelian hidden subgroup problem, namely to problems of finding hidden nonlinear structures over finite fields, and gives examples of two such problems that can be solved efficiently by a quantum computer, but not by a classical computer.

How powerful is adiabatic quantum computation?

It is argued that the adiabatic approach may be thought of as a kind of 'quantum local search', and a family of minimization problems that is hard for such local search heuristics are designed, and an exponential lower bound is established for the ad iabatic algorithm for these problems.

Efficient Quantum Transforms

A novel network for computing a Fourier transform for a group used in quantum errorcorrection is given and a slightly relaxed definition is shown to simplify the analysis and the networks that computes the transforms.

Quantum Computational Complexity

  • J. Watrous
  • Physics, Computer Science
    Encyclopedia of Complexity and Systems Science
  • 2009
Property of quantum complexity classes based on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems are presented.

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.

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.

On the power of quantum computation

  • Daniel R. Simon
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
This work presents 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 oracle drawn equiprobably from the uniform distribution on either class.

Resilient quantum computation: error models and thresholds

  • E. KnillR. LaflammeW. Zurek
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and

Quantum computation of Fourier transforms over symmetric groups

A quantum polynomial time algorithm for the Fourier transform for the symmetric groups Sn is given, adapting results obtained by Clausen and Diaconis–Rockmore to the quantum setting.