Accelerated randomized benchmarking
From MaRDI portal
Publication:3387605
DOI10.1088/1367-2630/17/1/013042zbMath1452.81078arXiv1404.5275OpenAlexW2144105074WikidataQ62098648 ScholiaQ62098648MaRDI QIDQ3387605
Christopher E. Granade, Christopher Ferrie, David G. Cory
Publication date: 13 January 2021
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.5275
Quantum computation (81P68) Quantum gates (81P65) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)
Related Items (4)
Unnamed Item ⋮ Quantum bootstrapping via compressed quantum Hamiltonian learning ⋮ Comparing the randomized benchmarking figure with the average infidelity of a quantum gate-set ⋮ Robust characterization of leakage errors
Uses Software
Cites Work
- How to best sample a periodic probability distribution, or on the accuracy of Hamiltonian finding strategies
- Randomized benchmarking with confidence
- High posterior density ellipsoids of quantum states
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Robust online Hamiltonian learning
- Elements of Information Theory
- Generalized Cumulant Expansion Method
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Accelerated randomized benchmarking