Analytical error analysis of Clifford gates by the fault-path tracer method
From MaRDI portal
Publication:331869
Abstract: We estimate the success probability of quantum protocols composed of Clifford operations in the presence of Pauli errors. Our method is derived from the fault-point formalism previously used to determine the success rate of low-distance error correction codes. Here we apply it to a wider range of quantum protocols and identify circuit structures that allow for efficient calculation of the exact success probability and even the final distribution of output states. As examples, we apply our method to the Bernstein-Vazirani algorithm and the Steane 7,1,3 quantum error correction code and compare the results to Monte Carlo simulations.
Recommendations
Cites work
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Effective fault-tolerant quantum computation with slow measurements
- Error Correcting Codes in Quantum Theory
- Estimating the coherence of noise
- Quantum accuracy threshold for concatenated distance-3 code
- Quantum complexity theory
- Quantum computation and quantum information. 10th anniversary edition
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Transport dynamics of single ions in segmented microstructured Paul trap arrays
Cited in
(3)
This page was built for publication: Analytical error analysis of Clifford gates by the fault-path tracer method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331869)