Efficient Quantum Cooling Algorithm for Fermionic Systems

• URL: http://arxiv.org/abs/2403.14506v2
• Date: Mon, 10 Feb 2025 12:06:03 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 ladder operators of the free theory. We generalize the algorithm to prepare thermal states and demonstrate our findings on the Fermi-Hubbard model.
• Score: 0.0
• License:
• 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.

Related papers

• 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)
• 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)
• 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)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• 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)
• Measurement-based cooling of many-body quantum systems [0.0]
  We introduce a novel technique for efficiently cooling many-body quantum systems with unknown Hamiltonians down to their ground states. We present numerical simulation results demonstrating the effectiveness of the technique applied to quantum spin chains with long-range and short-range interactions.
  arXiv  Detail & Related papers  (2022-07-24T12:06:04Z)
• 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)
• 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)

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.