Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial

Abstract

The Haar measure plays a vital role in quantum information, but its study often requires a deep understanding of representation theory, posing a challenge for beginners. This tutorial aims to provide a basic introduction to Haar measure tools in quantum information, utilizing only basic knowledge of linear algebra and thus aiming to make this topic more accessible. The tutorial begins by introducing the Haar measure with a specific emphasis on characterizing the moment operator, an essential element for computing integrals over the Haar measure. It also covers properties of the symmetric subspace and introduces helpful tools like tensor network diagrammatic notation, which aid in visualizing and simplifying calculations. Next, the tutorial explores the concept of unitary designs, providing equivalent definitions, and subsequently explores approximate notions of unitary designs, shedding light on the relationships between these different notions. Practical examples of Haar measure calculations are illustrated, including the derivation of well-known formulas such as the twirling of a quantum channel. Lastly, the tutorial showcases the applications of Haar measure calculations in quantum machine learning and classical shadow tomography.

arXiv comment44 pages, comments are welcome

References in corpus (70)

• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Average Entropy of a Subsystem
• Improved Simulation of Stabilizer Circuits
• On the volume of the set of mixed entangled states
• Black holes as mirrors: quantum information in random subsystems
• Predicting Many Properties of a Quantum System from Very Few Measurements
• The foundations of statistical mechanics from entanglement: Individual states vs. averages
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Measurement-Induced Phase Transitions in the Dynamics of Entanglement
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Scalable Noise Estimation with Random Unitary Operators
• Instantaneous non-local computation of low T-depth quantum circuits
• The Heisenberg Representation of Quantum Computers
• Random Quantum Circuits
• Chaos and complexity by design
• Induced measures in the space of mixed quantum states
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• The randomized measurement toolbox
• Evenly distributed unitaries: on the structure of unitary designs
• Aspects of generic entanglement
• Quantum Data Hiding
• Random Quantum Circuits are Approximate 2-designs
• Mixed-state entanglement from local randomized measurements
• Local random quantum circuits are approximate polynomial-designs
• Solution of a minimal model for many-body quantum chaos
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• The mother of all protocols: Restructuring quantum information's family tree
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Superdense coding of quantum states
• Exploiting symmetry in variational quantum machine learning
• Multiqubit Clifford groups are unitary 3-designs
• Sample-optimal tomography of quantum states
• Group-Invariant Quantum Machine Learning
• Linear growth of quantum circuit complexity
• Computational advantage of quantum random sampling
• Theory of quantum system certification: a tutorial
• A general framework for randomized benchmarking
• The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Models of quantum complexity growth
• Unitary designs and codes
• Classical Shadows With Noise
• Moments and Cumulants of Polynomial random variables on unitary groups, the Itzykson-Zuber integral and free probability
• Classical Shadow Tomography with Locally Scrambled Quantum Dynamics
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Matchgate Shadows for Fermionic Quantum Simulation
• How to efficiently select an arbitrary Clifford group element
• The Church of the Symmetric Subspace
• Large Deviation Bounds for k-designs
• Anticoncentration theorems for schemes showing a quantum speedup
• The Clifford group fails gracefully to be a unitary 4-design
• Entanglement, quantum randomness, and complexity beyond scrambling
• Mixing properties of stochastic quantum Hamiltonians
• From estimation of quantum probabilities to simulation of quantum circuits
• Classical shadows with Pauli-invariant unitary ensembles
• Non-malleable encryption of quantum information
• Quantum supremacy and random circuits
• Matrix integrals over unitary groups: An application of Schur-Weyl duality
• Stability of Periodically Driven Topological Phases against Disorder
• Density of States of Quantum Spin Systems from Isotropic Entanglement
• Noise-induced shallow circuits and absence of barren plateaus
• Efficient quantum tomography
• Complexity Classification of Conjugated Clifford Circuits
• Quantifying the barren plateau phenomenon for a model of unstructured variational ansätze
• Characterization of Quantum Entangled States and Information Measures

Cited by in corpus (94)

