Efficient Quantum Cooling Algorithm for Fermionic Systems

• URL: http://arxiv.org/abs/2403.14506v1
• Date: Thu, 21 Mar 2024 15:59:32 GMT
• Title: Efficient Quantum Cooling Algorithm for Fermionic Systems
• Authors: Lucas Marti, Refik Mansuroglu, Michael J. Hartmann,
• Abstract summary: We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. We derive suitable interaction Hamiltonians that originate from operators of the free theory. We propose a spectroscopic scan to find the relevant eigenenergies of the system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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 fast, quasi-adiabatic sweep from a parameter regime whose ground state can be easily prepared. We generalize the algorithm to prepare thermal states and demonstrate our findings on the Fermi-Hubbard model.

Related papers

• Rapid quantum ground state preparation via dissipative dynamics [3.3187923242469246]
  dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians. This work provides significant analytical and numerical insights into the power of dissipation for preparing the ground state of non-commuting Hamiltonians.
  arXiv  Detail & Related papers  (2025-03-20T03:27:52Z)
• Optimal quantum algorithm for Gibbs state preparation [2.403252956256118]
  A recently introduced disispative evolution has been shown to be efficiently implementable on a quantum computer. We prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. We then employ our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.
  arXiv  Detail & Related papers  (2024-11-07T17:21:26Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Neural Pfaffians: Solving Many Many-Electron Schrödinger Equations [58.130170155147205]
  Neural wave functions accomplished unprecedented accuracies in approximating the ground state of many-electron systems, though at a high computational cost. Recent works proposed amortizing the cost by learning generalized wave functions across different structures and compounds instead of solving each problem independently. This work tackles the problem by defining overparametrized, fully learnable neural wave functions suitable for generalization across molecules.
  arXiv  Detail & Related papers  (2024-05-23T16:30:51Z)
• Ground State Preparation via Dynamical Cooling [0.46664938579243576]
  We introduce a ground-state preparation algorithm based on the simulation of quantum dynamics. Our main insight is to transform the Hamiltonian by a shifted sign function via quantum signal processing. The approach does not rely on a priori knowledge of energy gaps and requires no additional qubits to model a bath.
  arXiv  Detail & Related papers  (2024-04-08T18:16:25Z)
• Efficient thermalization and universal quantum computing with quantum Gibbs samplers [2.403252956256118]
  We show adiabatic preparation of the associated "thermofield double" states. We show implementing this family of dissipative evolutions for inverse temperatures in the system's size is computationally equivalent to standard quantum computations. Taken together, our results show that a family of quasi-local dissipative evolution efficiently prepares a large class of quantum many-body states.
  arXiv  Detail & Related papers  (2024-03-19T12:49:25Z)
• Quantum Computation by Cooling [0.0]
  We propose a specific Hamiltonian model for quantum computation based on adiabatic evolution. We show that quantum computation based on this cooling procedure is equivalent in its computational power to the one based on quantum circuits.
  arXiv  Detail & Related papers  (2024-03-04T06:26:07Z)
• A Score-Based Model for Learning Neural Wavefunctions [41.82403146569561]
  We provide a new framework for obtaining properties of quantum many-body ground states using score-based neural networks. Our new framework does not require explicit probability distribution and performs the sampling via Langevin dynamics.
  arXiv  Detail & Related papers  (2023-05-25T23:44:27Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Programmable adiabatic demagnetization for systems with trivial and topological excitations [0.0]
  We propose a protocol to prepare a low-energy state of an arbitrary Hamiltonian on a quantum computer or quantum simulator. The protocol is inspired by the adiabatic demagnetization technique, used to cool solid-state systems to extremely low temperatures.
  arXiv  Detail & Related papers  (2022-10-31T12:27:04Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Adiabatic quantum algorithm for artificial graphene [0.0]
  We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. A full simulation of the algorithm is performed and ground energies are obtained for lattices with up to four hexagons.
  arXiv  Detail & Related papers  (2022-04-06T18:00:25Z)
• Fast Thermalization from the Eigenstate Thermalization Hypothesis [69.68937033275746]
  Eigenstate Thermalization Hypothesis (ETH) has played a major role in understanding thermodynamic phenomena in closed quantum systems. This paper establishes a rigorous link between ETH and fast thermalization to the global Gibbs state. Our results explain finite-time thermalization in chaotic open quantum systems.
  arXiv  Detail & Related papers  (2021-12-14T18:48:31Z)
• Visualizing spinon Fermi surfaces with time-dependent spectroscopy [62.997667081978825]
  We propose applying time-dependent photo-emission spectroscopy, an established tool in solid state systems, in cold atom quantum simulators. We show in exact diagonalization simulations of the one-dimensional $t-J$ model that the spinons start to populate previously unoccupied states in an effective band structure. The dependence of the spectral function on the time after the pump pulse reveals collective interactions among spinons.
  arXiv  Detail & Related papers  (2021-05-27T18:00:02Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Algorithmic Cooling of Nuclear Spin Pairs using a Long-Lived Singlet State [48.7576911714538]
  We show that significant cooling is achieved on an ensemble of spin-pair systems by exploiting the long-lived nuclear singlet state. This is the first demonstration of algorithmic cooling using a quantum superposition state.
  arXiv  Detail & Related papers  (2019-12-31T09:57:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.