Year: 2022
Type: article
Abstract: We study the properties of output distributions of noisy random circuits.We obtain upper and lower bounds on the expected distance of the output distribution from the "useless" uniform distribution.These bounds are tight with respect to the dependence on circuit depth.Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits.We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation.Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques.We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what has been thought prior to this work.
Source: PRX Quantum
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $3,450
Funders: National Science Foundation, U.S. Department of Energy, Boettcher Foundation, Defense Advanced Research Projects Agency, Office of Science, Advanced Research Projects Agency, Multidisciplinary University Research Initiative, Institute for Quantum Information and Matter, California Institute of Technology, Advanced Scientific Computing Research, Air Force Office of Scientific Research, Army Research Office
Awards: G1246683416, G1523888516, G1543527024, G1871477277, G1938338418, G1965873410, G2127201742, G2403330605, QLCI-CI: NSF Quantum Leap Challenge Institute for Robust Quantum Simulation, G3045592441, G3138666703, G3230488186, FUNDAMENTAL ALGORITHMIC RESEARCH FOR QUANTUM COMPUTING, FUNDAMENTAL ALGORITHMIC RESEARCH FOR QUANTUM COMPUTING, G4010038600, G4516736450, G4578494242, G4606701553, EFFICIENT AND RELIABLE MAPPING OF QUANTUM COMPUTATIONS ONTO REALISTIC ARCHITECTURES, CAREER: Near-term quantum computing: achieving quantum advantage, and next steps, RAISE/TAQS: Quantum simulation of materials and molecules using quantum computation, The Institute for Quantum Information and Matter: Advancing the Entanglement Frontier, QUANTUM COMPUTING IN CHEMICAL AND MATERIAL SCIENCES, QUANTUM COMPUTING IN CHEMICAL AND MATERIAL SCIENCES, G6478756169, G6671297155, G6872496620, G7436220671, EFFICIENT AND RELIABLE MAPPING OF QUANTUM COMPUTATIONS ONTO REALISTIC ARCHITECTURES, Kavli Institute for Theoretical Physics, G8532239345, G8729776176, G8994610407
OpenAlex ID: W4312205426