Quantum Algorithms
read the original abstract
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a summary of the early quantum algorithms, a description of the Abelian Hidden Subgroup algorithms (including Shor's factoring and discrete logarithm algorithms), quantum searching and amplitude amplification, quantum algorithms for simulating quantum mechanical systems, several non-trivial generalizations of the Abelian Hidden Subgroup Problem (and related techniques), the quantum walk paradigm for quantum algorithms, the paradigm of adiabatic algorithms, a family of ``topological'' algorithms, and algorithms for quantum tasks which cannot be done by a classical computer, followed by a discussion.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
An Error-aware and Adaptive Method for the Estimation of Quantum Observables on Qudit-Based Quantum Computers
AQUIRE is the first error-aware adaptive Bayesian protocol for simultaneously estimating the mean and error of observables on qudit quantum computers using generalized Pauli operators and overlap grouping.
-
A Methodological Analysis of Empirical Studies in Quantum Software Testing
A systematic analysis of 59 quantum software testing empirical studies reveals highly diverse designs, inconsistent reporting, and open methodological challenges, leading to recommendations for future work.
-
Machine learning methods in quantum computing theory
Authors present a multiclass tree tensor network algorithm demonstrated on IBM quantum processor and a neural network approach for noise-robust quantum state tomography.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.