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:2002.06210 · Quantum

Scaling of variational quantum circuit depth for condensed matter systems

Carlos Bravo-Prieto, Josep Lumbreras-Zarapico, Luca Tagliacozzo, José Ignacio Latorre

Published May 28, 2020• 84 citations
arXivHTMLPDF

Abstract

We benchmark the accuracy of a variational quantum eigensolver based on a finite-depth quantum circuit encoding ground state of local Hamiltonians. We show that in gapped phases, the accuracy improves exponentially with the depth of the circuit. When trying to encode the ground state of conformally invariant Hamiltonians, we observe two regimes. A finite-depth regime, where the accuracy improves slowly with the number of layers, and a finite-size regime where it improves again exponentially. The cross-over between the two regimes happens at a critical number of layers whose value increases linearly with the size of the system. We discuss the implication of these observations in the context of comparing different variational ansatz and their effectiveness in describing critical ground states.

DOI
10.22331/q-2020-05-28-272

Related papers

Efficient variational quantum circuit structure for correlated topological phases

Rong-Yang Sun, Tomonori Shirakawa, Seiji Yunoki

We propose an efficient circuit structure of variational quantum circuit Ans\"atze used for the variational quantum eigensolver (VQE) algorithm in calculating gapped topological phases on the currently feasible noisy intermediate-scale quantum computers. An efficient circuit Ansatz should include two layers: the initialization layer and the variational layer. In the initialization layer, a fixed-depth circuit state with a compatible entanglement structure to the target topological phase is constructed. The circuit state is further adjusted subsequently to capture the details of the local correlations, which is dictated with the Hamiltonian, in the parametrized variational layer. Based on this strategy, we design a circuit Ansatz to investigate the symmetry-protected topological Haldane phase in a nonexactly solvable alternating spin-$\frac{1}{2}$ Heisenberg chain by VQE calculations. Main characterizations of the Haldane phase, including the long-ranged string order, the fourfold nearly degenerate ground states associated with four different localized edge-mode patterns for the system with open boundaries, and the twofold degeneracy of the entanglement spectrum, are all observed for the optimized shallow circuit state with only one-depth variational layer both in numerical simulations and on real quantum computers. We further demonstrate that the computational capacity (i.e., expressibility) of this quantum circuit Ansatz is determined not by the system size but only by the intrinsic correlation length of the system, thus implying that the scalable VQE calculation is possible.

arXiv:2303.17187•Physical review. B./Physical review. B•Aug 11, 2023•10 citations

Efficient ground state preparation in variational quantum eigensolver with symmetry-breaking layers

Chae-Yeun Park

A variational quantum eigensolver (VQE) solves the ground state problem of a given Hamiltonian by finding the parameters of a quantum circuit Ansatz that minimizes the Hamiltonian expectation value. Among possible quantum circuit Ansätze, the Hamiltonian variational Ansatz (HVA) is widely studied for quantum many-body problems as the Ansatz with sufficiently large depth is theoretically guaranteed to express the ground state. However, since the HVA shares the same symmetry with the Hamiltonian, it is not necessarily good at finding symmetry-broken ground states that prevail in nature. In this paper, we systematically explore the limitations of the HVA for solving symmetry-broken systems and propose an alternative quantum circuit Ansatz with symmetry-breaking layers. With extensive numerical simulations, we show that the proposed Ansatz finds the ground state in depth significantly shorter than the bare HVA when the target Hamiltonian has symmetry-broken ground states.

arXiv:2106.02509•APL Quantum•Feb 23, 2024•20 citations

Finite-depth scaling of infinite quantum circuits for quantum critical points

Bernhard Jobst, Adam Smith, Frank Pollmann

The scaling of the entanglement entropy at a quantum critical point allows us to extract universal properties of the state, e.g., the central charge of a conformal field theory. With the rapid improvement of noisy intermediate-scale quantum (NISQ) devices, these quantum computers present themselves as a powerful tool to study critical many-body systems. We use finite-depth quantum circuits suitable for NISQ devices as a variational ansatz to represent ground states of critical, infinite systems. We find universal finite-depth scaling relations for these circuits and verify them numerically at two different critical points, i.e., the critical Ising model with an additional symmetry-preserving term and the critical XXZ model.

arXiv:2203.11975•Physical Review Research•Aug 11, 2022•8 citations

Variational Quantum Eigensolver Benchmarking of the Su–Schrieffer–Heeger Model: Ansatz-Conditional Bulk-Spectrum Resolution

Prahlad Madhavan Veervalli, Saksham Aryan, Ardra Muriyankandathil +2 more

