Matchgate shadows for fermionic quantum simulation

DOI10.1007/S00220-023-04844-0arXiv2207.13723MaRDI QIDQ6089310FDOQ6089310

Authors: Kianna Wan, William J. Huggins, Joonho Lee, Ryan Babbush 

Publication date: 17 November 2023

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2207.13723

Recommendations

• Matchgates and classical simulation of quantum circuits
• Classical shadows meet quantum optimal mass transport
• Matchgate and space-bounded quantum computations are equivalent
• Measurements of quantum Hamiltonians with locally-biased classical shadows
• Fermionic linear optics revisited

Mathematics Subject Classification ID

Basic linear algebra (15Axx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Numerical linear algebra (65Fxx)

Cites Work

• How to generate random matrices from the classical compact groups
• Conformal field theory
• A Remark on Stirling's Formula
• The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
• Title not available (Why is that?)
• Clifford algebra to geometric calculus. A unified language for mathematics and physics
• Algorithm 923: Efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices
• Lagrangian representation for fermionic linear optics
• Algebraic/combinatorial proofs of Cayley-type identities for derivatives of determinants and Pfaffians
• Matchgates and classical simulation of quantum circuits
• Bounds for Kac's master equation
• Contraction of matchgate tensor networks on non-planar graphs
• Title not available (Why is that?)
• Hadamard-Free Circuits Expose the Structure of the Clifford Group
• Complexity of quantum impurity problems

Cited In (2)

• Classical shadows meet quantum optimal mass transport
• Matchgates and classical simulation of quantum circuits

This page was built for publication: Matchgate shadows for fermionic quantum simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089310)