• Barren Plateaus in Variational Quantum Computing
• Quantum Dynamics in Krylov Space: Methods and Applications
• Does provable absence of barren plateaus imply classical simulability?
• Magic spreading in random quantum circuits
• Learning quantum states and unitaries of bounded gate complexity
• Variational quantum simulation: a case study for understanding warm starts
• Magic Resources of the Heisenberg Picture
• Classically estimating observables of noiseless quantum circuits
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Computing exact moments of local random quantum circuits via tensor networks
• Fock-space delocalization and the emergence of the Porter-Thomas distribution from dual-unitary dynamics
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
• Entanglement and Stabilizer entropies of random bipartite pure quantum states
• Zero-temperature entanglement membranes in quantum circuits
• Anticoncentration and state design of random tensor networks
• Accelerating Quantum Relaxation via Temporary Reset: A Mpemba-Inspired Approach
• Deep thermalization under charge-conserving quantum dynamics
• Constrained and Vanishing Expressivity of Quantum Fourier Models
• Long-range nonstabilizerness and phases of matter
• Noise-induced shallow circuits and absence of barren plateaus
• Hilbert-Space Ergodicity in Driven Quantum Systems: Obstructions and Designs
• Bridging Entanglement and Magic Resources within Operator Space
• Approximate Unitary $k$-Designs from Shallow, Low-Communication Circuits
• Accelerating quantum imaginary-time evolution with random measurements
• Fermionic Magic Resources of Quantum Many-Body Systems
• Adversarial Robustness Guarantees for Quantum Classifiers
• Minimal Areas from Entangled Matrices
• Disentangling magic states with classically simulable quantum circuits
• Simulating quantum circuits with arbitrary local noise using Pauli Propagation
• Metrological usefulness of entanglement and nonlinear Hamiltonians
• Hands-on Introduction to Randomized Benchmarking
• Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks
• A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements
• Non-Haar random circuits form unitary designs as fast as Haar random circuits
• Breaking global symmetries with locality-preserving operations
• Linear gate bounds against natural functions for position-verification
• Sample Complexity of Black Box Work Extraction
• Random Circuits in the Black Hole Interior
• From dynamical to steady-state many-body metrology: Precision limits and their attainability with two-body interactions
• Exact spectral gaps of random one-dimensional quantum circuits
• Learning unitaries with quantum statistical queries
• Retrieving maximum information of symmetric states from their corrupted copies
• Architectures and random properties of symplectic quantum circuits
• Learning Quantum Processes with Quantum Statistical Queries
• Rise and fall of nonstabilizerness via random measurements
• Real randomized measurements for analyzing properties of quantum states
• Fidelity decay and error accumulation in random quantum circuits
• Bath Dynamical Decoupling with a Quantum Channel
• Magic of discrete lattice gauge theories
• Robust Control and Entanglement of Qudits in Neutral Atom Arrays
• Analyzing the free states of one quantum resource theory as resource states of another
• Path superposition activating perfect quantum teleportation ability for separable states
• Unitary Transformations using Robust Optimal Control on a Cold Atom Qudit
• Highly-entangled, highly-doped states that are efficiently cross-device verifiable
• Electrical Interconnects for Silicon Spin Qubits
• Expressibility, entangling power and quantum average causal effect for causally indefinite circuits
• Nearly query-optimal classical shadow estimation of unitary channels
• Agnostic Process Tomography
• Benchmarking the performance of a high-Q cavity qudit using random unitaries
• Deep Neural Network-assisted improvement of quantum compressed sensing tomography
• Local measurement strategies for multipartite entanglement quantification
• A quantum tug of war between randomness and symmetries on homogeneous spaces
• Detecting high-dimensional entanglement by randomized product projections
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States
• Conserved operators and exact conditions for pair condensation
• Weighted Approximate Quantum Natural Gradient for Variational Quantum Eigensolver
• Quantum Advantage in Storage and Retrieval of Isometry Channels
• Exploiting many-body localization for scalable variational quantum simulation
• Superoperator master equations for depolarizing dynamics
• Optimal quantum reservoir learning in proximity to universality
• Universal tester for multiple independence testing and classical-quantum arbitrarily varying multiple access channel
• Experimental measurement and a physical interpretation of quantum shadow enumerators
• Localizing multipartite entanglement with local and global measurements
• Entanglement structure for finite system under dual-unitary dynamics
• Simple Diagonal State Designs with Reconfigurable Real-Time Circuits
• Witness wedges in fidelity-deviation plane: separating teleportation advantage and Bell-inequality violation
• Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms
• Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
• Dynamical irreversibility and local decoherence in quantum many-body chaos
• Van Hove singularities in stabilizer entropy densities
• Linear-optical protocols for mitigating and suppressing noise in bosonic systems
• Spectral properties and coding transitions of Haar-random quantum codes
• Blind-spots of Randomized Benchmarking Under Temporal Correlations
• Realizing Unitary $k$-designs with a Single Quench
• A graph-theoretic approach to chaos and complexity in quantum systems
• Limits of Clifford Disentangling in Tensor Network States
• Moments of Quantum Channel Ensembles
• Measuring Incompatible Observables with Quantum Neural Networks
• Characterizing quantum dynamics using multipartite entanglement generation
• Approaching the Multiparameter Quantum Cramér-Rao Bound via Classical Correlation and Entangling Measurements
• Optimal randomized measurements for a family of non-linear quantum properties
• A Spectral Lower Bound on Chromatic Numbers using $p$-Energy
• High-expressibility Quantum Neural Networks using only classical resources