Principles of quantum functional testing
arXiv:2209.11712 · doi:10.1103/PhysRevA.108.022602
Abstract
With increasing commercial availability of quantum information processing devices the need for testing them efficiently for their specified functionality will arise. Complete quantum channel characterization is out of the question for anything more than the simplest quantum channels for one or two qubits. Quantum functional testing leads to a decision problem with outcomes corresponding to rejection or acceptance of the claim of the producer that the device parameters are within certain specifications. In this context, we introduce and analyse three ingredients that can speed up this decision problem: iteration of the channel, efficient decision criteria, and non-greedy adaptive experimental design.
13 pages, 12 figures
References in corpus (13)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- Efficient quantum state tomography
- The Quantum Chernoff Bound
- Quantum Process Tomography: Resource Analysis of Different Strategies
- Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
- Robust Online Hamiltonian Learning
- The Chernoff lower bound for symmetric quantum hypothesis testing
- The quantum Chernoff bound as a measure of distinguishability between density matrices: application to qubit and Gaussian states
- Randomized Benchmarking of Multi-Qubit Gates
- Self-guided quantum tomography
- Deep reinforcement learning for quantum multiparameter estimation