Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers

DOI10.1088/1367-2630/12/3/033012zbMath1360.81117arXiv0810.4340OpenAlexW3100932506MaRDI QIDQ2980795

S. Virmani, Martin B. Plenio

Publication date: 4 May 2017

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.4340

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (1)

Qutrit magic state distillation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum universality from magic states distillation applied to CSS codes
• Classical simulability, entanglement breaking, and quantum computation thresholds
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Quantum computations: algorithms and error correction
• On the role of entanglement in quantum-computational speed-up

This page was built for publication: Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers