Quantum universality from magic states distillation applied to CSS codes

DOI10.1007/S11128-005-7654-8MaRDI QIDQ2573113zbMATH OpenOpenAlexFDO

Authors Ben 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)

Abstract: Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, can we do universal quantum computation? As motivation for this question, "magic state" distillation procedures can reduce the general fault-tolerance problem to that of performing fault-tolerant stabilizer circuits. We improve the procedures of Bravyi and Kitaev in the Hadamard "magic" direction of the Bloch sphere to achieve a sharp threshold between those rho allowing universal quantum computation, and those for which any calculation can be efficiently classically simulated. As a corollary, the ability to repeatedly prepare any pure state which is not a stabilizer state (e.g., any single-qubit pure state which is not a Pauli eigenstate), together with stabilizer operations, gives quantum universality. It remains open whether there is also a tight separation in the so-called T direction.

Recommendations

• scientific article
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Distillation of non-stabilizer states for universal quantum computation
• The resource theory of stabilizer quantum computation
• Negative quasi-probability as a resource for quantum computation

Cites work

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

Cited in

(19)

• The power of noisy fermionic quantum computation
• Distillation of non-stabilizer states for universal quantum computation
• Clifford orbits and stabilizer states
• Wigner's theorem for stabilizer states and quantum designs
• On the structure of protocols for magic state distillation
• Detecting magic states via characteristic functions
• Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing
• Optimal length of decomposition sequences composed of imperfect gates
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• The magic of universal quantum computing with permutations
• Quantifying magic for multi-qubit operations
• scientific article; zbMATH DE number 5666697 (Why is no real title available?)
• Negative quasi-probability as a resource for quantum computation
• Qutrit magic state distillation
• The resource theory of stabilizer quantum computation
• Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting)
• Error-detection-based quantum fault-tolerance threshold
• Magic state distillation with the ternary Golay code
• Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573113)