Fault-tolerant quantum algorithms for quantum molecular systems: A survey

Abstract

Solving quantum molecular systems presents a significant challenge for classical computation. The advent of early fault-tolerant quantum computing (EFTQC) devices offers a promising avenue to address these challenges, leveraging advanced quantum algorithms with reduced hardware requirements. This review surveys the latest developments in EFTQC and fully fault-tolerant quantum computing (FFTQC) algorithms for quantum molecular systems, covering encoding schemes, advanced Hamiltonian simulation techniques, and ground-state energy estimation methods. We highlight recent progress in overcoming practical barriers, such as reducing circuit depth and minimizing the use of ancillary qubits. Special attention is given to the potential quantum advantages achievable through these algorithms, as well as the limitations imposed by dequantization and classical simulation techniques. The review concludes with a discussion of future directions, emphasizing the need for optimized algorithms and experimental validation to bridge the gap between theoretical developments and practical implementation in EFTQC and FFTQC for quantum molecular systems.

28 pages, 1 figure

References in corpus (208)

• Adam: A Method for Stochastic Optimization
• 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
• The density-matrix renormalization group in the age of matrix product states
• The density-matrix renormalization group
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Electronic Structure Calculations with Dynamical Mean-Field Theory: A Spectral Density Functional Approach
• Quantum metrology
• Quantum computational advantage using photons
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Solving the Quantum Many-Body Problem with Artificial Neural Networks
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Adiabatic Quantum Computing
• Quantum Chemistry in the Age of Quantum Computing
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Strong quantum computational advantage using a superconducting quantum processor
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• An Area Law for One Dimensional Quantum Systems
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Hamiltonian Simulation by Qubitization
• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Scalable Quantum Simulation of Molecular Energies
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Quantum error correction below the surface code threshold
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Tensor networks for complex quantum systems
• Toward the first quantum simulation with quantum speedup
• Density matrix embedding: A simple alternative to dynamical mean-field theory
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Hybrid quantum-classical algorithms and quantum error mitigation
• Heat-bath Configuration Interaction: An efficient selected CI algorithm inspired by heat-bath sampling
• A Theory of Trotter Error
• Solutions of the Two Dimensional Hubbard Model: Benchmarks and Results from a Wide Range of Numerical Algorithms
• High-threshold and low-overhead fault-tolerant quantum memory
• Training variational quantum algorithms is NP-hard
• Quasi-adiabatic Continuation of Quantum States: The Stability of Topological Ground State Degeneracy and Emergent Gauge Invariance
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Restricted-Boltzmann-Machine Learning for Solving Strongly Correlated Quantum Systems
• The Density Matrix Renormalization Group in Chemistry and Molecular Physics: Recent Developments and New Challenges
• The computational complexity of PEPS
• The density matrix renormalization group for ab initio quantum chemistry
• Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
• Gate count estimates for performing quantum chemistry on small quantum computers
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• A practical guide to density matrix embedding theory in quantum chemistry
• Simulating quantum many-body dynamics on a current digital quantum computer
• A spin-adapted Density Matrix Renormalization Group algorithm for quantum chemistry
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• The General Quantum Interference Principle and the Duality Computer
• Low Depth Quantum Simulation of Electronic Structure
• Quantum computing enhanced computational catalysis
• Digital quantum simulation of spin models with circuit quantum electrodynamics
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Symmetries and many-body excited states with neural-network quantum states
• Variational quantum simulation of general processes
• A quantum-inspired classical algorithm for recommendation systems
• From transistor to trapped-ion computers for quantum chemistry
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Exponential improvement in precision for simulating sparse Hamiltonians
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
• Backflow Transformations via Neural Networks for Quantum Many-Body Wave-Functions
• Near-optimal ground state preparation
• Faster quantum simulation by randomization
• Fundamental limits of quantum error mitigation
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Ab initio computations of molecular systems by the auxiliary-field quantum Monte Carlo method
• Efficient phase-factor evaluation in quantum signal processing
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• The methodology of resonant equiangular composite quantum gates
• A Non-Orthogonal Variational Quantum Eigensolver
• Latent Space Purification via Neural Density Operators
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
• Quantum localization bounds Trotter errors in digital quantum simulation
• Adaptive Variational Quantum Dynamics Simulations
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Measurement reduction in variational quantum algorithms
• Quantum Approximate Counting, Simplified
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Optimizing quantum optimization algorithms via faster quantum gradient computation
• Electronic landscape of the P-cluster of nitrogenase as revealed through many-electron quantum wavefunctions
• Solving frustrated quantum many-particle models with convolutional neural networks
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Early Fault-Tolerant Quantum Computing
• Operator Locality in Quantum Simulation of Fermionic Models
• Fermionic Wave Functions from Neural-Network Constrained Hidden States
• Simulating adiabatic evolution of gapped spin systems
• A randomized quantum algorithm for statistical phase estimation
• Hamiltonian simulation in the low-energy subspace
• Simulating Quantum Dynamics On A Quantum Computer
• Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
• Finite temperature quantum embedding theories for correlated systems
• Product Decomposition of Periodic Functions in Quantum Signal Processing
• One qubit as a Universal Approximant
• Systematic electronic structure in the cuprate parent state from quantum many-body simulations
• Towards a Larger Molecular Simulation on the Quantum Computer: Up to 28 Qubits Systems Accelerated by Point Group Symmetry
• Rapid adiabatic preparation of injective PEPS and Gibbs states
• Experimental quantum state measurement with classical shadows
• Rigorous RG algorithms and area laws for low energy eigenstates in 1D
• Experimental quantum computational chemistry with optimised unitary coupled cluster ansatz
• Toward Practical Quantum Embedding Simulation of Realistic Chemical Systems on Near-term Quantum Computers
• Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
• Single-ancilla ground state preparation via Lindbladians
• Nearly tight Trotterization of interacting electrons
• Towards near-term quantum simulation of materials
• Classical algorithms for quantum mean values
• Systematic improvability in quantum embedding for real materials
• On the energy landscape of symmetric quantum signal processing
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Contracting projected entangled pair states is average-case hard
• Hamiltonian Simulation in the Interaction Picture
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Hamiltonian simulation with random inputs
• Dynamical mean field theory algorithm and experiment on quantum computers
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Initial state preparation for quantum chemistry on quantum computers
• On low-depth algorithms for quantum phase estimation
• Entanglement area law in superfluid ${}^4$He
• An area law for 2D frustration-free spin systems
• Hunting for quantum-classical crossover in condensed matter problems
• Spectral Gap Amplification
• Classical simulation of short-time quantum dynamics
• A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory
• First-Order Trotter Error from a Second-Order Perspective
• Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Heisenberg-limited quantum phase estimation of multiple eigenvalues with few control qubits
• Finding Angles for Quantum Signal Processing with Machine Precision
• Quantum state restoration and single-copy tomography
• Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits
• Ab initio Quantum Simulation of Strongly Correlated Materials with Quantum Embedding
• Variational Monte Carlo with Large Patched Transformers
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Perturbative quantum simulation
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion
• Quantum Phase Processing and its Applications in Estimating Phase and Entropies
• Strong Error Bounds for Trotter & Strang-Splittings and Their Implications for Quantum Chemistry
• Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
• Low-depth Hamiltonian Simulation by Adaptive Product Formula
• Towards a variational Jordan-Lee-Preskill quantum algorithm
• Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
• Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
• Circuit complexity of quantum access models for encoding classical data
• Importance sampling for stochastic quantum simulations
• Gaussian Process States: A data-driven representation of quantum many-body physics
• Power and limitations of single-qubit native quantum neural networks
• Commutative version of the k-local Hamiltonian problem and common eigenspace problem
• Average-case Speedup for Product Formulas
• Optimal Hamiltonian simulation for time-periodic systems
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
• Universal quantum algorithmic cooling on a quantum computer
• On preparing ground states of gapped Hamiltonians: An efficient Quantum Lovász Local Lemma
• Hamiltonian simulation for low-energy states with optimal time dependence
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Probing spectral features of quantum many-body systems with quantum simulators
• Algorithmic Cluster Expansions for Quantum Problems
• Novel Trotter formulas for digital quantum simulation
• Quantum Algorithms for Ground-State Preparation and Green's Function Calculation
• Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
• Dissipative ground state preparation and the Dissipative Quantum Eigensolver
• Tight Bounds for Quantum Phase Estimation and Related Problems
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
• Nearly-frustration-free ground state preparation
• On the Complexity of Two Dimensional Commuting Local Hamiltonians
• Fourier-based quantum signal processing
• Circuit-to-Hamiltonian from tensor networks and fault tolerance
• Towards quantum-centric simulations of extended molecules: sample-based quantum diagonalization enhanced with density matrix embedding theory
• Commuting Local Hamiltonian Problem on 2D beyond qubits
• A case study against QSVT: assessment of quantum phase estimation improved by signal processing techniques
• Ground state preparation with shallow variational warm-start
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Commuting Local Hamiltonians Beyond 2D
• Compilation of Trotter-Based Time Evolution for Partially Fault-Tolerant Quantum Computing Architecture
• Optimal Coherent Quantum Phase Estimation via Tapering
• Practical quantum advantage on partially fault-tolerant quantum computer
• Towards Accurate Quantum Chemical Calculations on Noisy Quantum Computers
• Observable-Driven Speed-ups in Quantum Simulations
• Classical Algorithms for Hamiltonian Dynamics Mean Value and Guided Local Hamiltonian Problem
• A Dequantized Algorithm for the Guided Local Hamiltonian Problem
• Purification and correction of quantum channels by commutation-derived quantum filters
• Quantum Measurement for Quantum Chemistry on a Quantum Computer
• Unbiased random circuit compiler for time-dependent Hamiltonian simulation

Cited by in corpus (6)

• A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits
• Variational quantum computing for quantum simulation: principles, implementations, and challenges
• Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• Rovibrational energy levels of H${}_2$O by quantum computing
• A penalty-free quantum algorithm to find energy eigenstates