The computational complexity of ball permutations

DOI10.1145/3055399.3055453zbMath1369.68203arXiv1610.06646OpenAlexW2545038605WikidataQ130957087 ScholiaQ130957087MaRDI QIDQ4977982

Greg Kuperberg, Scott Aaronson, Saeed Mehraban, Adam Bouland

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

exchange interactionquantum complexity theoryintermediate modelsone clean qubit

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates

This page was built for publication: The computational complexity of ball permutations