The Su-Schrieffer-Heeger chain provides a clean benchmark for variational quantum simulation as it breeds topologically non-trivial states, it is analytically transparent & tractable, yet capable enough to expose the central algorithmic question of whether a shallow variational circuit can reproduce physically meaningful low-energy structure when the system size is increased. In this work, we study the Variational Quantum Eigensolver and a deflation-based excited-state extension on the open SSH chain after Jordan-Wigner mapping to qubits. The analysis is carried out in an exact statevector setting so that all expectation values and overlaps are evaluated without sampling noise, allowing the observed performance to be attributed directly to ansatz design and optimizer behavior. We compare three circuit families under matched shallow depth and fixed classical budgets: a number-conserving fermionic circuit, a hardwareefficient ansatz, and a two-local baseline. Across the tested chain lengths, the fermionic circuit tracks the exact diagonalization benchmark most closely for both the ground-state and firstexcited-state bulk energies, whereas the generic baselines exhibit systematic underbinding and a larger excited-state bias. These results establish a compact, physics-informed benchmark for ansatz selection on structured lattice Hamiltonians and provide the starting point for subsequent studies of boundary-localized topological modes and hardware execution.

International Conference on Emerging Techniques in Computational Intelligence (ICETCI)•Aug 1, 2026•0 citations

Absence of Barren Plateaus in Finite Local-Depth Circuits with Long-Range Entanglement

Hao-Kai Zhang, Shuo Liu, Shi‐Xin Zhang

Ground state preparation is classically intractable for general Hamiltonians. On quantum devices, shallow parametrized circuits can be effectively trained to obtain short-range entangled states under the paradigm of variational quantum eigensolver, while deep circuits are generally untrainable due to the barren plateau phenomenon. In this Letter, we give a general lower bound on the variance of circuit gradients for arbitrary quantum circuits composed of local 2-designs. Based on our unified framework, we prove the absence of barren plateaus in training finite local-depth circuits (FLDC) for the ground states of local Hamiltonians. FLDCs are allowed to be deep in the conventional circuit depth to generate long-range entangled ground states, such as topologically ordered states, but their local depths are finite, i.e., there is only a finite number of gates acting on individual qubits. This characteristic sets FLDC apart from shallow circuits: FLDC in general cannot be classically simulated to estimate local observables efficiently by existing tensor network methods in two and higher dimensions. We validate our analytical results with extensive numerical simulations and demonstrate the effectiveness of variational training using the generalized toric code model.

arXiv:2311.01393•Physical Review Letters•Apr 9, 2024•50 citations

Exponential Scaling Barriers for Variational Quantum Eigensolvers

Manuel Hagelueken, David A. Kreplin, Florian Wieland +2 more

The Variational Quantum Eigensolver (VQE) is widely regarded as a promising algorithm for calculating ground states of quantum systems that are intractable for classical computers. This promise is typically motivated by the hope of mitigating the exponential growth of Hilbert space with system size. Here we scrutinize how the computational cost of adaptive VQE scales with the size of the target system. We demonstrate that the Rényi entropy derived from classical simulations predicts the required number of adaptive iterations of VQE with high accuracy ($R^2 \approx 0.99$). We validate this on a benchmarking set of more than 20 different molecules with active spaces ranging from four to ten orbitals. For these molecules, we find an exponential scaling of the number of adaptive iterations, and in turn, of the circuit depth with the system size. We therefore conclude that it is unlikely that VQE in its current form is able to simulate large molecular systems with high fidelity without exponential resource requirements.

