Related papers: Invariant Theory, Magic State Distillation, and Bo…
Determining the best attainable threshold for qudit magic state distillation is directly related to the question of whether or not contextuality is sufficient for universal quantum computation. We show that the performance of a qudit…
Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although…
Many proposals for fault-tolerant quantum computation require injection of 'magic states' to achieve a universal set of operations. Some qubit states are above a threshold fidelity, allowing them to be converted into magic states via 'magic…
Magic states are fundamental building blocks on the road to fault-tolerant quantum computing. CSS codes play a crucial role in the construction of magic distillation protocols. Previous work has cast quantum computing with magic states for…
Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states required per output magic state with an error rate below…
Magic states, by allowing non-Clifford gates through gate teleportation, are important building blocks of fault-tolerant quantum computation. Magic state distillation protocols aim to create clean copies of magic states from many noisier…
Magic state distillation is a crucial component in the leading approaches to implementing universal fault tolerant quantum computation, with existing protocols for both qubit and higher dimensional systems. Early work focused on determining…
Magic state distillation (MSD) is the leading approach to generate the non-Clifford resources required for universal fault-tolerant quantum computation. While most analyses assume ideal measurements in the distillation process, this…
We present a theorem that shows that all useful protocols for magic state distillation output states with a fidelity that is upper-bounded by those generated by a much smaller class of protocols. This reduced class consists of the protocols…
Fault-tolerant implementation of non-Clifford gates is a major challenge for achieving universal fault-tolerant quantum computing with quantum error-correcting codes. Magic state distillation is the most well-studied method for this but…
Recently we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, called "inner codes" and "outer codes." We presented some…
Realizing universal fault-tolerant quantum computation is a key goal in quantum information science. By encoding quantum information into logical qubits utilizing quantum error correcting codes, physical errors can be detected and…
Qudits offer the potential for low-overhead magic state distillation, although previous results for asymptotically good codes have required qudit dimension $q\gg 100$ or code length $\mathcal{N}\gg 100$. These parameters far exceed…
Magic state distillation is a critical component in leading proposals for fault-tolerant quantum computation. Relatively little is known, however, about how to construct a magic state distillation routine or, more specifically, which…
Magic state distillation uses special codes to suppress errors in input states, which are often tailored to a Clifford-twirled error model. We present detailed measurement sequences for magic state distillation protocols which can suppress…
The distillation of magic states is an often-cited technique for enabling universal quantum computing once the error probability for a special subset of gates has been made negligible by other means. We present a routine for magic-state…
Magic state distillation is an important primitive in fault-tolerant quantum computation. The magic states are pure non-stabilizer states which can be distilled from certain mixed non-stabilizer states via Clifford group operations alone.…
It has been conjectured [1] that for any distillation protocol for magic states for the $T$ gate, the number of noisy input magic states required per output magic state at output error rate $\epsilon$ is $\Omega(\log(1/\epsilon))$. We show…
We introduce a mixed-state magic criterion, the Triangle Criterion, which plays a role for magic analogous to the Positive Partial Transposition (PPT) Criterion for entanglement: it combines strong detection capability, a clear geometric…
Quantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels,…