Efficient Quantum Cooling Algorithm for Fermionic Systems

Abstract

We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known ground state. We derive suitable interaction Hamiltonians that originate from ladder operators of the free theory and initiate resonant gaps between system and fridge. We further propose a spectroscopic scan to find the relevant eigenenergies of the system using energy measurements on the fridge. With these insights, we design a ground state cooling algorithm for fermionic systems that is efficient, i.e. its runtime is polynomial in the system size, as long as the initial state is prepared in a low-energy sector of polynomial size. We achieve the latter via a pseudo-adiabatic sweep from a parameter regime whose ground state can be easily prepared. We estimate that our algorithm has a polynomial runtime for systems where the spectral gap decreases at most polynomially in system size, and is faster than the adiabatic algorithm for a large range of settings. We generalize the algorithm to prepare thermal states and demonstrate our findings on the Fermi-Hubbard model.

14+11 pages, 5+6 figures

References in corpus (48)

• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Adiabatic Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Hartree-Fock on a superconducting qubit quantum computer
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum Computation by Adiabatic Evolution
• A Theory of Trotter Error
• Training variational quantum algorithms is NP-hard
• Thermalizing Quantum Machines: Dissipation and Entanglement
• Solving strongly correlated electron models on a quantum computer
• The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
• Adiabatic Theorem without a Gap Condition
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Quantum algorithms to simulate many-body physics of correlated fermions
• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• Stable Quantum-Correlated Many Body States through Engineered Dissipation
• Variational Quantum Boltzmann Machines
• Operator Locality in Quantum Simulation of Fermionic Models
• Preparation of matrix product states with log-depth quantum circuits
• Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
• Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
• Unification and limitations of error suppression techniques for adiabatic quantum computing
• Towards near-term quantum simulation of materials
• Resource Estimation for Quantum Variational Simulations of the Hubbard Model
• On the static effective Hamiltonian of a rapidly driven nonlinear system
• Exact matrix product solutions in the Heisenberg picture of an open quantum spin chain
• A Variational Quantum Algorithm for Preparing Quantum Gibbs States
• Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
• One bound to rule them all: from Adiabatic to Zeno
• Quantum digital cooling
• Adiabatic theorem revisited: the unexpectedly good performance of adiabatic passage
• Adiabatic Quantum Search in Open Systems
• Quantum state preparation via engineered ancilla resetting
• Taming the Rotating Wave Approximation
• Importance of the spectral gap in estimating ground-state energies
• Towards Perturbation Theory Methods on a Quantum Computer
• Problem specific classical optimization of Hamiltonian simulation
• Preparing thermal states on noiseless and noisy programmable quantum processors
• Thermodynamic Analysis of Algorithmic Cooling Protocols: Efficiency Metrics and Improved Designs
• Electronic Structure in a Fixed Basis is QMA-complete
• Quantum Tensor Product Decomposition from Choi State Tomography
• A Protocol For Cooling and Controlling Composite Systems by Local Interactions
• Towards solving the Fermi-Hubbard model via tailored quantum annealers
• Heat Bath Algorithmic Cooling with Spins: Review and Prospects

Cited by in corpus (4)

• Quantum algorithms for cooling: a simple case study
• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
• Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
• Refrigeration of a 1D gas of microwave photons