quant-pharXiv:2603.13073•Mar 16, 2026•3 citations
We benchmark the accuracy of a variational quantum eigensolver based on a finite-depth quantum circuit encoding ground state of local Hamiltonians. We show that in gapped phases, the accuracy improves exponentially with the depth of the circuit. When trying to encode the ground state of conformally invariant Hamiltonians, we observe two regimes. A finite-depth regime, where the accuracy improves slowly with the number of layers, and a finite-size regime where it improves again exponentially. The cross-over between the two regimes happens at a critical number of layers whose value increases linearly with the size of the system. We discuss the implication of these observations in the context of comparing different variational ansatz and their effectiveness in describing critical ground states.
We propose an efficient circuit structure of variational quantum circuit Ans\"atze used for the variational quantum eigensolver (VQE) algorithm in calculating gapped topological phases on the currently feasible noisy intermediate-scale quantum computers. An efficient circuit Ansatz should include two layers: the initialization layer and the variational layer. In the initialization layer, a fixed-depth circuit state with a compatible entanglement structure to the target topological phase is constructed. The circuit state is further adjusted subsequently to capture the details of the local correlations, which is dictated with the Hamiltonian, in the parametrized variational layer. Based on this strategy, we design a circuit Ansatz to investigate the symmetry-protected topological Haldane phase in a nonexactly solvable alternating spin-12\frac{1}{2}21​ Heisenberg chain by VQE calculations. Main characterizations of the Haldane phase, including the long-ranged string order, the fourfold nearly degenerate ground states associated with four different localized edge-mode patterns for the system with open boundaries, and the twofold degeneracy of the entanglement spectrum, are all observed for the optimized shallow circuit state with only one-depth variational layer both in numerical simulations and on real quantum computers. We further demonstrate that the computational capacity (i.e., expressibility) of this quantum circuit Ansatz is determined not by the system size but only by the intrinsic correlation length of the system, thus implying that the scalable VQE calculation is possible.
A variational quantum eigensolver (VQE) solves the ground state problem of a given Hamiltonian by finding the parameters of a quantum circuit Ansatz that minimizes the Hamiltonian expectation value. Among possible quantum circuit Ansätze, the Hamiltonian variational Ansatz (HVA) is widely studied for quantum many-body problems as the Ansatz with sufficiently large depth is theoretically guaranteed to express the ground state. However, since the HVA shares the same symmetry with the Hamiltonian, it is not necessarily good at finding symmetry-broken ground states that prevail in nature. In this paper, we systematically explore the limitations of the HVA for solving symmetry-broken systems and propose an alternative quantum circuit Ansatz with symmetry-breaking layers. With extensive numerical simulations, we show that the proposed Ansatz finds the ground state in depth significantly shorter than the bare HVA when the target Hamiltonian has symmetry-broken ground states.
The scaling of the entanglement entropy at a quantum critical point allows us to extract universal properties of the state, e.g., the central charge of a conformal field theory. With the rapid improvement of noisy intermediate-scale quantum (NISQ) devices, these quantum computers present themselves as a powerful tool to study critical many-body systems. We use finite-depth quantum circuits suitable for NISQ devices as a variational ansatz to represent ground states of critical, infinite systems. We find universal finite-depth scaling relations for these circuits and verify them numerically at two different critical points, i.e., the critical Ising model with an additional symmetry-preserving term and the critical XXZ model.
The Su-Schrieffer-Heeger chain provides a clean benchmark for variational quantum simulation as it breeds topologically non-trivial states, it is analytically transparent & tractable, yet capable enough to expose the central algorithmic question of whether a shallow variational circuit can reproduce physically meaningful low-energy structure when the system size is increased. In this work, we study the Variational Quantum Eigensolver and a deflation-based excited-state extension on the open SSH chain after Jordan-Wigner mapping to qubits. The analysis is carried out in an exact statevector setting so that all expectation values and overlaps are evaluated without sampling noise, allowing the observed performance to be attributed directly to ansatz design and optimizer behavior. We compare three circuit families under matched shallow depth and fixed classical budgets: a number-conserving fermionic circuit, a hardwareefficient ansatz, and a two-local baseline. Across the tested chain lengths, the fermionic circuit tracks the exact diagonalization benchmark most closely for both the ground-state and firstexcited-state bulk energies, whereas the generic baselines exhibit systematic underbinding and a larger excited-state bias. These results establish a compact, physics-informed benchmark for ansatz selection on structured lattice Hamiltonians and provide the starting point for subsequent studies of boundary-localized topological modes and hardware execution.
Ground state preparation is classically intractable for general Hamiltonians. On quantum devices, shallow parametrized circuits can be effectively trained to obtain short-range entangled states under the paradigm of variational quantum eigensolver, while deep circuits are generally untrainable due to the barren plateau phenomenon. In this Letter, we give a general lower bound on the variance of circuit gradients for arbitrary quantum circuits composed of local 2-designs. Based on our unified framework, we prove the absence of barren plateaus in training finite local-depth circuits (FLDC) for the ground states of local Hamiltonians. FLDCs are allowed to be deep in the conventional circuit depth to generate long-range entangled ground states, such as topologically ordered states, but their local depths are finite, i.e., there is only a finite number of gates acting on individual qubits. This characteristic sets FLDC apart from shallow circuits: FLDC in general cannot be classically simulated to estimate local observables efficiently by existing tensor network methods in two and higher dimensions. We validate our analytical results with extensive numerical simulations and demonstrate the effectiveness of variational training using the generalized toric code model.
The Variational Quantum Eigensolver (VQE) is widely regarded as a promising algorithm for calculating ground states of quantum systems that are intractable for classical computers. This promise is typically motivated by the hope of mitigating the exponential growth of Hilbert space with system size. Here we scrutinize how the computational cost of adaptive VQE scales with the size of the target system. We demonstrate that the Rényi entropy derived from classical simulations predicts the required number of adaptive iterations of VQE with high accuracy (R2≈0.99R^2 \approx 0.99R2≈0.99). We validate this on a benchmarking set of more than 20 different molecules with active spaces ranging from four to ten orbitals. For these molecules, we find an exponential scaling of the number of adaptive iterations, and in turn, of the circuit depth with the system size. We therefore conclude that it is unlikely that VQE in its current form is able to simulate large molecular systems with high fidelity without exponential resource requirements.