A magic state’s fidelity can be superior to the operations that created it

DOI10.1088/1367-2630/17/2/023037zbMath1452.81054arXiv1410.7808OpenAlexW3103321606MaRDI QIDQ3387643

Ying Li

Publication date: 13 January 2021

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

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

zbMATH Keywords

surface codefault tolerant quantum computingmagic state

Mathematics Subject Classification ID

Quantum state spaces, operational and probabilistic concepts (81P16) Quantum state tomography, quantum state discrimination (81P18) Quantum channels, fidelity (81P47)

Related Items (3)

Lattice surgery translation for quantum computation ⋮ Learning time-dependent noise to reduce logical errors: real time error rate estimation in quantum error correction ⋮ Minimally complex ion traps as modules for quantum communication and computing

Cites Work

• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Fault-tolerant quantum computation by anyons
• A fault-tolerant one-way quantum computer
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Topological quantum memory
• Surface code quantum computing by lattice surgery
• Transversality Versus Universality for Additive Quantum Codes

This page was built for publication: A magic state’s fidelity can be superior to the operations that created it