Analytical error analysis of Clifford gates by the fault-path tracer method
From MaRDI portal
Publication:331869
DOI10.1007/S11128-016-1330-ZzbMATH Open1348.81167arXiv1512.06284OpenAlexW2204254039MaRDI QIDQ331869FDOQ331869
Authors: Smitha Janardan, Yu Tomita, Kenneth R. Brown, M. A. Gutierrez
Publication date: 27 October 2016
Published in: Quantum Information Processing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1512.06284
Recommendations
Cites Work
- Error Correcting Codes in Quantum Theory
- Quantum computation and quantum information. 10th anniversary edition
- Quantum accuracy threshold for concatenated distance-3 code
- Quantum complexity theory
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Effective fault-tolerant quantum computation with slow measurements
- Transport dynamics of single ions in segmented microstructured Paul trap arrays
- Estimating the coherence of noise
Cited In (3)
Uses Software
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)