Fermionic partial tomography via classical shadows

Abstract

We propose a tomographic protocol for estimating any $k$-body reduced density matrix ($k$-RDM) of an $n$-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all $k$-RDM elements to additive precision $\epsilon$ requires on the order of $\left(\genfrac{}{}{0ex}{}{n}{k}\right)k^{3/2}\log (n)/{\epsilon }^2$ repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for $k\ge 2$, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2-5 times more repetitions.

arXiv comment5+26 pages, 5 figures, 1 table. The SM has been revised to replace an incorrect variance expression for arbitrary observables with an upper bound instead. The results presented in the main text are unaffected by this revision

References in corpus (78)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• Improved Simulation of Stabilizer Circuits
• Simulated Quantum Computation of Molecular Energies
• Predicting Many Properties of a Quantum System from Very Few Measurements
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Fermionic quantum computation
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Hartree-Fock on a superconducting qubit quantum computer
• Towards Practical Quantum Variational Algorithms
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Instantaneous non-local computation of low T-depth quantum circuits
• The Heisenberg Representation of Quantum Computers
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Robust determination of molecular spectra on a quantum processor
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Simulating Physical Phenomena by Quantum Networks
• Classical simulation of noninteracting-fermion quantum circuits
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Solving strongly correlated electron models on a quantum computer
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Low Depth Quantum Simulation of Electronic Structure
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Error-mitigated digital quantum simulation
• Low-cost error mitigation by symmetry verification
• Accelerated Variational Quantum Eigensolver
• Stochastic gradient descent for hybrid quantum-classical optimization
• Matchgates and classical simulation of quantum circuits
• Efficient estimation of Pauli observables by derandomization
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Quantum algorithms to simulate many-body physics of correlated fermions
• Mutually unbiased binary observable sets on N qubits
• A Non-Orthogonal Variational Quantum Eigensolver
• Quantum Overlapping Tomography
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Exploiting locality in quantum computation for quantum chemistry
• Error Mitigation by Symmetry Verification on a Variational Quantum Eigensolver
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
• Measurement reduction in variational quantum algorithms
• More Realistic Hamiltonians for the Fractional Quantum Hall Regime in GaAs and Graphene
• Lowering qubit requirements for quantum simulations of fermionic systems
• Operator Locality in Quantum Simulation of Fermionic Models
• Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
• Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
• Matchgate Shadows for Fermionic Quantum Simulation
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Minimizing estimation runtime on noisy quantum computers
• Fermionic Linear Optics and Matchgates
• Precise measurement of quantum observables with neural-network estimators
• Efficient evaluation of quantum observables using entangled measurements
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
• Using models to improve optimizers for variational quantum algorithms
• Reduced Density Matrix Sampling: Self-consistent Embedding and Multiscale Electronic Structure on Current Generation Quantum Computers
• Measurement cost of metric-aware variational quantum algorithms
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Chemistry on quantum computers with virtual quantum subspace expansion
• Fermionic Linear Optics Revisited
• Finite tight frames and some applications
• Decision Diagrams for Quantum Measurements with Shallow Circuits
• Operator Sampling for Shot-frugal Optimization in Variational Algorithms
• Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
• Pauli Partitioning with Respect to Gate Sets
• Adaptive Pauli Shadows for Energy Estimation
• Pairwise tomography networks for many-body quantum systems
• Estimating expectation values using approximate quantum states
• Online Learning of Quantum States
• Scalable Bayesian Hamiltonian learning
• Lowering Tomography Costs in Quantum Simulation with a Symmetry Projected Operator Basis
• Classical simulation of quantum circuits by dynamical localization: analytic results for Pauli-observable scrambling in time-dependent disorder
• Fermionic tomography and learning

Cited by in corpus (92)

