A fault-tolerant one-way quantum computer

DOI10.1016/j.aop.2006.01.012zbMath1101.81037arXivquant-ph/0510135OpenAlexW2000415061MaRDI QIDQ2503392

Yanyan Li

Publication date: 14 September 2006

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

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

zbMATH Keywords

cluster statequbitfault-tolerant quantum computation15-qubit Reed-Muller quantum codeplanar codetopological quantum error correction

Mathematics Subject Classification ID

Applications of graph theory (05C90) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15)

Related Items (20)

Quantum computation with Turaev-Viro codes ⋮ Hierarchies of resources for measurement-based quantum computation ⋮ Quantum hyper-CPHASE gates with polarisation and orbital angular momentum degrees of freedom and generalisation to arbitrary hyper-conditional gates ⋮ Nonlocal hyperconcentration on entangled photons using photonic module system ⋮ Quantum memories and error correction ⋮ Toric codes and quantum doubles from two-body Hamiltonians ⋮ Qutrit magic state distillation ⋮ Long range failure-tolerant entanglement distribution ⋮ APPLICATIONS OF ATOMIC ENSEMBLES IN DISTRIBUTED QUANTUM COMPUTING ⋮ AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES ⋮ Measurement-Based and Universal Blind Quantum Computation ⋮ Quantum Fault Tolerance in Systems with Restricted Control ⋮ Statistical mechanical models for quantum codes with correlated noise ⋮ A magic state’s fidelity can be superior to the operations that created it ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Quantum information in the Posner model of quantum cognition ⋮ Measurement-Only Topological Quantum Computation ⋮ Quantum error-detection at low energies ⋮ Minimally complex ion traps as modules for quantum communication and computing ⋮ Theory of quantum games and quantum economic behavior

Cites Work

• Fault-tolerant quantum computation by anyons
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Resilient quantum computation: error models and thresholds
• Computing Minimum-Weight Perfect Matchings
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fault-tolerant one-way quantum computer