Moments of Quantum Channel Ensembles

Abstract

Moments of ensembles of unitaries play a central role in quantum information theory as they capture the statistical properties of dynamics of systems with some form of randomness. Indeed, concepts such as approximate $t$-designs arise when comparing how close an associated moment operator of a given unitary ensemble is to that of another, reference ensemble. Despite the importance of moment operators, their properties have not been as explored for quantum channels. In this work we develop a theoretical framework to compute moment operators for ensembles of quantum channels, for all moment orders $t$, with a special focus on determining ensembles that can be used as points of reference. By deriving hierarchies between ensembles, via inequalities of their moment operator norms, we give them operational meaning, and define useful concepts such as that of channel $t$-designs. Finally, we perform theoretical and numerical studies which show that different types of noise can decrease the norm of the moment operators (e.g., depolarizing noise), as well as increase it (e.g., amplitude damping noise), and generalize noise-induced concentration phenomena to channel-design-induced phenomena. Along the way, we find a block-orthogonal basis for permutations, which greatly simplifies our analyses, and may be of independent interest in moment calculations.

12+33 pages, 5+5 figures

References in corpus (77)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Black holes as mirrors: quantum information in random subsystems
• Characterizing Quantum Supremacy in Near-Term Devices
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Strong quantum computational advantage using a superconducting quantum processor
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Fast Scramblers
• Randomized Benchmarking of Quantum Gates
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Robust randomized benchmarking of quantum processes
• Operator Spreading in Random Unitary Circuits
• Measurement-Induced Phase Transitions in the Dynamics of Entanglement
• Quantum Zeno Effect and the Many-body Entanglement Transition
• Chaos in quantum channels
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Quantum Entanglement Growth Under Random Unitary Dynamics
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum Error Mitigation
• Operator hydrodynamics, OTOCs, and entanglement growth in systems without conservation laws
• Measurement-induced criticality in random quantum circuits
• Holographic duality from random tensor networks
• Towards the fast scrambling conjecture
• The randomized measurement toolbox
• Evenly distributed unitaries: on the structure of unitary designs
• Classical simulation of noninteracting-fermion quantum circuits
• Local random quantum circuits are approximate polynomial-designs
• The Expressive Power of Parameterized Quantum Circuits
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Quantum generalisation of feedforward neural networks
• Provably efficient machine learning for quantum many-body problems
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Barren Plateaus in Variational Quantum Computing
• Noise Resilience of Variational Quantum Compiling
• Review of Decoherence Free Subspaces, Noiseless Subsystems, and Dynamical Decoupling
• Preparing random states and benchmarking with many-body quantum chaos
• Fermionic partial tomography via classical shadows
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Qibo: a framework for quantum simulation with hardware acceleration
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Exact emergent quantum state designs from quantum chaotic dynamics
• Random matrix techniques in quantum information theory
• Expressibility of the alternating layered ansatz for quantum computation
• Random Quantum Operations
• Convergence rates for arbitrary statistical moments of random quantum circuits
• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Dynamical purification and the emergence of quantum state designs from the projected ensemble
• Efficient unitary designs with nearly time-independent Hamiltonian dynamics
• Random quantum channels I: graphical calculus and the Bell state phenomenon
• The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
• Generating random quantum channels
• Quantum scrambling with classical shadows
• Shadow process tomography of quantum channels
• Noise-assisted digital quantum simulation of open systems
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
• Jucys-Murphy elements and Weingarten matrices
• On contraction coefficients, partial orders and approximation of capacities for quantum channels
• Quantum simulation with just-in-time compilation
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows
• Efficient estimation of trainability for variational quantum circuits
• Computing exact moments of local random quantum circuits via tensor networks
• Quantum neural networks form Gaussian processes
• Efficient unitary designs and pseudorandom unitaries from permutations
• Efficient Unitary T-designs from Random Sums
• Unitary k-designs from random number-conserving quantum circuits
• Approximate orthogonality of permutation operators, with application to quantum information
• Non-Haar random circuits form unitary designs as fast as Haar random circuits
• More buck-per-shot: Why learning trumps mitigation in noisy quantum sensing
• Architectures and random properties of symplectic quantum circuits
• Exact spectral gaps of random one-dimensional quantum circuits