Superpolynomial Speedups Based on Almost Any Quantum Circuit

DOI10.1007/978-3-540-70575-8_64zbMath1153.68378arXiv0805.0007OpenAlexW2953263615MaRDI QIDQ3521966

Aram W. Harrow, Sean Hallgren

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.0007

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Related Items (3)

Mixing properties of stochastic quantum Hamiltonians ⋮ Local random quantum circuits are approximate polynomial-designs ⋮ Random quantum circuits are approximate 2-designs

This page was built for publication: Superpolynomial Speedups Based on Almost Any Quantum Circuit