Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2604.18495

Scaling of Quantum Resources for Simulating a Long-Range System

Tanya Keshari, Debasis Sadhukhan

quant-phSubmitted Apr 20, 2026• Announced Apr 21, 2026• 0 citations
arXivHTMLPDF

Abstract

We simulate a long-range extended Ising model in one dimension using a hybrid quantum algorithm, namely Variational Quantum Eigensolver (VQE). In this quantum simulation, we investigate how quantum resources scale with system size and interaction strength. Three structure-aware ansatze incorporating nearest-neighbor (NN), next-nearest-neighbor (NNN), and next-next-nearest-neighbor (NNNN) entangling blocks are constructed by mimicking the string operators in the Hamiltonian. We show that energy fidelity alone is not a good indicator for finding the ground state of our model. To overcome this problem, we introduce an additional criterion based on pairwise logarithmic negativity as a more reliable way to find the actual ground state by the VQE. We find that the interaction range parameter alpha primarily governs the minimum number of ansatz layers required, rather than proximity to the quantum critical point. In particular, we show that in the non-local regime (alpha <= 1), the NNN and NNNN ansatze reduce the layer scaling rate by factors of 2.5x and 3.8x relative to NN in all phases, including the critical point. The total number of two-qubit gates required for reliable simulation grows quadratically with system size for all three ansatze. This is consistent with the theoretical prediction, as the number of non-local terms in the Hamiltonian also grows quadratically with the system size. In the local regime, however, the number of required two-qubit gates grows linearly with system size. In contrast, in the quasi-local regime, the required number of two-qubit gates for the quantum simulation is more subtle and depends on the phase of the Hamiltonian.

Comments
11 pages, 5 figures

Related papers

Exploring variational quantum eigensolver ansatzes for the long-range XY model

Jia-Bin You, Dax Enshan Koh, Jian Feng Kong +3 more

Finding the ground state energy and wavefunction of a quantum many-body system is a key problem in quantum physics and chemistry. We study this problem for the long-range XY model by using the variational quantum eigensolver (VQE) algorithm. We consider VQE ansatzes with full and linear entanglement structures consisting of different building gates: the CNOT gate, the controlled-rotation (CRX) gate, and the two-qubit rotation (TQR) gate. We find that the full-entanglement CRX and TQR ansatzes can sufficiently describe the ground state energy of the long-range XY model. In contrast, only the full-entanglement TQR ansatz can represent the ground state wavefunction with a fidelity close to one. In addition, we find that instead of using full-entanglement ansatzes, restricted-entanglement ansatzes where entangling gates are applied only between qubits that are a fixed distance from each other already suffice to give acceptable solutions. Using the entanglement entropy to characterize the expressive powers of the VQE ansatzes, we show that the full-entanglement TQR ansatz has the highest expressive power among them.

arXiv:2109.00288•Sep 1, 2021•9 citations

Universal scaling framework for parameterized quantum evolutions at criticality

Jan T. Schneider, Cristian Tabares, Alejandro González-Tudela +1 more

Variational ansätze are a cornerstone of quantum many-body physics, providing compact approximations to complex ground states using finite resources. Recent quantum-technology advances have introduced a new class based on layered parameterized evolutions. Assessing whether they can represent critical ground states is challenging: correlations span all length scales, while finite circuit depth limits how far they extend. Building on finite-resource scaling from tensor networks, we assign each ansatz an emergent correlation length $ξ_D$, the longest range over which it faithfully captures critical correlations. Its growth with refinement parameter $D$, $ξ_D \propto D^κ$, defines an exponent $κ$ measuring how efficiently an architecture converts resources into long-distance correlations. Applying this framework to the critical transverse-field Ising model, with $D$ the circuit depth of parameterized evolutions, we compare ansätze with nearest-neighbor and long-range generators, and layers where generators act separately or combined. All ansätze are compatible with algebraic growth, but fitted exponents range from $κ\simeq1$ to $κ\simeq3$. Exponential interactions give the largest exponents, while power-law interactions stay close to nearest-neighbor behavior, showing long-range support alone gives no scaling advantage. Combined-generator layers generally outperform separable ones, so layer organization matters alongside interaction range. Finally, a quasiparticle analysis shows finite depth leaves an unresolved window of width $ξ_D^{-1}$ around the low-energy modes responsible for long-distance correlations. The emergent correlation length thus acts as an infrared resolution scale, providing a benchmark for critical-state preparation and a guide for designing resource-efficient variational architectures.