• The Variational Quantum Eigensolver: a review of methods and best practices
• The randomized measurement toolbox
• Provably efficient machine learning for quantum many-body problems
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Classical Shadows With Noise
• Classical Shadow Tomography with Locally Scrambled Quantum Dynamics
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Matchgate Shadows for Fermionic Quantum Simulation
• Experimental quantum state measurement with classical shadows
• Variational Quantum Eigensolver with Reduced Circuit Complexity
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits
• Scalable and Flexible Classical Shadow Tomography with Tensor Networks
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Classical Shadows for Quantum Process Tomography on Near-term Quantum Computers
• Efficient quantum computation of molecular forces and other energy gradients
• Nearly Optimal Quantum Algorithm for Estimating Multiple Expectation Values
• Hamiltonian-Driven Shadow Tomography of Quantum States
• Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space
• Operator relaxation and the optimal depth of classical shadows
• Classical shadows with Pauli-invariant unitary ensembles
• Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver
• Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
• Quantum expectation-value estimation by computational basis sampling
• Thrifty shadow estimation: re-using quantum circuits and bounding tails
• Performance analysis of multi-shot shadow estimation
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Estimating gate-set properties from random sequences
• Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers
• Error-mitigated fermionic classical shadows on noisy quantum devices
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows
• Group-theoretic error mitigation enabled by classical shadows and symmetries
• Bootstrap Embedding on a Quantum Computer
• Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
• Chemically Aware Unitary Coupled Cluster with ab initio Calculations on System Model H1: A Refrigerant Chemicals Application
• Dual frame optimization for informationally complete quantum measurements
• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
• Accelerated variational quantum eigensolver with joint Bell measurement
• Quantum computation of molecular structure using data from challenging-to-classically-simulate nuclear magnetic resonance experiments
• Triply efficient shadow tomography
• Efficient Quantum Analytic Nuclear Gradients with Double Factorization
• Estimating Quantum Hamiltonians via Joint Measurements of Noisy Non-Commuting Observables
• Randomness-enhanced expressivity of quantum neural networks
• Fermionic correlation functions from randomized measurements in programmable atomic quantum devices
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Tailored and Externally Corrected Coupled Cluster with Quantum Inputs
• Learning fermionic correlations by evolving with random translationally invariant Hamiltonians
• Algorithmic Shadow Spectroscopy
• Improved simulation of quantum circuits dominated by free fermionic operations
• Free-fermion Page Curve: Canonical Typicality and Dynamical Emergence
• Randomized measurement protocols for lattice gauge theories
• Optimising quantum tomography via shadow inversion
• Efficient Local Classical Shadow Tomography with Number Conservation
• A hybrid quantum algorithm to detect conical intersections
• Quantum algorithms for generator coordinate methods
• Fermionic Magic Resources of Quantum Many-Body Systems
• Efficient Classical Shadow Tomography through Many-body Localization Dynamics
• Precision ground-state energy calculation for the water molecule on a superconducting quantum processor
• Coupled cluster method tailored with quantum computing
• Measuring energy by measuring any other observable
• Resource-efficient Direct Characterization of General Density Matrix
• Efficient measurement schemes for bosonic systems
• Simulating Chemistry with Fermionic Optical Superlattices
• Molecular Properties from Quantum Krylov Subspace Diagonalization
• Local quantum overlapping tomography
• Classical shadows meet quantum optimal mass transport
• A Simple and Efficient Joint Measurement Strategy for Estimating Fermionic Observables and Hamiltonians
• On the connection between least squares, regularization, and classical shadows
• Quantum Circuit Cutting for Classical Shadows
• Tomography of parametrized quantum states
• Adaptive measurement strategy for quantum subspace methods
• Biased Estimator Channels for Classical Shadows
• PAC-learning of free-fermionic states is NP-hard
• Approximating dynamical correlation functions with constant depth quantum circuits
• Holographic Classical Shadow Tomography
• Low variance estimations of many observables with tensor networks and informationally-complete measurements
• Quantum permutation puzzles with indistinguishable particles
• Quantum-Classical Auxiliary Field Quantum Monte Carlo with Matchgate Shadows on Trapped Ion Quantum Computers
• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
• Optimal Fermionic Joint Measurements for Estimating Non-Commuting Majorana Observables
• State preparation and evolution in quantum computing: a perspective from Hamiltonian moments
• Classical Shadows with Improved Median-of-Means Estimation
• Expanding the reach of quantum optimization with fermionic embeddings
• Quantum phase classification via partial tomography-based quantum hypothesis testing
• Faster Quantum Algorithm for Multiple Observables Estimation in Fermionic Problems
• Comprehensive Study on Heisenberg-limited Quantum Algorithms for Multiple Observables Estimation
• Refining ensemble $N$-representability of one-body density matrices from partial information
• Many-Fermion Simulation from the Contracted Quantum Eigensolver without Fermionic Encoding of the Wave Function
• Moments of Quantum Channel Ensembles
• Correlated Purification for Restoring $N$-Representability in Quantum Simulation
• Constrained Shadow Tomography for Molecular Simulation on Quantum Devices
• More global randomness from less-random local gates