Compressive gate set tomography
arXiv:2112.05176 · doi:10.1103/PRXQuantum.4.010325
Abstract
Flexible characterization techniques that identify and quantify experimental imperfections under realistic assumptions are crucial for the development of quantum computers. Gate set tomography is a characterization approach that simultaneously and self-consistently extracts a tomographic description of the implementation of an entire set of quantum gates, as well as the initial state and measurement, from experimental data. Obtaining such a detailed picture of the experimental implementation is associated with high requirements on the number of sequences and their design, making gate set tomography a challenging task even for only two qubits. In this work, we show that low-rank approximations of gate sets can be obtained from significantly fewer gate sequences and that it is sufficient to draw them randomly. Such tomographic information is needed for the crucial task of dealing with coherent noise. To this end, we formulate the data processing problem of gate set tomography as a rank-constrained tensor completion problem. We provide an algorithm to solve this problem while respecting the usual positivity and normalization constraints of quantum mechanics by using second-order geometrical optimization methods on the complex Stiefel manifold. Besides the reduction in sequences, we demonstrate numerically that the algorithm does not rely on structured gate sets or an elaborate circuit design to robustly perform gate set tomography. Therefore, it is more flexible than traditional approaches. We also demonstrate how coherent errors in shadow estimation protocols can be mitigated using estimates from gate set tomography.
arXiv comment14+12 pages, several figures and diagrams; v2: An error in our interface to pyGSTi has been corrected and Sections IV.A and IV.B have been reworked; v3: Added a new section on noise mitigation for shadow estimation with compressive GST, a corresponding appendix, an improved runtime table and various clarifications
References in corpus (50)
- The density-matrix renormalization group in the age of matrix product states
- Alternating Minimization Algorithms for Hybrid Precoding in Millimeter Wave MIMO Systems
- Quantum Computing with Very Noisy Devices
- Characterizing Quantum Supremacy in Near-Term Devices
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Quantum state tomography via compressed sensing
- Randomized Benchmarking of Quantum Gates
- Recovering low-rank matrices from few coefficients in any basis
- DMRG and periodic boundary conditions: a quantum information perspective
- Hybrid quantum-classical algorithms and quantum error mitigation
- Scalable Noise Estimation with Random Unitary Operators
- Characterizing Quantum Gates via Randomized Benchmarking
- A class of ansatz wave functions for 1D spin systems and their relation to DMRG
- Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
- Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
- Quantum certification and benchmarking
- IBM Q Experience as a versatile experimental testbed for simulating open quantum systems
- Self-Consistent Quantum Process Tomography
- Global rates of convergence for nonconvex optimization on manifolds
- Efficient measurement of quantum dynamics via compressive sensing
- Gate Set Tomography
- Experimental quantum compressed sensing for a seven-qubit system
- Robust shadow estimation
- Theory of quantum system certification: a tutorial
- Comparing Experiments to the Fault-Tolerance Threshold
- Quantum computation with universal error mitigation on superconducting quantum processor
- What randomized benchmarking actually measures
- Efficient estimation of Pauli channels
- Bounding quantum gate error rate based on reported average fidelity
- Classical Shadows With Noise
- Error-Mitigated Quantum Gates Exceeding Physical Fidelities in a Trapped-Ion System
- Robust Extraction of Tomographic Information via Randomized Benchmarking
- Quantum process tomography of unitary and near-unitary maps
- Easing the Monte Carlo sign problem
- Compressed sensing quantum process tomography for superconducting quantum gates
- Probing quantum processor performance with pyGSTi
- Optimization of a solid-state electron spin qubit using Gate Set Tomography
- Experimental Characterization of Crosstalk Errors with Simultaneous Gate Set Tomography
- Recovering quantum gates from few average gate fidelities
- Self-consistent tomography of the state-measurement Gram matrix
- Experimentally exploring compressed sensing quantum tomography
- The Fibonacci scheme for fault-tolerant quantum computation
- Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies
- Guaranteed recovery of quantum processes from few measurements
- Fast Bayesian tomography of a two-qubit gate set in silicon
- Stiefel and Grassmann manifolds in Quantum Chemistry
- Gauge invariant information concerning quantum channels
- Improving compressed sensing with the diamond norm
- On the freedom in representing quantum operations
- Randomized linear gate set tomography
Cited by in corpus (19)
- Computational advantage of quantum random sampling
- Artificial Intelligence for Quantum Computing
- Estimating gate-set properties from random sequences
- A Practical Introduction to Benchmarking and Characterization of Quantum Computers
- Learning logical Pauli noise in quantum error correction
- Tensor network noise characterization for near-term quantum computers
- Benchmarking universal quantum gates via channel spectrum
- Semi-device-dependent blind quantum tomography
- SPAM-Robust Multi-axis Quantum Noise Spectroscopy in Temporally Correlated Environments
- Stability of classical shadows under gate-dependent noise
- Gradient-descent methods for fast quantum state tomography
- Machine learning of quantum channels on NISQ devices
- Robust ultra-shallow shadows
- Unifying non-Markovian characterisation with an efficient and self-consistent framework
- Bosonic randomized benchmarking with passive transformations
- Classical certification of quantum gates under the dimension assumption
- A Riemannian Approach to the Lindbladian Dynamics of a Locally Purified Tensor Network
- Quantum Process Tomography with Digital Twins of Error Matrices
- Benchmarking Single-Qubit Gates on a Neutral Atom Quantum Processor