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.
Aug 6, 2009
On the Structure of Protocols for Magic State Distillation - SpringerLink
link.springer.com › chapter
This reduced class consists of the protocols where multiple copies of a state are projected onto a stabilizer codespace and the logical qubit is then decoded.
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 ...
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 ...
This reduced class consists of the protocols where multiple copies of a state are projected onto a stabilizer codespace and the logical qubit is then decoded.
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 ...
Apr 25, 2022 · Distillation bounds can be obtained from any part of the Lorenz curve by imposing the constraint that the Lorenz curve of the input state never ...
Mar 22, 2017 · We present an infinite family of protocols to distill magic states for T-gates that has a low space overhead and uses an asymptotic number of input magic ...
Missing: Structure | Show results with:Structure
Dec 27, 2012 · We propose families of protocols for magic-state distillation—important components of fault-tolerance schemes—for systems of odd prime dimension ...
This paper presents a scheme to fault-tolerantly and directly prepare magic states using flag qubits and shows that the overhead can be improved by several ...