Entanglement generation in qubit-ADAPT-VQE through four-qubit algebraic classification

• URL: http://arxiv.org/abs/2512.11729v1
• Date: Fri, 12 Dec 2025 17:10:51 GMT
• Title: Entanglement generation in qubit-ADAPT-VQE through four-qubit algebraic classification
• Authors: Diego Tancara, Herbert Díaz-Moraga, Vicente Sepúlveda-Trivelli, Dardo Goyeneche,
• Abstract summary: ADAPT-VQE has been extensively benchmarked on molecular Hamiltonians, where the ground states typically exhibit low entanglement.<n>We explore a variant of this algorithm known as qubit-ADAPT-VQE, assessing its ability to achieve ground states with substantial entanglement in spin models.<n>Our findings highlight the versatility of qubit-ADAPT-VQE, demonstrating that it accurately reaches the ground state across all entanglement classes and initial energy values.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: While variational quantum algorithms are among the most promising approaches for the noisy intermediate-scale quantum (NISQ) era, their scalability is often hindered by the barren plateau problem. Among the proposals that have demonstrated robustness against this issue, the ADAPT-VQE algorithm stands out for ground state estimation, primarily due to its iterative ansatz construction. Although ADAPT-VQE has been extensively benchmarked on molecular Hamiltonians, where the ground states typically exhibit low entanglement, its performance for highly entangled ground states remains largely unexplored. In this work, we explore a variant of this algorithm known as qubit-ADAPT-VQE, assessing its ability to achieve ground states with substantial entanglement in spin models. We focus on four-qubit systems and employ an algebraic entanglement classification to identify distinct entanglement classes among ground states, and consider a representative of each class as an initial state to evaluate the performance of the algorithm. Our findings highlight the versatility of qubit-ADAPT-VQE, demonstrating that it accurately reaches the ground state across all entanglement classes and initial energy values.

Related papers

• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Computational complexity of injective projected entangled pair states [0.0]
  Projected entangled pair states (PEPS) constitute a variational family of quantum states with area-law entanglement.<n> PEPS are particularly relevant and successful for studying ground states of spatially local Hamiltonians.<n>Injective PEPS, where all constituent tensors fulfil an injectivity constraint, are generally believed to be better behaved.
  arXiv  Detail & Related papers  (2025-09-24T10:17:23Z)
• Beyond Ground States: Physics-Inspired Optimization of Excited States of Classical Hamiltonians [0.0]
  ExcLQA is a classical, physics-inspired algorithm that identifies excited states of classical Ising Hamiltonians.<n>We benchmark ExcLQA on the shortest vector problem (SVP), a fundamental lattice problem underlying the security of many postquantum cryptographic schemes.<n>Our results show that ExcLQA manages to solve SVP instances up to rank 46, and outperforms the Metropolis-Hastings algorithm in solved ratio, number of shots, and approximation factor.
  arXiv  Detail & Related papers  (2025-07-16T16:40:49Z)
• Formal Verification of Variational Quantum Circuits [44.06507276521908]
  Variational quantum circuits (VQCs) are a central component of many quantum machine learning algorithms.<n>We present the first in-depth theoretical and practical study of the formal verification problem for VQCs.
  arXiv  Detail & Related papers  (2025-07-14T12:28:32Z)
• Detecting quasi-degenerate ground states in topological models via variational quantum eigensolver [0.0]
  We study the exact ground states of the Su--Schrieffer--Heeger open chain and of the Kitaev open chain, using the Variational Quantum Eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2024-08-27T16:24:49Z)
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation [39.20075231137991]
  We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems.<n> scaling these methods to larger system sizes reveals three key challenges: the smoothness of the CDF for large supports, the lack of tight lower bounds on the overlap with the true ground state, and the difficulty of preparing high-quality initial states.
  arXiv  Detail & Related papers  (2024-05-06T18:00:03Z)
• Quantum Davidson Algorithm for Excited States [42.666709382892265]
  We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
  arXiv  Detail & Related papers  (2022-04-22T15:03:03Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Classically-Boosted Variational Quantum Eigensolver [0.0]
  Near-term quantum computers can represent classically-intractable quantum states. The sensitivity to sampling error and device noise approaches zero in the limit where the classically tractable states are able to describe an eigenstate.
  arXiv  Detail & Related papers  (2021-06-09T00:56:50Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.