Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond

DOI10.1145/3357713.3384332OpenAlexW3035484803WikidataQ130916946 ScholiaQ130916946MaRDI QIDQ5144973

Daniel Grier, Luke Schaeffer

Publication date: 19 January 2021

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

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

zbMATH Keywords

Clifford circuitsquantum advantageinteractive protocolsclassical simulationmeasurement-based computationconstant-depthrelation problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time

This page was built for publication: Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond