Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers

DOI10.1088/1367-2630/12/3/033012zbMATH Open1360.81117arXiv0810.4340OpenAlexW3100932506MaRDI QIDQ2980795FDOQ2980795

Authors: S. Virmani, Martin B. Plenio 

Publication date: 4 May 2017

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

Abstract: We consider the possibility of adding noise to a quantum circuit to make it efficiently simulatable classically. In previous works this approach has been used to derive upper bounds to fault tolerance thresholds - usually by identifying a privileged resource, such as an entangling gate or a non-Clifford operation, and then deriving the noise levels required to make it `unprivileged'. In this work we consider extensions of this approach where noise is added to Clifford gates too, and then `commuted' around until it concentrates on attacking the non-Clifford resource. While commuting noise around is not always straightforward, we find that easy instances can be identified in popular fault tolerance proposals, thereby enabling sharper upper bounds to be derived in these cases. For instance we find that if we take Knill's high threshold proposal together with the ability to prepare any possible state in the $XY$ plane of the Bloch sphere, then no more than 3.69% error-per-gate noise is sufficient to make it classical, and 13.71% of Knill's gamma noise model is sufficient. These bounds have been derived without noise being added to the decoding parts of the circuits. Introducing such noise in a toy example suggests that the present approach can be optimised further to yield tighter bounds.

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

Recommendations

• Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
• Upper bounds on the noise threshold for fault-tolerant quantum computing
• Classical simulability, entanglement breaking, and quantum computation thresholds
• Error-detection-based quantum fault-tolerance threshold
• Fault-Tolerant Quantum Computation with Constant Error Rate

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• Quantum computations: algorithms and error correction
• On the role of entanglement in quantum-computational speed-up
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• An upper bound on the threshold quantum decoherence rate
• Quantum universality from magic states distillation applied to CSS codes
• Title not available (Why is that?)
• Classical simulability, entanglement breaking, and quantum computation thresholds

Cited In (8)

• Can shallow quantum circuits scramble local noise into global white noise?
• Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
• Classical simulability, entanglement breaking, and quantum computation thresholds
• A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
• Qutrit magic state distillation
• An upper bound on the threshold quantum decoherence rate
• Upper bounds on the noise threshold for fault-tolerant quantum computing
• Title not available (Why is that?)

This page was built for publication: Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers

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