Two-qubit Stabilizer Circuits with Recovery I: Existence

Authors Wim van Dam , Raymond Wong

Thumbnail PDF


  • Filesize: 484 kB
  • 15 pages

Document Identifiers

Author Details

Wim van Dam
  • Department of Computer Science, Department of Physics, University of California, Santa Barbara, CA, USA
Raymond Wong
  • Department of Computer Science, University of California, Santa Barbara, CA, USA

Cite AsGet BibTex

Wim van Dam and Raymond Wong. Two-qubit Stabilizer Circuits with Recovery I: Existence. In 13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 111, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


In this paper, we further investigate the many ways of using stabilizer operations to generate a single qubit output from a two-qubit state. In particular, by restricting the input to certain product states, we discover probabilistic operations capable of transforming stabilizer circuit outputs back into stabilizer circuit inputs. These secondary operations are ideally suited for recovery purposes and require only one extra resource input to proceed. As a result of reusing qubits in this manner, we present an alternative to the original state preparation process that can lower the overall costs of executing a two-qubit stabilizer procedure involving non-stabilizer resources.

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum computation theory
  • stabilizer circuit
  • recovery circuit
  • magic state


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Alex Bocharov, Martin Roetteler, and Krysta M. Svore. Efficient synthesis of probabilistic quantum circuits with fallback. Phys. Rev. A, 91:052317, May 2015. URL:
  2. Alex Bocharov, Martin Roetteler, and Krysta M. Svore. Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits. Phys. Rev. Lett., 114:080502, Feb 2015. URL:
  3. Sergey Bravyi and Jeongwan Haah. Magic-state distillation with low overhead. Phys. Rev. A, 86:052329, Nov 2012. URL:
  4. Sergey Bravyi and Alexei Kitaev. Universal quantum computation with ideal clifford gates and noisy ancillas. Phys. Rev. A, 71:022316, Feb 2005. URL:
  5. Earl T. Campbell and Mark Howard. Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost. Phys. Rev. A, 95:022316, Feb 2017. URL:
  6. Earl T. Campbell and Mark Howard. Unifying Gate Synthesis and Magic State Distillation. Phys. Rev. Lett., 118:060501, Feb 2017. URL:
  7. Earl T Campbell and Joe O’Gorman. An efficient magic state approach to small angle rotations. Quantum Science and Technology, 1(1):015007, 2016. URL:
  8. Guillaume Duclos-Cianci and David Poulin. Reducing the quantum-computing overhead with complex gate distillation. Phys. Rev. A, 91:042315, Apr 2015. URL:
  9. Guillaume Duclos-Cianci and Krysta M. Svore. Distillation of nonstabilizer states for universal quantum computation. Phys. Rev. A, 88:042325, Oct 2013. URL:
  10. Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland. Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A, 86:032324, Sep 2012. URL:
  11. Brett Giles and Peter Selinger. Exact synthesis of multiqubit Clifford+T circuits. Phys. Rev. A, 87:032332, Mar 2013. URL:
  12. Jeongwan Haah, Matthew B. Hastings, D. Poulin, and D. Wecker. Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count. Quantum, 1:31, Oct 2017. URL:
  13. N Cody Jones, James D Whitfield, Peter L McMahon, Man-Hong Yung, Rodney Van Meter, Alán Aspuru-Guzik, and Yoshihisa Yamamoto. Faster quantum chemistry simulation on fault-tolerant quantum computers. New Journal of Physics, 14(11):115023, 2012. URL:
  14. J.G. Kemény and J.L. Snell. Finite markov chains. University series in undergraduate mathematics. Springer-Verlag New York, 1976. Google Scholar
  15. Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca. Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford and T Circuits Using a Constant Number of Ancillary Qubits. Phys. Rev. Lett., 110:190502, May 2013. URL:
  16. Vadym Kliuchnikov, Dmitri Maslov, and Michele Mosca. Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates. Quantum Information and Computation, 13(7-8):607-630, 2013. URL:
  17. E. Knill. Quantum computing with realistically noisy devices. Nature, 434, Mar 2005. URL:
  18. Andrew J. Landahl and Chris Cesare. Complex instruction set computing architecture for performing accurate quantum Z rotations with less magic, Feb 2013. URL:
  19. Adam Meier, Bryan Eastin, and Emanuel Knill. Magic-state distillation with the four-qubit code. Quantum Information and Computation, 13:195-209, 2013. URL:
  20. Adam Paetznick and Krysta M. Svore. Repeat-Until-Success: Non-determistic decomposition of single-qubit unitaries. Quantum Info. Comput., 14(15-16):1277-1301, Nov 2014. URL:
  21. Ben Reichardt. Quantum universality by state distillation. Quantum Information and Computation, 9:1030-1052, 2009. URL:
  22. Neil J. Ross. Optimal ancilla-free Clifford+V approximation of z-rotations. Quantum Information and Computation, 15(11-12):932-950, 2015. URL:
  23. Neil J. Ross and Peter Selinger. Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Information and Computation, 16(11-12):901-953, 2016. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail