2009

On the Structure of Protocols for Magic State Distillation

Campbell, Earl T., Browne, Dan E.

Understand

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 where multiple copies of a state are projected onto a stabilizer codespace and the logical qubit is then decoded.

Built on

  • Nonabelions in the fractional quantum Hall effect

    Moore, G., Read, N.: · 1991

    Earlier work this paper cites.

  • Multiple particle interference and quantum error correction

    Steane, A.: · 1996

    Earlier work this paper cites.

  • Stabilizer Codes and Quantum Error Correction

    Gottesman, D.: · 1997

    Earlier work this paper cites.

  • Theory of fault tolerant quantum computing

    Gottesman, D.: · 1998

    Earlier work this paper cites.

  • Quantum Computation and Quantum Information

    Nielsen, M.A., Chuang, I.L.: · 2000

    Earlier work this paper cites.

  • Quantum computation with abelian anyons

    Lloyd, S.: · 2002

    Earlier work this paper cites.

Similar

  • Pairing of Cooper pairs in a fully frustrated Josephson-junction chain

    Douçot, B., Vidal, J.: · 2002

    Cited alongside, same era.

  • Efficient classical simulation of continuous variable quantum information processes

    Original

    Bartlett, S.D., Sanders, B.C., Braunstein, S.L., Nemoto, K.: · 2002

    Cited alongside, same era.

  • Fault-tolerant quantum computation by anyons

    Kitaev, A.: · 2003

    Cited alongside, same era.

  • Universal quantum computation with ideal Clifford gates and noisy ancillas

    Bravyi, S., Kitaev, A.: · 2005

    Cited alongside, same era.

  • Quantum universality from magic states distillation applied to CSS codes

    Reichardt, B.W.: · 2005

    Cited alongside, same era.

  • Quantum computing with realistically noisy devices

    Knill, E.: · 2005

    Cited alongside, same era.

Then

  • Fast simulation of stabilizer circuits using a graph-state reprsentation

    Anders, S., Briegel, H.J.: · 2006

    Later among the works it cites.

  • Quantum universality by distilling certain one- and two-qubit states with stabilizer operations

    Reichardt, B.W.: · 2006

    Later among the works it cites.

  • Topological fault-tolerance in cluster state quantum computation

    Raussendorf, R., Harrington, J., Goyal, K.: · 2007

    Later among the works it cites.

  • Restrictions on transversal encoded quantum gate sets

    Eastin, B., Knill, E.: · 2009

    Closest in time.

  • Error-detection-based quantum fault-tolerance threshold

    Reichardt, B.W.: · 2009

    Closest in time.

  • Bound States for Magic State Distillation

    Original

    Campbell, E.T., Browne, D.E.: · 2009

    Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…