A polynomial-time classical algorithm for noisy random circuit sampling

DOI10.1145/3564246.3585234WikidataQ130921280 ScholiaQ130921280MaRDI QIDQ6499276

Dorit Aharonov, Yunchao Liu, Umesh V. Vazirani, Xun Gao, Zeph A. Landau

Publication date: 8 May 2024

zbMATH Keywords

quantum supremacyrandom circuit sampling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Random quantum circuits are approximate 2-designs
• Entanglement and correlation functions of the quantum Motzkin spin-chain
• Quantum Complexity Theory
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial-time classical algorithm for noisy random circuit sampling