Application of fermionic marginal constraints to hybrid quantum algorithms

Abstract

Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most straightforward approach to this algorithmic step estimates each component of the marginal independently without making use of the algebraic and geometric structure of the marginals. Within the field of quantum chemistry, this structure is termed the fermionic $n$-representability conditions, and is supported by a vast amount of literature on both theoretical and practical results related to their approximations. In this work, we introduce these conditions in the language of quantum computation, and utilize them to develop several techniques to accelerate and improve practical applications for quantum chemistry on quantum computers. We show that one can use fermionic $n$-representability conditions to reduce the total number of measurements required by more than an order of magnitude for medium sized systems in chemistry. We also demonstrate an efficient restoration of the physicality of energy curves for the dilation of a four qubit diatomic hydrogen system in the presence of three distinct one qubit error channels, providing evidence these techniques are useful for pre-fault tolerant quantum chemistry experiments.

References in corpus (10)

• Simulated Quantum Computation of Molecular Energies
• Efficient quantum state tomography
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• A canonical transformation theory from extended normal ordering
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• Preparation of many-body states for quantum simulation
• Linear and logarithmic time compositions of quantum many-body operators

Cited by in corpus (94)

• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• The Variational Quantum Eigensolver: a review of methods and best practices
• Hartree-Fock on a superconducting qubit quantum computer
• Quantum Error Mitigation
• Variational Quantum Computation of Excited States
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Layerwise learning for quantum neural networks
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• $XY$-mixers: analytical and numerical results for QAOA
• 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
• Fermionic partial tomography via classical shadows
• A Non-Orthogonal Variational Quantum Eigensolver
• Error Mitigation by Symmetry Verification on a Variational Quantum Eigensolver
• Decoding quantum errors with subspace expansions
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Orbital optimized unitary coupled cluster theory for quantum computer
• Measurement reduction in variational quantum algorithms
• Performance comparison of optimization methods on variational quantum algorithms
• From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
• Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
• Variational Quantum Unsampling on a Quantum Photonic Processor
• Error mitigation via verified phase estimation
• Experimental quantum state measurement with classical shadows
• Efficient evaluation of quantum observables using entangled measurements
• Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
• Cartan sub-algebra approach to efficient measurements of quantum observables
• Quantum-classical hybrid algorithm using an error-mitigating $N$-representability condition to compute the Mott metal-insulator transition
• Penalty methods for variational quantum eigensolver
• Improving resilience of the Quantum Gravity Induced Entanglement of Masses (QGEM) to decoherence using 3 superpositions
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Quantum Analytic Descent
• Efficient quantum computation of molecular forces and other energy gradients
• Variational Quantum Algorithm for Non-equilibrium Steady States
• Resolving Correlated States of Benzyne on a Quantum Computer with an Error-Mitigated Quantum Contracted Eigenvalue Solver
• Variational quantum eigensolvers for sparse Hamiltonians
• Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation
• Adaptive estimation of quantum observables
• Noisy intermediate-scale quantum algorithm for semidefinite programming
• Quantum expectation-value estimation by computational basis sampling
• Improving the Accuracy of the Variational Quantum Eigensolver for Molecular Systems by the Explicitly-Correlated Perturbative [2]-R12-Correction
• Improving the accuracy and efficiency of quantum connected moments expansions
• Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers
• Error-mitigated fermionic classical shadows on noisy quantum devices
• Group-theoretic error mitigation enabled by classical shadows and symmetries
• Quantum simulation of excited states from parallel contracted quantum eigensolvers
• A systematic variational approach to band theory in a quantum computer
• Implementation of Measurement Reduction for the Variational Quantum Eigensolver
• Optimizing the information extracted by a single qubit measurement
• Quantum computation of molecular structure using data from challenging-to-classically-simulate nuclear magnetic resonance experiments
• Variational quantum solver employing the PDS energy functional
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Lowering Tomography Costs in Quantum Simulation with a Symmetry Projected Operator Basis
• Dynamic-ADAPT-QAOA: An algorithm with shallow and noise-resilient circuits
• An algorithm to explore entanglement in small systems
• Contextual Subspace Variational Quantum Eigensolver Calculation of the Dissociation Curve of Molecular Nitrogen on a Superconducting Quantum Computer
• Highly Accurate Real-space Electron Densities with Neural Networks
• Benchmarking Noisy Intermediate Scale Quantum Error Mitigation Strategies for Ground State Preparation of the HCl Molecule
• Unitary Partitioning and the Contextual Subspace Variational Quantum Eigensolver
• Simulation of a Diels-Alder Reaction on a Quantum Computer
• A hybrid quantum algorithm to detect conical intersections
• Quantum algorithms for generator coordinate methods
• Error-Mitigated Quantum Simulation of Interacting Fermions with Trapped Ions
• Practicality of quantum adiabatic algorithm for chemistry applications
• Hardware-efficient entangled measurements for variational quantum algorithms
• Precision ground-state energy calculation for the water molecule on a superconducting quantum processor
• SHARC-VQE: Simplified Hamiltonian Approach with Refinement and Correction enabled Variational Quantum Eigensolver for Molecular Simulation
• Characterizing and mitigating coherent errors in a trapped ion quantum processor using hidden inverses
• Ab initio extended Hubbard model of short polyenes for efficient quantum computing
• Efficient quantum-enhanced classical simulation for patches of quantum landscapes
• Local quantum overlapping tomography
• Solvent distribution effects on quantum chemical calculations with quantum computers
• Double-bracket algorithm for quantum signal processing without post-selection
• Minimal evolution times for fast, pulse-based state preparation in silicon spin qubits
• Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
• Quantum Simulation of Molecules without Fermionic Encoding of the Wave Function
• State preparation and evolution in quantum computing: a perspective from Hamiltonian moments
• Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training
• An Error Mitigated Non-Orthogonal Quantum Eigensolver via Shadow Tomography
• Geometric Constraints on Two-electron Reduced Density Matrices
• Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
• Correlated Purification for Restoring $N$-Representability in Quantum Simulation
• Is the matrix completion of reduced density matrices unique?
• Toward Density Functional Theory on Quantum Computers?
• Refining ensemble $N$-representability of one-body density matrices from partial information
• Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy
• A variational quantum eigensolver tailored to multi-band tight-binding simulations of electronic structures
• Noise-tailored Constructions for Spin Wigner Function Kernels