Counterexamples to Kalai's Conjecture C
Steven T. Flammia, Aram W. Harrow
TL;DR
This paper presents two straightforward counterexamples to Kalai's Conjecture C, challenging assumptions about quantum computation's scalability and discussing implications for fault-tolerant quantum computing.
Contribution
The authors introduce simple counterexamples to Kalai's Conjecture C and analyze their impact on the feasibility of large-scale fault-tolerant quantum computers.
Findings
Counterexamples invalidate Kalai's Conjecture C
Implications suggest challenges for large-scale quantum fault tolerance
Discussion on the future prospects of quantum computing
Abstract
We provide two simple counterexamples to Kalai's Conjecture C and discuss our perspective on the implications for the prospect of large-scale fault-tolerant quantum computation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications