pith. sign in

Mosca, Quantum algorithms (2008), arXiv:0808.0369 [quant-ph]

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it
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.

citation-role summary

background 1

citation-polarity summary

fields

quant-ph 3

years

2026 2 2019 1

roles

background 1

polarities

background 1

representative citing papers

Machine learning methods in quantum computing theory

quant-ph · 2019-06-21 · unverdicted · novelty 5.0

Authors present a multiclass tree tensor network algorithm demonstrated on IBM quantum processor and a neural network approach for noise-robust quantum state tomography.

citing papers explorer

Showing 3 of 3 citing papers.