Accelerated randomized benchmarking
From MaRDI portal
Abstract: Quantum information processing offers promising advances for a wide range of fields and applications, provided that we can efficiently assess the performance of the control applied in candidate systems. That is, we must be able to determine whether we have implemented a desired gate, and refine accordingly. Randomized benchmarking reduces the difficulty of this task by exploiting symmetries in quantum operations. Here, we bound the resources required for benchmarking and show that, with prior information, we can achieve several orders of magnitude better accuracy than in traditional approaches to benchmarking. Moreover, by building on state-of-the-art classical algorithms, we reach these accuracies with near-optimal resources. Our approach requires an order of magnitude less data to achieve the same accuracies and to provide online estimates of the errors in the reported fidelities. We also show that our approach is useful for physical devices by comparing to simulations. Our results thus enable the application of randomized benchmarking in new regimes, and dramatically reduce the experimental effort required to assess control fidelities in quantum systems. Finally, our work is based on open-source scientific libraries, and can readily be applied in systems of interest.
Recommendations
Cites work
- scientific article; zbMATH DE number 5863326 (Why is no real title available?)
- scientific article; zbMATH DE number 1220667 (Why is no real title available?)
- scientific article; zbMATH DE number 6541785 (Why is no real title available?)
- Elements of Information Theory
- Generalized Cumulant Expansion Method
- High posterior density ellipsoids of quantum states
- How to best sample a periodic probability distribution, or on the accuracy of Hamiltonian finding strategies
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Randomized benchmarking with confidence
- Robust online Hamiltonian learning
Cited in
(12)- An energy estimation benchmark for quantum computing hardware
- scientific article; zbMATH DE number 7559368 (Why is no real title available?)
- Majorization-based benchmark of the complexity of quantum processors
- Comparing the randomized benchmarking figure with the average infidelity of a quantum gate-set
- Robust characterization of leakage errors
- Quantum bootstrapping via compressed quantum Hamiltonian learning
- Approximate randomized benchmarking for finite groups
- A unified ``bang-bang principle with respect to \({\mathcal R}\)-invariant performance benchmarks
- Benchmarking quantum processors with a single qubit
- Statistical inference with quantum measurements: methodologies for nitrogen vacancy centers in diamond
- Randomized benchmarking with confidence
- Quantum process tomography on cloud-accessible quantum computing platforms
This page was built for publication: Accelerated randomized benchmarking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387605)
