A penalty-free quantum algorithm to find energy eigenstates

• URL: http://arxiv.org/abs/2509.09148v1
• Date: Thu, 11 Sep 2025 04:54:10 GMT
• Title: A penalty-free quantum algorithm to find energy eigenstates
• Authors: Nannan Ma, Heng Dai, Jiangbin Gong,
• Abstract summary: We advocate a quantum algorithm to find the ground state and excited states of many-body systems.<n>Our fully quantum algorithm will be an important addition to the quantum computational toolbox to tackle problems intractable on classical machines.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Finding eigenstates of a given many-body Hamiltonian is a long-standing challenge due to the perceived computational complexity. Leveraging on the hardware of a quantum computer accommodating the exponential growth of the Hilbert space size with the number of qubits, more quantum algorithms to find the eigenstates of many-body Hamiltonians will be of wide interest with profound implications and applications. In this work, we advocate a quantum algorithm to find the ground state and excited states of many-body systems, without any penalty functions, variational steps or hybrid quantum-classical steps. Our fully quantum algorithm will be an important addition to the quantum computational toolbox to tackle problems intractable on classical machines.

Related papers

• Artificial intelligence for representing and characterizing quantum systems [49.29080693498154]
  Efficient characterization of large-scale quantum systems is a central challenge in quantum science.<n>Recent advances in artificial intelligence (AI) have emerged as a powerful tool to address this challenge.<n>This review discusses how each of these AI paradigms contributes to two core tasks in quantum systems characterization.
  arXiv  Detail & Related papers  (2025-09-05T08:41:24Z)
• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Fourier space readout method for efficiently recovering functions encoded in quantum states [0.0]
  We propose a quantum-classical hybrid Fourier space readout (FSR) method to efficiently recover the underlying function from its corresponding quantum state.<n>In particular, the complexity on quantum computers has only a logarithmic dependence on the grid number, while the complexity on classical computers has a linear dependence on the number of target points instead of the grid number.
  arXiv  Detail & Related papers  (2025-07-28T08:10:48Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.<n>We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.<n>We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Computable and noncomputable in the quantum domain: statements and conjectures [0.70224924046445]
  We consider an approach to the question of describing a class of problems whose solution can be accelerated by a quantum computer. The unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates.
  arXiv  Detail & Related papers  (2024-03-25T15:47:35Z)
• State-Averaged Orbital-Optimized VQE: A quantum algorithm for the democratic description of ground and excited electronic states [0.0]
  The SA-OO-VQE package aims to answer both problems with its hybrid quantum-classical conception based on a typical Variational Quantum Eigensolver approach. The SA-OO-VQE has the ability to treat degenerate (or quasi-degenerate) states on the same footing, thus avoiding known numerical optimization problems around avoided crossings or conical intersections.
  arXiv  Detail & Related papers  (2024-01-22T12:16:37Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Learning the Complexity of Weakly Noisy Quantum States [0.5662299435213419]
  We present an efficient learning algorithm, that leverages the classical shadow representation of target quantum states, to predict the circuit complexity of weakly noisy quantum states.<n>Our result builds a bridge between the learning algorithm and quantum state complexity, highlighting the power of the learning algorithm in characterizing intrinsic properties of quantum states.
  arXiv  Detail & Related papers  (2023-03-31T06:02:44Z)
• Variational Quantum Eigensolver for SU($N$) Fermions [0.0]
  Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum computers. We apply the variational quantum eigensolver to study the ground-state properties of $N$-component fermions. Our approach lays out the basis for a current-based quantum simulator of many-body systems.
  arXiv  Detail & Related papers  (2021-06-29T16:39:30Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.