Classical simulability, entanglement breaking, and quantum computation thresholds

DOI10.1103/PhysRevA.71.042328zbMath1227.81135arXivquant-ph/0408076OpenAlexW2090829264MaRDI QIDQ3102424

S. Virmani, Susana F. Huelga, Martin B. Plenio

Publication date: 4 December 2011

Published in: Physical Review A (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum equilibrium statistical mechanics (general) (82B10) Quantum measurement theory, state operations, state preparations (81P15)

Related Items (4)

Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers ⋮ A reversible theory of entanglement and its relation to the second law ⋮ Quantum entanglement ⋮ Quantum universality from magic states distillation applied to CSS codes

Cites Work

• Quantum computation by measurement and quantum memory
• Linear transformations which preserve trace and positive semidefiniteness of operators
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• Quantum coding theorems
• QUANTUM COMPUTATION BY MEASUREMENTS

This page was built for publication: Classical simulability, entanglement breaking, and quantum computation thresholds