Algorithms for Quantum Computers

  title={Algorithms for Quantum Computers},
  author={Jamie Smith and Michele Mosca},
  booktitle={Handbook of Natural Computing},
  • Jamie Smith, M. Mosca
  • Published in Handbook of Natural Computing 2012
  • Mathematics, Computer Science, Physics
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of quantum Fourier transform based algorithms, followed by quantum searching and some of its early generalizations. It continues with a more in-depth description of two more recent developments: algorithms developed in the quantum walk paradigm, followed by tensor… Expand

Paper Mentions

The Quantum Computer Model Structure and Estimation of the Quantum Algorithms Complexity
The basics of quantum algorithms development and modeling of entangled quantum computations used in quantum algorithms are described and the entire set of necessary elements are shown: the time complexity, the number of operations and queries to the quantum oracle, the complexity class of the quantum algorithm. Expand
Normalizer Circuits and Quantum Computation
An efficient formalism for simulating families of quantum circuits, that are non-universal but comprise important quantum gates such as QFT or CNOT, is developed and used to design new algorithms that provide quantum speedups. Expand
Application of quantum walks on graph structures to quantum computing
Quantum computation is a new computational paradigm which can provide fundamentally faster computation than in the classical regime. This is dependent on finding efficient quantum algorithms forExpand
The Computational Structure of the Quantum Computer Simulator and Its Performance Evaluation
The computational structure of the quantum computer simulator has been derived, taking into account all the available features of constructing a simulator of a quantum computing device, and a software implementation of the derived universal computational structure is implemented. Expand
Quantum search with prior knowledge
The aim of this work is to develop a framework for realising quantum network algorithms with the use of prior knowledge about the structure of the network. We seek to obtain computational methodsExpand
On the study of the Potts model, Tutte and Chromatic Polynomials, and the Connections with Computation Complexity and Quantum Computing
Marina von Steinkirch∗ Institute of Physics and Astronomy, State University of New York at Stony Brook, USA (Dated: May 1, 2012) Abstract The Tutte polynomial of a graph is revised and the chromaticExpand
The computational power of normalizer circuits over black-box groups
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems, and finds that normalizer circuits are powerful enough to factorize and solve classically-hard problems in the black-box setting. Expand
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
By applying Grover’s quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehle, we obtain improved asymptotic quantumExpand
Can a quantum computer be applied for numerical weather prediction?
  • A. Frolov
  • Geology
  • Russian Meteorology and Hydrology
  • 2017
The paper considers fundamental limitations that impede the growth of performance of supercomputers based on silicon transistors and do not allow satisfying the needs of developing numerical weatherExpand
Finding shortest lattice vectors faster using quantum search
By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the literature, we obtain improved asymptotic quantum results for solving the shortest vector problem onExpand


Quantum algorithms for algebraic problems
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereasExpand
A framework for fast quantum mechanical algorithms
The sqrt(N) step quantum search algorithm is an immediate consequence of a framework for the design and analysis of quantum mechanical algorithms, and several other search-type applications are presented. Expand
Quantum Computing
This second edition of Mika Hirvensalo's quantum computing book differs from most of the previous ones which are mainly physics-oriented because the special style of presentation makes the theory of quantum computing accessible to a larger audience. Expand
Quantum computation and quantum information
  • T. Paul
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers dealExpand
Colloquium : Quantum annealing and analog quantum computation
The recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations is reviewed here. The concept is introduced in successiveExpand
Quantum Computation and the Evaluation of Tensor Networks
A quantum algorithm is presented that additively approximates the value of a tensor network to a certain scale and is used to derive new quantum algorithms that approximate the partition function of a variety of classical statistical mechanical models, including the Potts model. Expand
Quantum algorithms revisited
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantumExpand
Quantum measurements and the Abelian Stabilizer Problem
  • A. Kitaev
  • Computer Science, 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. Expand
Quantum speed-up of Markov chain based algorithms
  • M. Szegedy
  • Mathematics, Computer Science
  • 45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
It is shown that under certain conditions, the quantum version of the Markov chain gives rise to a quadratic speed-up, and that the quantum escape time, just like its classical version, depends on the spectral properties of the transition matrix with the marked rows and columns deleted. Expand
Exponential algorithmic speedup by a quantum walk
A black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer is constructed and it is proved that no classical algorithm can solve the problem in subexponential time. Expand