quant-pharXiv:2607.22863•Jul 28, 2026•0 citations

Exploring Entanglement and Optimization within the Hamiltonian Variational Ansatz

Roeland Wiersema, Cunlu Zhou, Yvette de Sereville +3 more

Quantum variational algorithms are one of the most promising applications of near-term quantum computers; however, recent studies have demonstrated that unless the variational quantum circuits are configured in a problem-specific manner, optimization of such circuits will most likely fail.In this paper, we focus on a special family of quantum circuits called the Hamiltonian variational ansatz (HVA), which its takes inspiration from the quantum approximate optimization algorithm and adiabatic quantum computation.Through the study of its entanglement spectrum and energy-gradient statistics, we find that the HVA exhibits favorable structural properties such as mild or entirely absent barren plateaus and a restricted state space that eases their optimization in comparison to the well-studied "hardware-efficient ansatz."We also numerically observe that the optimization landscape of the HVA becomes almost trap free, i.e., there are no suboptimal minima, when the ansatz is overparametrized.We observe a size-dependent "computational phase transition" as the number of layers in the HVA circuit is increased where the optimization crosses over from a hard to an easy region in terms of the quality of the approximations and the speed of convergence to a good solution.In contrast to the analogous transitions observed in the learning of random unitaries, which occur at a number of layers that grows exponentially with the number of qubits, our variational-quantum-eigensolver experiments suggest that the threshold to achieve the overparametrization phenomenon scales at most polynomially in the number of qubits for the transverse-field Ising and XXZ models.Lastly, as a demonstration of its entangling power and effectiveness, we show that the HVA can find accurate approximations to the ground states of a modified Haldane-Shastry Hamiltonian on a ring, which has long-range interactions and has a power-law entanglement scaling.

arXiv:2008.02941•PRX Quantum•Dec 8, 2020•250 citations

Variational Quantum Eigensolver in Compressed Space for Nearest-Neighbour Quadratic Fermionic Hamiltonians.

Guillermo Blázquez-Cruz, Pierre-Luc Dallaire-Demers

Variational quantum eigensolvers (VQE) are one of the possible tasks that can be performed in noisy intermediate-scale quantum (NISQ) computers. While one of the limitations of NISQ platforms is their restricted number of available qubits, the theory of compressable matchgate circuits can be used to circumvent this limitation for certain types of Hamiltonians. We show how VQE algorithms can be used to find the ground state of quadratic fermionic Hamiltonians, providing an expressible ansatz in a logarithmic number of qubits. In particular, for systems of $n$ orbitals encoded to 2-local qubit models with nearest neighbour interactions, the ground state energy can be evaluated with $O\left(\log n\right)$ sets of measurements. This result is invariant of the dimensions in which the $n$ sites are arranged.

•Oct 18, 2021•0 citations

Variational quantum eigensolver for frustrated quantum systems

Alexey Uvarov, Jacob Biamonte, Dmitry I. Yudin

Hybrid quantum-classical algorithms have been proposed as a potentially viable application of quantum computers. A particular example---the variational quantum eigensolver, or VQE---is designed to determine a global minimum in an energy landscape specified by a quantum Hamiltonian, which makes it appealing for the needs of quantum chemistry. Experimental realizations have been reported in recent years and theoretical estimates of its efficiency are a subject of intense effort. Here we consider the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions with competing nearest- and next-nearest-neighbor interactions. We find that recovering the VQE solution allows one to obtain the correlation function of the ground state consistent with the exact result. We also study the barren plateau phenomenon for the Hamiltonian in question and find that the severity of this effect depends on the encoding of fermions to qubits. Our results are consistent with the current knowledge about the barren plateaus in quantum optimization.

arXiv:2005.00544•Physical review. B./Physical review. B•Aug 4, 2020•61 citations

Variational quantum eigensolver ansatz for the J1−J2 -model

Verena Feulner, Michael J. Hartmann

