Compressed sensing quantum process tomography for superconducting quantum gates
Andrey V. Rodionov, Andrzej Veitia, R. Barends, J. Kelly, Daniel Sank,, J. Wenner, John M. Martinis, Robert L. Kosut, and Alexander N. Korotkov

TL;DR
This paper demonstrates that compressed sensing quantum process tomography can efficiently characterize superconducting quantum gates with significantly less data than traditional methods, maintaining high accuracy even with underdetermined systems.
Contribution
The study introduces the application of compressed sensing QPT to superconducting qubits, showing it works effectively with reduced data and in underdetermined scenarios, and compares different bases for process matrix sparsity.
Findings
High-fidelity process matrix estimates with less data
Effective underdetermined system handling
Consistent results across different bases
Abstract
We apply the method of compressed sensing (CS) quantum process tomography (QPT) to characterize quantum gates based on superconducting Xmon and phase qubits. Using experimental data for a two-qubit controlled-Z gate, we obtain an estimate for the process matrix with reasonably high fidelity compared to full QPT, but using a significantly reduced set of initial states and measurement configurations. We show that the CS method still works when the amount of used data is so small that the standard QPT would have an underdetermined system of equations. We also apply the CS method to the analysis of the three-qubit Toffoli gate with numerically added noise, and similarly show that the method works well for a substantially reduced set of data. For the CS calculations we use two different bases in which the process matrix is approximately sparse, and show that the resulting…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
