Quantum universality from magic states distillation applied to CSS codes

DOI10.1007/s11128-005-7654-8zbMath1130.81336arXivquant-ph/0411036OpenAlexW1656594904MaRDI QIDQ2573113

Ben W. Reichardt

Publication date: 7 November 2005

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0411036

zbMATH Keywords

protocolsstabilizer statesUniversal quantam computing

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (12)

Error-detection-based quantum fault-tolerance threshold ⋮ Optimal length of decomposition sequences composed of imperfect gates ⋮ Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting) ⋮ Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers ⋮ Qutrit magic state distillation ⋮ Negative quasi-probability as a resource for quantum computation ⋮ The power of noisy fermionic quantum computation ⋮ Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing ⋮ Quantifying magic for multi-qubit operations ⋮ Magic state distillation with the ternary Golay code ⋮ The magic of universal quantum computing with permutations ⋮ The resource theory of stabilizer quantum computation

Cites Work

• A new universal and fault-tolerant quantum basis
• Classical simulability, entanglement breaking, and quantum computation thresholds
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Resilient quantum computation: error models and thresholds

This page was built for publication: Quantum universality from magic states distillation applied to CSS codes