Early fault-tolerant simulations of the Hubbard model

Abstract

Simulation of the Hubbard model is a leading candidate for the first useful applications of a fault-tolerant quantum computer. A recent study of quantum algorithms for early simulations of the Hubbard model [Kivlichan \textit{et al.} Quantum 4 296 (2019)] found that the lowest resource costs were achieved by split-operator Trotterization combined with the fast-fermionic Fourier transform (FFFT) on an $L\times L$ lattice with length $L=2^k$. On lattices with length $L\ne 2^k$, Givens rotations can be used instead of the FFFT but lead to considerably higher resource costs. We present a new analytic approach to bounding the simulation error due to Trotterization that provides much tighter bounds for the split-operator FFFT method, leading to $16\times$ improvement in error bounds. Furthermore, we introduce plaquette Trotterization that works on any size lattice and apply our improved error bound analysis to show competitive resource costs. We consider a phase estimation task and show plaquette Trotterization reduces the number of non-Clifford gates by a factor $5.5\times$ to $9\times$ (depending on the parameter regime) over the best previous estimates for $8\times 8$ and $16\times 16$ lattices and a much larger factor for other lattice sizes not of the form $L=2^k$. In conclusion, we find there is a potentially useful application for fault-tolerant quantum computers using around one million Toffoli gates.

arXiv commentSome typos corrected since V1 with gate counts slightly adjusted. V2 more polished. V4 small typoes fixed (see App E) with thanks to Sam McArdle and Mark Steudtner for detailed questions on this section

References in corpus (35)

• Quantum computational chemistry
• Hamiltonian Simulation by Qubitization
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Towards Practical Quantum Variational Algorithms
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Stripe order in the underdoped region of the two-dimensional Hubbard model
• Toward the first quantum simulation with quantum speedup
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• A random compiler for fast Hamiltonian simulation
• Gate count estimates for performing quantum chemistry on small quantum computers
• Building a fault-tolerant quantum computer using concatenated cat codes
• Halving the cost of quantum addition
• Novel constructions for the fault-tolerant Toffoli gate
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Quantum circuits for strongly correlated quantum systems
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Quantum algorithms to simulate many-body physics of correlated fermions
• Quantum computation with realistic magic state factories
• Efficient synthesis of universal Repeat-Until-Success circuits
• 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
• Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
• Lower bounds on the non-Clifford resources for quantum computations
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Applying quantum algorithms to constraint satisfaction problems
• Efficient synthesis of probabilistic quantum circuits with fallback
• Compilation by stochastic Hamiltonian sparsification
• Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries

Cited by in corpus (18)

• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• A randomized quantum algorithm for statistical phase estimation
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Parallel window decoding enables scalable fault tolerant quantum computation
• Purification-based quantum error mitigation of pair-correlated electron simulations
• Nearly tight Trotterization of interacting electrons
• Optimizing resource efficiencies for scalable full-stack quantum computers
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
• Hunting for quantum-classical crossover in condensed matter problems
• Quantum Computation for Periodic Solids in Second Quantization
• Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Quantum computing quantum Monte Carlo algorithm
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation
• Some Error Analysis for the Quantum Phase Estimation Algorithms