A new approximate Eastin-Knill theorem
Rhea Alexander

TL;DR
This paper introduces an approximate version of the Eastin-Knill theorem, showing conditions under which quantum error correcting codes can support universal transversal gates with bounded error, using resource theory tools.
Contribution
It provides a new approximate Eastin-Knill theorem applicable in the single-shot regime, linking code capabilities to the conditional min-entropy of the Choi state.
Findings
Supports universal transversal gates with low error probability
Provides a semidefinite program to verify the no-go condition
Demonstrates encoding of a logical qubit in a 100-qutrit code
Abstract
Transversal encoded gatesets are highly desirable for fault tolerant quantum computing. However, a quantum error correcting code which exactly corrects for local erasure noise and supports a universal set of transversal gates is ruled out by the Eastin-Knill theorem. Here we provide a new approximate Eastin-Knill theorem for the single-shot regime when we allow for some probability of error in the decoding. In particular, we show that a quantum error correcting code can support a universal set of transversal gates and approximately correct for local erasure if and only if the conditional min-entropy of the Choi state of the encoding and noise channel is upper bounded by a simple function of the worst-case error probability. Our no-go theorem can be computed by solving a semidefinite program, and, in the spirit of the original Eastin-Knill theorem, is formulated in terms of a condition…
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 Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
