Quantum Supremacy and the Complexity of Random Circuit Sampling
From MaRDI portal
Publication:5090387
DOI10.4230/LIPIcs.ITCS.2019.15OpenAlexW2962839411MaRDI QIDQ5090387
Bill Fefferman, Umesh V. Vazirani, Adam Bouland, Chinmay Nirkhe
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1803.04402
Related Items (5)
Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture ⋮ 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 ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ Unnamed Item
This page was built for publication: Quantum Supremacy and the Complexity of Random Circuit Sampling
