• Corpus ID: 118558355

Introduction to Quantum Gate Set Tomography

  title={Introduction to Quantum Gate Set Tomography},
  author={Daniel Greenbaum},
  journal={arXiv: Quantum Physics},
  • D. Greenbaum
  • Published 9 September 2015
  • Physics
  • arXiv: Quantum Physics
Quantum gate set tomography (GST) has emerged as a promising method for the full characterization of quantum logic gates. In contrast to quantum process tomography (QPT), GST self-consistently and correctly accounts for state preparation and measurement (SPAM) errors. It therefore provides significantly more accurate estimates than QPT as gate fidelities increase into the fault-tolerant regime. We give a detailed review of GST and provide a self-contained guide to its implementation. The method… 
Bootstrapping quantum process tomography via a perturbative ansatz
The authors propose to efficiently infer general processes by approximating them through a sequence of two-qubit processes, and demonstrate it on a three-qu bit case.
Parametrized process characterization with reduced resource requirements
This work proposes an alternative approach that requires significantly fewer resources for unitary processes characterization without prior knowledge of the process and provides a built-in method for state preparation and measurement (SPAM) error mitigation.
Dual Map Framework for Noise Characterization of Quantum Computers
This paper presents a method that faithfully reconstructs a marginal (local) approximation of the effective noise (MATEN) channel, that acts as a single layer at the end of the circuit, that justifies the MATEN, even in the presence of non-local errors that occur during a circuit.
Non-Markovian Quantum Process Tomography
Improved multi-time circuit fidelities on IBM Quantum devices for both standalone qubits and in the presence of crosstalk are improved to a level comparable with the fault-tolerant noise threshold in a variety of different noise conditions.
Compressive gate set tomography
This work shows that low-rank approximations of gate sets can be obtained from significantly fewer gate sequences and that it is safe to draw them randomly, and forms the data processing problem of gate set tomography as a rank-constrained tensor completion problem.
Efficient and Robust Methods for Quantum Tomography
The development of large-scale platforms for quantum information requires new methods for verification and validation of quantum behavior. Quantum tomography (QT) is the standard tool for diagnosing
Representing and Probing Errors in Quantum Information Processing Devices
An operational quality measure for a gate-set is proposed and its usefulness in representing degree of errors and improving experimental control is discussed and a protocol is developed that separately and unambiguously characterizes state and measurement errors, relying on high-quality quantum gates.
Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
Gate set tomography is used to completely characterize operations on a trapped-Yb+-ion qubit and it is demonstrated with greater than 95% confidence that they satisfy a rigorous threshold for FTQEC (diamond norm ≤6.7 × 10−4).
Spectral quantum tomography
We introduce spectral quantum tomography, a simple method to extract the eigenvalues of a noisy few-qubit gate, represented by a trace-preserving superoperator, in a SPAM-resistant fashion, using low
Quantum logic with spin qubits crossing the surface code threshold
High-fidelity control of quantum bits is paramount for the reliable execution of quantum algorithms and for achieving fault tolerance—the ability to correct errors faster than they occur 1 . The


Robust, self-consistent, closed-form tomography of quantum logic gates on a trapped ion qubit
We introduce and demonstrate experimentally: (1) a framework called "gate set tomography" (GST) for self-consistently characterizing an entire set of quantum logic gates on a black-box quantum
Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking.
A systematic experimental estimate of quantum gate fidelities using randomized benchmarking of 1-qubit gates in the Clifford group is presented, finding evidence that the present limitation to the gate fidelity is mostly related to the external hardware and not the intrinsic behaviour of the qubit.
Robust error bars for quantum tomography
In quantum tomography, a quantum state or process is estimated from the results of measurements on many identically prepared systems. Tomography can never identify the state or process exactly. Any
On single qubit quantum process tomography for trace-preserving and nontrace-preserving maps
We review single-qubit quantum process tomography for trace-preserving and nontrace-preserving processes, and derive explicit forms of the general constraints for fitting experimental data. These
Characterizing universal gate sets via dihedral benchmarking
The dihedral benchmarking protocol is a generalization of randomized benchmarking that relaxes the usual unitary 2-design condition and enables direct benchmarking of the $T$ gate even for the gate-dependent error model that is expected in leading approaches to fault-tolerant quantum computation.
Estimating the Coherence of Noise
It is shown that the coherence of a noise source can be quantified by the unitarity, which relates to the average change in purity averaged over input pure states and provides a lower bound on the optimal achievable gate infidelity under a given noisy process.
Compressibility of Positive Semidefinite Factorizations and Quantum Models
Applications of compressibility of the dimension of positive semidefinite matrices range from the analysis of experimental data to bounding the one-way quantum communication complexity of Boolean functions.
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)
A Bibliography of Publications in Linear Algebra and its Applications: 1980{1989
(AB) = B− mrA − lr [WHG79]. (k) [Cha79]. (k, n) [MT79]. 0 [JGK79]. 0− 1 [HP78]. 2 [Sto79]. 2× 2 [Est79]. 3× 3 [AYP79]. A [Nic79]. AB +BA [Nic79]. AX − Y B = C [BK79a]. AX = B [PM79]. AXC = B [PM79].
  • Rev. Lett. 77, 4281
  • 1996