Quantum Supremacy and the Complexity of Random Circuit Sampling

DOI10.4230/LIPICS.ITCS.2019.15MaRDI QIDQ5090387zbMATH OpenOpenAlexFDO

Authors Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani

Publication date 18 July 2022

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

zbMATH Keywords

average-case hardnessquantum supremacyverification

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
• Average-case quantum advantage with shallow circuits
• Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Random quantum circuits transform local noise into global white noise
• A polynomial-time classical algorithm for noisy random circuit sampling
• Quantum advantage from any non-local game

This page was built for publication: Quantum Supremacy and the Complexity of Random Circuit Sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090387)