Matchgate Shadows for Fermionic Quantum Simulation
arXiv:2207.13723 · doi:10.1007/s00220-023-04844-0
Abstract
"Classical shadows" are estimators of an unknown quantum state, constructed from suitably distributed random measurements on copies of that state [Nature Physics 16, 1050-1057]. Here, we analyze classical shadows obtained using random matchgate circuits, which correspond to fermionic Gaussian unitaries. We prove that the first three moments of the Haar distribution over the continuous group of matchgate circuits are equal to those of the discrete uniform distribution over only the matchgate circuits that are also Clifford unitaries; thus, the latter forms a "matchgate 3-design." This implies that the classical shadows resulting from the two ensembles are functionally equivalent. We show how one can use these matchgate shadows to efficiently estimate inner products between an arbitrary quantum state and fermionic Gaussian states, as well as the expectation values of local fermionic operators and various other quantities, thus surpassing the capabilities of prior work. As a concrete application, this enables us to apply wavefunction constraints that control the fermion sign problem in the quantum-classical auxiliary-field quantum Monte Carlo algorithm (QC-AFQMC) [Nature 603, 416-420], without the exponential post-processing cost incurred by the original approach.
56 pages, 1 figure; journal version
References in corpus (13)
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Matchgates and classical simulation of quantum circuits
- Multiqubit Clifford groups are unitary 3-designs
- Efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices
- Quantum algorithms to simulate many-body physics of correlated fermions
- Fermionic partial tomography via classical shadows
- Robust shadow estimation
- Hadamard-free circuits expose the structure of the Clifford group
- Complexity of quantum impurity problems
- Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
- Algebraic/combinatorial proofs of Cayley-type identities for derivatives of determinants and pfaffians
- Estimating expectation values using approximate quantum states
Cited by in corpus (56)
- Barren Plateaus in Variational Quantum Computing
- Fermionic partial tomography via classical shadows
- Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
- Does provable absence of barren plateaus imply classical simulability?
- Shadows of quantum machine learning
- Improved machine learning algorithm for predicting ground state properties
- Learnability transitions in monitored quantum dynamics via eavesdropper's classical shadows
- Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows
- Error-mitigated fermionic classical shadows on noisy quantum devices
- Group-theoretic error mitigation enabled by classical shadows and symmetries
- Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
- Dual frame optimization for informationally complete quantum measurements
- Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
- Classical shadows based on locally-entangled measurements
- Unbiasing Fermionic Auxiliary-Field Quantum Monte Carlo with Matrix Product State Trial Wavefunctions
- Triply efficient shadow tomography
- Efficient Quantum Analytic Nuclear Gradients with Double Factorization
- Randomness-enhanced expressivity of quantum neural networks
- Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
- Improved modularity and new features in ipie: Toward even larger AFQMC calculations on CPUs and GPUs at zero and finite temperatures
- Learning fermionic correlations by evolving with random translationally invariant Hamiltonians
- Tailored and Externally Corrected Coupled Cluster with Quantum Inputs
- Algorithmic Shadow Spectroscopy
- Improved simulation of quantum circuits dominated by free fermionic operations
- Randomized measurement protocols for lattice gauge theories
- Optimising quantum tomography via shadow inversion
- Stability of classical shadows under gate-dependent noise
- Fermionic Magic Resources of Quantum Many-Body Systems
- Efficient Classical Shadow Tomography through Many-body Localization Dynamics
- Coupled cluster method tailored with quantum computing
- Exponential learning advantages with conjugate states and minimal quantum memory
- FragPT2: Multi-Fragment Wavefunction Embedding with Perturbative Interactions
- Efficient measurement schemes for bosonic systems
- Learning Properties of Quantum States Without the I.I.D. Assumption
- Quantum topological data analysis via the estimation of the density of states
- Molecular Properties from Quantum Krylov Subspace Diagonalization
- Simulating Chemistry with Fermionic Optical Superlattices
- Quantum subspace expansion approach for simulating dynamical response functions of Kitaev spin liquids
- A Simple and Efficient Joint Measurement Strategy for Estimating Fermionic Observables and Hamiltonians
- Parallel-in-time quantum simulation via Page and Wootters quantum time
- Non-Haar random circuits form unitary designs as fast as Haar random circuits
- Architectures and random properties of symplectic quantum circuits
- A quantum computing approach to fixed-node Monte Carlo using classical shadows
- Biased Estimator Channels for Classical Shadows
- Analyzing the free states of one quantum resource theory as resource states of another
- Tomography of parametrized quantum states
- Holographic Classical Shadow Tomography
- PAC-learning of free-fermionic states is NP-hard
- Quantum-Classical Auxiliary Field Quantum Monte Carlo with Matchgate Shadows on Trapped Ion Quantum Computers
- Optimal Fermionic Joint Measurements for Estimating Non-Commuting Majorana Observables
- Classical Shadows with Improved Median-of-Means Estimation
- More global randomness from less-random local gates
- Fermionic Averaged Circuit Eigenvalue Sampling
- Enhancing quantum computations with the synergy of auxiliary field quantum Monte Carlo and computational basis tomography
- A graph-theoretic approach to chaos and complexity in quantum systems
- Comprehensive Study on Heisenberg-limited Quantum Algorithms for Multiple Observables Estimation