Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization

Abstract

Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized implementations of Trotter-Suzuki-based product formulas. We show that low-order Trotter methods perform surprisingly well when used with phase estimation to compute relative precision quantities (e.g. energies per unit cell), as is often the goal for condensed-phase systems. In this context, simulations of the Hubbard and plane-wave electronic structure models with $N<10^5$ fermionic modes can be performed with roughly $O(1)$ and $O(N^2)$ T complexities. We perform numerics revealing tradeoffs between the error and gate complexity of a Trotter step; e.g., we show that split-operator techniques have less Trotter error than popular alternatives. By compiling to surface code fault-tolerant gates and assuming error rates of one part per thousand, we show that one can error-correct quantum simulations of interesting, classically intractable instances with a few hundred thousand physical qubits.

arXiv comment45 pages, 15 figures. Only difference from v3 is change to CC BY 4.0 license

References in corpus (63)

• Surface codes: Towards practical large-scale quantum computation
• Simulated Quantum Computation of Molecular Energies
• Fermionic quantum computation
• Hamiltonian Simulation by Qubitization
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Towards Practical Quantum Variational Algorithms
• Entanglement-free Heisenberg-limited phase estimation
• Surface code quantum computing by lattice surgery
• Toward the first quantum simulation with quantum speedup
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Solutions of the Two Dimensional Hubbard Model: Benchmarks and Results from a Wide Range of Numerical Algorithms
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Simulating Physical Phenomena by Quantum Networks
• A random compiler for fast Hamiltonian simulation
• Quantum Algorithms for Fermionic Simulations
• Gate count estimates for performing quantum chemistry on small quantum computers
• Solving strongly correlated electron models on a quantum computer
• Halving the cost of quantum addition
• Low Depth Quantum Simulation of Electronic Structure
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Efficient Bayesian Phase Estimation
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• How to perform the most accurate possible phase measurements
• Tapering off qubits to simulate fermionic Hamiltonians
• Nearly optimal lattice simulation by product formulas
• Faster quantum simulation by randomization
• Quantum circuits for strongly correlated quantum systems
• Quantum algorithms to simulate many-body physics of correlated fermions
• A Full Configuration Interaction Perspective on the Homogeneous Electron Gas
• Efficient synthesis of universal Repeat-Until-Success circuits
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
• Exploiting locality in quantum computation for quantum chemistry
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Improved energy extrapolation with infinite projected entangled-pair states applied to the 2D Hubbard model
• Operator Locality in Quantum Simulation of Fermionic Models
• Many-body quantum chemistry for the electron gas: convergent perturbative theories
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• Spectral Functions of the Uniform Electron Gas via Coupled-Cluster Theory and Comparison to the $GW$ and Related Approximations
• Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
• Locality and digital quantum simulation of power-law interactions
• Local spin operators for fermion simulations
• Quantum Simulation of the Sachdev-Ye-Kitaev Model by Asymmetric Qubitization
• Pebble Games, Proof Complexity, and Time-Space Trade-offs
• Bounding the costs of quantum simulation of many-body physics in real space
• Spectral tensor networks for many-body localization
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Fourier transform of fermionic systems and the spectral tensor network
• Range Separated Brueckner Coupled Cluster Doubles Theory
• Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem
• Optimal complexity correction of correlated errors in the surface code
• Hybrid grid/basis set discretizations of the Schrödinger equation
• Linear and logarithmic time compositions of quantum many-body operators

Cited by in corpus (112)

• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Suppressing quantum errors by scaling a surface code logical qubit
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum algorithms for quantum chemistry and quantum materials science
• Quantum error correction below the surface code threshold
• Quantum Error Mitigation
• A Theory of Trotter Error
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Building a fault-tolerant quantum computer using concatenated cat codes
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Low rank representations for quantum simulation of electronic structure
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Quantum Computing for Neutrino-nucleus Scattering
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• A randomized quantum algorithm for statistical phase estimation
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Early fault-tolerant simulations of the Hubbard model
• Parallel window decoding enables scalable fault tolerant quantum computation
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
• How will quantum computers provide an industrially relevant computational advantage in quantum chemistry?
• Towards near-term quantum simulation of materials
• Nearly tight Trotterization of interacting electrons
• Logical blocks for fault-tolerant topological quantum computation
• Simulating periodic systems on quantum computer
• Efficient quantum computation of molecular forces and other energy gradients
• Optimizing resource efficiencies for scalable full-stack quantum computers
• Compilation by stochastic Hamiltonian sparsification
• Toward Quantum Simulations of ${\mathbb{Z}}_2$ Gauge Theory Without State Preparation
• A universal neutral-atom quantum computer with individual optical addressing and non-destructive readout
• Simulating the electronic structure of spin defects on quantum computers
• Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
• Hunting for quantum-classical crossover in condensed matter problems
• First-Order Trotter Error from a Second-Order Perspective
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis
• Preparing Bethe Ansatz Eigenstates on a Quantum Computer
• Real-time quantum calculations of phase shifts using wave packet time delays
• Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
• Quantum Computation for Periodic Solids in Second Quantization
• Quantum advantage for computations with limited space
• On the complexity of implementing Trotter steps
• Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
• Enhancing quantum utility: simulating large-scale quantum spin chains on superconducting quantum computers
• Resource estimate for quantum many-body ground-state preparation on a quantum computer
• Approximating the quantum approximate optimization algorithm with digital-analog interactions
• Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization
• Pipelined correlated minimum weight perfect matching of the surface code
• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
• Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Quantum algorithms for scientific computing
• Quantum computation of molecular structure using data from challenging-to-classically-simulate nuclear magnetic resonance experiments
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation
• Quantum Simulation of the N flavor Gross-Neveu Model
• ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
• Resource estimations for the Hamiltonian simulation in correlated electron materials
• Compilation of a simple chemistry application to quantum error correction primitives
• LILLIPUT: A Lightweight Low-Latency Lookup-Table Based Decoder for Near-term Quantum Error Correction
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Mitigating Errors on Superconducting Quantum Processors through Fuzzy Clustering
• Solving reaction dynamics with quantum computing algorithms
• Scalable simulation of non-equilibrium quantum dynamics via classically optimised unitary circuits
• Quantifying fermionic nonlinearity of quantum circuits
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Polynomial Equivalence of Complexity Geometries
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
• Preserving phase coherence and linearity in cat qubits with exponential bit-flip suppression
• TE-PAI: Exact Time Evolution by Sampling Random Circuits
• Quantum computing quantum Monte Carlo algorithm
• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• Universal quantum control with dynamical correction
• Ladder Operator Block-Encoding
• Optimize quantum simulation using a force-gradient integrator
• Trotter simulation of vibrational Hamiltonians on a quantum computer
• Optimal compression of constrained quantum time evolution
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Some Error Analysis for the Quantum Phase Estimation Algorithms
• Capturing the Page Curve and Entanglement Dynamics of Black Holes in Quantum Computers
• Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
• Phase estimation with partially randomized time evolution
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Universal quantum control over Majorana zero modes
• Fault-tolerant quantum simulation of generalized Hubbard models
• Walsh-Floquet Theory of Periodic Kick Drives
• A Jordan-Wigner gadget that reduces T count by more than 6x for quantum chemistry applications
• Error Crafting in Mixed Quantum Gate Synthesis
• Trotter error time scaling separation via commutant decomposition
• High-fidelity initialization a logical qubit with multiple injections
• Quantum Utility in Simulating the Real-time Dynamics of the Fermi-Hubbard Model using Superconducting Quantum Computers
• Quantum Simulation of Nuclear Dynamics in First Quantization
• Quantum Computation
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Chemistry and Finite Difference Method
• Chemistry beyond the Hartree-Fock limit via quantum computed moments
• Tensor-based phase difference estimation on time series analysis
• Novel permanent magnet array geometries for scalable trapped-ion quantum computing in a laser-free entanglement architecture
• Vertex Lattice Models Simulated with Quantum Circuits
• Comparison of spin-qubit architectures for quantum error-correcting codes