A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)

Abstract

Inevitably, assessing the overall performance of a quantum computer must rely on characterizing some of its elementary constituents and, from this information, formulate a broader statement concerning more complex constructions thereof. However, given the vastitude of possible quantum errors as well as their coherent nature, accurately inferring the quality of composite operations is generally difficult. To navigate through this jumble, we introduce a non-physical simplification of quantum maps that we refer to as the leading Kraus (LK) approximation. The uncluttered parameterization of LK approximated maps naturally suggests the introduction of a unitary-decoherent polar factorization for quantum channels in any dimension. We then leverage this structural dichotomy to bound the evolution -- as circuits grow in depth -- of two of the most experimentally relevant figures of merit, namely the average process fidelity and the unitarity. We demonstrate that the leeway in the behavior of the process fidelity is essentially taken into account by physical unitary operations.

arXiv comment50 pages, 3 figures, 2 tables

References in corpus (27)

• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Scalable Noise Estimation with Random Unitary Operators
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Characterization of addressability by simultaneous randomized benchmarking
• Silicon qubit fidelities approaching incoherent noise limits via pulse engineering
• Estimating the Coherence of Noise
• Procedures for Converting among Lindblad, Kraus and Matrix Representations of Quantum Dynamical Semigroups
• Characterizing errors on qubit operations via iterative randomized benchmarking
• Contractivity of positive and trace preserving maps under $L_p$ norms
• Randomized Benchmarking of Multi-Qubit Gates
• Direct randomized benchmarking for multi-qubit devices
• Information preserving structures: A general framework for quantum zero-error information
• Characterizing Universal Gate Sets via Dihedral Benchmarking
• Scalable randomized benchmarking of non-Clifford gates
• Characterization of Leakage Errors via Randomized Benchmarking
• Real Randomized Benchmarking
• Accelerated Randomized Benchmarking
• Robust Characterization of Loss Rates
• Estimating the coherence of noise in quantum control of a solid-state qubit
• Randomized Benchmarking with Restricted Gate Sets
• Rolling quantum dice with a superconducting qubit
• Approximate Randomized Benchmarking for Finite Groups
• Unital quantum operators on the Bloch ball and Bloch region

Cited by in corpus (9)

• A general framework for randomized benchmarking
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit
• The Impact of Imperfect Timekeeping on Quantum Control
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
• Improved quantum error correction with randomized compiling
• Benchmarking universal quantum gates via channel spectrum
• Unification of Random Dynamical Decoupling and the Quantum Zeno Effect
• Characterization of coherent errors in gate layers with robustness to Pauli noise
• Robustly decorrelating errors with mixed quantum gates