Generalised state spaces and non-locality in fault tolerant quantum computing schemes
arXiv:1007.3455 · doi:10.1103/PhysRevA.83.032309
Abstract
We develop connections between generalised notions of entanglement and quantum computational devices where the measurements available are restricted, either because they are noisy and/or because by design they are only along Pauli directions. By considering restricted measurements one can (by considering the dual positive operators) construct single particle state spaces that are different to the usual quantum state space. This leads to a modified notion of entanglement that can be very different to the quantum version (for example, Bell states can become separable). We use this approach to develop alternative methods of classical simulation that have strong connections to the study of non-local correlations: we construct noisy quantum computers that admit operations outside the Clifford set and can generate some forms of multiparty quantum entanglement, but are otherwise classical in that they can be efficiently simulated classically and cannot generate non-local statistics. Although the approach provides new regimes of noisy quantum evolution that can be efficiently simulated classically, it does not appear to lead to significant reductions of existing upper bounds to fault tolerance thresholds for common noise models.
arXiv commentV2: 18 sides, 7 figures. Corrected two erroneous claims and one erroneous argument
References in corpus (26)
- Separability of Mixed States: Necessary and Sufficient Conditions
- Three qubits can be entangled in two inequivalent ways
- Efficient classical simulation of slightly entangled quantum computations
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Computing with Very Noisy Devices
- A Theory of Fault-Tolerant Quantum Computation
- On the role of entanglement in quantum computational speed-up
- General Entanglement Breaking Channels
- Overhead and noise threshold of fault-tolerant quantum error correction
- Resilient Quantum Computation: Error Models and Thresholds
- Hudson's Theorem for finite-dimensional quantum systems
- Classical simulation of noninteracting-fermion quantum circuits
- How robust is a quantum gate in the presence of noise?
- New optimal tests of quantum nonlocality
- Generalizations of entanglement based on coherent states and convex sets
- Improved magic states distillation for quantum universality
- Classicality in discrete Wigner functions
- All reversible dynamics in maximally non-local theories are trivial
- Bound States for Magic State Distillation in Fault-Tolerant Quantum Computation
- Classical simulatability, entanglement breaking, and quantum computation thresholds
- Efficient Hidden-Variable Simulation of Measurements in Quantum Experiments
- Matchgate and space-bounded quantum computations are equivalent
- Tight Noise Thresholds for Quantum Computation with Perfect Stabilizer Operations
- Economical ontological models for discrete quantum systems
- Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
- Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation
Cited by in corpus (5)
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Relational time in anyonic systems
- Nonlocality as a Benchmark for Universal Quantum Computation in Ising Anyon Topological Quantum Computers
- Smallest state spaces for which bipartite entangled quantum states are separable
- Efficient classical simulation of cluster state quantum circuits with alternative inputs