The ground state properties of the two-dimensional ${J}_{1}\ensuremath{-}{J}_{2}$-model are very challenging to analyze via classical numerical methods due to the high level of frustration. This makes the model a promising candidate for which quantum computers could be helpful to possibly explore regimes that classical computers cannot reach. The ${J}_{1}\ensuremath{-}{J}_{2}$-model is a quantum spin model composed of Heisenberg interactions along the rectangular lattice edges and along diagonal edges between next-nearest-neighbor spins. We propose an ansatz for the variational quantum eigensolver to approximate the ground state of an antiferromagnetic ${J}_{1}\ensuremath{-}{J}_{2}$ Hamiltonian for different lattice sizes and different ratios of ${J}_{1}$ and ${J}_{2}$. Moreover, we demonstrate that this ansatz can work without the need for gates along the diagonal next-nearest-neighbor interactions. This simplification is of great importance for solid-state-based hardware with qubits on a rectangular grid, where it eliminates the need for swap gates. In addition, we provide an extrapolation for the number of gates and parameters needed for larger lattice sizes, showing that these are expected to grow linearly in the qubit number up to lattice sizes which eventually can no longer be treated with classical computers.

arXiv:2205.11198•Physical review. B./Physical review. B•Oct 21, 2022•10 citations
We simulate a long-range extended Ising model in one dimension using a hybrid quantum algorithm, namely Variational Quantum Eigensolver (VQE). In this quantum simulation, we investigate how quantum resources scale with system size and interaction strength. Three structure-aware ansatze incorporating nearest-neighbor (NN), next-nearest-neighbor (NNN), and next-next-nearest-neighbor (NNNN) entangling blocks are constructed by mimicking the string operators in the Hamiltonian. We show that energy fidelity alone is not a good indicator for finding the ground state of our model. To overcome this problem, we introduce an additional criterion based on pairwise logarithmic negativity as a more reliable way to find the actual ground state by the VQE. We find that the interaction range parameter alpha primarily governs the minimum number of ansatz layers required, rather than proximity to the quantum critical point. In particular, we show that in the non-local regime (alpha <= 1), the NNN and NNNN ansatze reduce the layer scaling rate by factors of 2.5x and 3.8x relative to NN in all phases, including the critical point. The total number of two-qubit gates required for reliable simulation grows quadratically with system size for all three ansatze. This is consistent with the theoretical prediction, as the number of non-local terms in the Hamiltonian also grows quadratically with the system size. In the local regime, however, the number of required two-qubit gates grows linearly with system size. In contrast, in the quasi-local regime, the required number of two-qubit gates for the quantum simulation is more subtle and depends on the phase of the Hamiltonian.
Finding the ground state energy and wavefunction of a quantum many-body system is a key problem in quantum physics and chemistry. We study this problem for the long-range XY model by using the variational quantum eigensolver (VQE) algorithm. We consider VQE ansatzes with full and linear entanglement structures consisting of different building gates: the CNOT gate, the controlled-rotation (CRX) gate, and the two-qubit rotation (TQR) gate. We find that the full-entanglement CRX and TQR ansatzes can sufficiently describe the ground state energy of the long-range XY model. In contrast, only the full-entanglement TQR ansatz can represent the ground state wavefunction with a fidelity close to one. In addition, we find that instead of using full-entanglement ansatzes, restricted-entanglement ansatzes where entangling gates are applied only between qubits that are a fixed distance from each other already suffice to give acceptable solutions. Using the entanglement entropy to characterize the expressive powers of the VQE ansatzes, we show that the full-entanglement TQR ansatz has the highest expressive power among them.
Variational ansätze are a cornerstone of quantum many-body physics, providing compact approximations to complex ground states using finite resources. Recent quantum-technology advances have introduced a new class based on layered parameterized evolutions. Assessing whether they can represent critical ground states is challenging: correlations span all length scales, while finite circuit depth limits how far they extend. Building on finite-resource scaling from tensor networks, we assign each ansatz an emergent correlation length ξDξ_DξD​, the longest range over which it faithfully captures critical correlations. Its growth with refinement parameter DDD, ξD∝Dκξ_D \propto D^κξD​∝Dκ, defines an exponent κκκ measuring how efficiently an architecture converts resources into long-distance correlations. Applying this framework to the critical transverse-field Ising model, with DDD the circuit depth of parameterized evolutions, we compare ansätze with nearest-neighbor and long-range generators, and layers where generators act separately or combined. All ansätze are compatible with algebraic growth, but fitted exponents range from κ≃1κ\simeq1κ≃1 to κ≃3κ\simeq3κ≃3. Exponential interactions give the largest exponents, while power-law interactions stay close to nearest-neighbor behavior, showing long-range support alone gives no scaling advantage. Combined-generator layers generally outperform separable ones, so layer organization matters alongside interaction range. Finally, a quasiparticle analysis shows finite depth leaves an unresolved window of width ξD−1ξ_D^{-1}ξD−1​ around the low-energy modes responsible for long-distance correlations. The emergent correlation length thus acts as an infrared resolution scale, providing a benchmark for critical-state preparation and a guide for designing resource-efficient variational architectures.
Quantum variational algorithms are one of the most promising applications of near-term quantum computers; however, recent studies have demonstrated that unless the variational quantum circuits are configured in a problem-specific manner, optimization of such circuits will most likely fail.In this paper, we focus on a special family of quantum circuits called the Hamiltonian variational ansatz (HVA), which its takes inspiration from the quantum approximate optimization algorithm and adiabatic quantum computation.Through the study of its entanglement spectrum and energy-gradient statistics, we find that the HVA exhibits favorable structural properties such as mild or entirely absent barren plateaus and a restricted state space that eases their optimization in comparison to the well-studied "hardware-efficient ansatz."We also numerically observe that the optimization landscape of the HVA becomes almost trap free, i.e., there are no suboptimal minima, when the ansatz is overparametrized.We observe a size-dependent "computational phase transition" as the number of layers in the HVA circuit is increased where the optimization crosses over from a hard to an easy region in terms of the quality of the approximations and the speed of convergence to a good solution.In contrast to the analogous transitions observed in the learning of random unitaries, which occur at a number of layers that grows exponentially with the number of qubits, our variational-quantum-eigensolver experiments suggest that the threshold to achieve the overparametrization phenomenon scales at most polynomially in the number of qubits for the transverse-field Ising and XXZ models.Lastly, as a demonstration of its entangling power and effectiveness, we show that the HVA can find accurate approximations to the ground states of a modified Haldane-Shastry Hamiltonian on a ring, which has long-range interactions and has a power-law entanglement scaling.
Variational quantum eigensolvers (VQE) are one of the possible tasks that can be performed in noisy intermediate-scale quantum (NISQ) computers. While one of the limitations of NISQ platforms is their restricted number of available qubits, the theory of compressable matchgate circuits can be used to circumvent this limitation for certain types of Hamiltonians. We show how VQE algorithms can be used to find the ground state of quadratic fermionic Hamiltonians, providing an expressible ansatz in a logarithmic number of qubits. In particular, for systems of nnn orbitals encoded to 2-local qubit models with nearest neighbour interactions, the ground state energy can be evaluated with O(log⁡n)O\left(\log n\right)O(logn) sets of measurements. This result is invariant of the dimensions in which the nnn sites are arranged.
Hybrid quantum-classical algorithms have been proposed as a potentially viable application of quantum computers. A particular example---the variational quantum eigensolver, or VQE---is designed to determine a global minimum in an energy landscape specified by a quantum Hamiltonian, which makes it appealing for the needs of quantum chemistry. Experimental realizations have been reported in recent years and theoretical estimates of its efficiency are a subject of intense effort. Here we consider the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions with competing nearest- and next-nearest-neighbor interactions. We find that recovering the VQE solution allows one to obtain the correlation function of the ground state consistent with the exact result. We also study the barren plateau phenomenon for the Hamiltonian in question and find that the severity of this effect depends on the encoding of fermions to qubits. Our results are consistent with the current knowledge about the barren plateaus in quantum optimization.
The ground state properties of the two-dimensional ${J}_{1}\ensuremath{-}{J}_{2}$-model are very challenging to analyze via classical numerical methods due to the high level of frustration. This makes the model a promising candidate for which quantum computers could be helpful to possibly explore regimes that classical computers cannot reach. The ${J}_{1}\ensuremath{-}{J}_{2}$-model is a quantum spin model composed of Heisenberg interactions along the rectangular lattice edges and along diagonal edges between next-nearest-neighbor spins. We propose an ansatz for the variational quantum eigensolver to approximate the ground state of an antiferromagnetic ${J}_{1}\ensuremath{-}{J}_{2}$ Hamiltonian for different lattice sizes and different ratios of J1{J}_{1}J1​ and J2{J}_{2}J2​. Moreover, we demonstrate that this ansatz can work without the need for gates along the diagonal next-nearest-neighbor interactions. This simplification is of great importance for solid-state-based hardware with qubits on a rectangular grid, where it eliminates the need for swap gates. In addition, we provide an extrapolation for the number of gates and parameters needed for larger lattice sizes, showing that these are expected to grow linearly in the qubit number up to lattice sizes which eventually can no longer be treated with classical computers.