Bounding quantum gate error rate based on reported average fidelity
From MaRDI portal
Publication:5854911
DOI10.1088/1367-2630/18/1/012002zbMath1456.81130arXiv1501.04932OpenAlexW3100407698WikidataQ59440942 ScholiaQ59440942MaRDI QIDQ5854911
Barry C. Sanders, Joel J. Wallman, Yuval R. Sanders
Publication date: 12 March 2021
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.04932
Quantum gates (81P65) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)
Related Items (1)
Uses Software
Cites Work
- On the generators of quantum dynamical semigroups
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Randomized benchmarking with confidence
- Fault-Tolerant Quantum Computation with Constant Error Rate
- Quantum computations: algorithms and error correction
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Cryptographic distinguishability measures for quantum-mechanical states
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounding quantum gate error rate based on reported average fidelity