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:2203.14281 · New Journal of Physics

Variational quantum simulation of long-range interacting systems

Chufan Lyu, Xiaoyu Tang, Junning Li, Xusheng Xu, Man‐Hong Yung, Abolfazl Bayat

Published May 1, 2023• 8 citations
arXivHTMLPDF

Abstract

Abstract Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach in near-term quantum simulation to achieve practical quantum advantage over classical computers. Here, we explore variational quantum algorithms, with different levels of qubit connectivity, for digital simulation of the ground state of long-range interacting systems as well as generation of spin squeezed states. We find that as the interaction becomes more long-ranged, the variational algorithms become less efficient, achieving lower fidelity and demanding more optimization iterations. In particular, when the system is near its criticality the efficiency is even lower. Increasing the connectivity between distant qubits improves the results, even with less quantum and classical resources. Our results show that by mixing circuit layers with different levels of connectivity one can sensibly improve the performance. Interestingly, the order of layers becomes very important and grouping the layers with long-distance connectivity at the beginning of the circuit outperforms other permutations. The same design of circuits can also be used to variationally produce spin squeezed states, as a resource for quantum metrology.

DOI
10.1088/1367-2630/acd571

Related papers

Accelerated variational algorithms for digital quantum simulation of many-body ground states

Chufan Lyu, Víctor Montenegro, Abolfazl Bayat

One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog sense, adiabatic evolution has been proposed to slowly evolve a simple Hamiltonian, initialized in its ground state, to the Hamiltonian of interest such that the final state becomes the desired ground state. Recently, variational methods have also been proposed and realized in quantum simulators for emulating the ground state of many-body systems. Here, we first provide a quantitative comparison between the adiabatic and variational methods with respect to required quantum resources on digital quantum simulators, namely the depth of the circuit and the number of two-qubit quantum gates. Our results show that the variational methods are less demanding with respect to these resources. However, they need to be hybridized with a classical optimization which can converge slowly. Therefore, as the second result of the paper, we provide two different approaches for speeding the convergence of the classical optimizer by taking a good initial guess for the parameters of the variational circuit. We show that these approaches are applicable to a wide range of Hamiltonian and provide significant improvement in the optimization procedure.

arXiv:2006.09415•Quantum•Sep 16, 2020•27 citations

Ultrafast variational simulation of nontrivial quantum states with long-range interactions

Wen Wei Ho, Cheryne Jonay, Timothy H. Hsieh

State preparation protocols ideally require as minimal operations as possible in order to be implemented in near-term, potentially noisy quantum devices. Motivated by long-range interactions (LRIs) intrinsic to many present-day experimental platforms (trapped ions, Rydberg atom arrays, etc.), we investigate the efficacy of variationally simulating nontrivial quantum states using the variational quantum-classical simulation (VQCS) protocol explored recently [W. W. Ho and T. H. Hsieh, SciPost Phys. 6, 29 (2019)], in the presence of LRIs. We show that this approach leads to extremely efficient state preparation: for example, Greenberger-Horne-Zeilinger (GHZ) states can be prepared with $O(1)$ iterations of the protocol, and a quantum critical point of the long-range transverse-field Ising model (TFIM) can be prepared with $>99%$ fidelity on a 100-qubit system with only one iteration. Furthermore, we show that VQCS with LRIs is a promising route for exploring generic points in the phase diagram of the long-range TFIM. Our approach thus provides concrete, ultrafast protocols for quantum simulators equipped with long-range interactions.

arXiv:1810.04817•Physical Review A•May 22, 2019•47 citations

Variational LOCC-Assisted Quantum Circuits for Long-Range Entangled States

Yuxuan Yan, Muzhou Ma, You Zhou +1 more

Long-range entanglement is an important quantum resource, particularly for topological orders and quantum error correction. In reality, preparing long-range entangled states requires a deep unitary circuit, which poses significant experimental challenges. A promising avenue is offered by replacing some quantum resources with local operations and classical communication (LOCC). With these classical components, one can communicate outcomes of midcircuit measurements in distant subsystems, substantially reducing circuit depth in many important cases. However, to prepare general long-range entangled states, finding LOCC-assisted circuits of a short depth remains an open question. Here, to address this challenge, we propose a quantum-classical hybrid algorithm to find optimal LOCC protocols for preparing ground states of given Hamiltonians. In our algorithm, we introduce an efficient way to estimate parameter gradients and use such gradients for variational optimization. Theoretically, we establish the conditions for the absence of barren plateaus, ensuring trainability at a large system size. Numerically, the algorithm accurately solves the ground state of long-range entangled models, such as the perturbed Greenberger-Horne-Zeilinger state and surface code. Our results demonstrate the advantage of our method over conventional unitary variational circuits: the practical advantage in the accuracy of estimated ground-state energy and the theoretical advantage in creating long-range entanglement.

arXiv:2409.07281•Physical Review Letters•Apr 30, 2025•11 citations

Scalable Quantum Algorithms for Noisy Quantum Computers

Julien Gacon

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.

arXiv:2403.00940•Jan 1, 2024•7 citations

Digital Quantum Algorithms for Generating and Utilizing Spin Squeezed States

Mingru Yang, Ruby Wei, Chao Yin

Spin squeezed states (SSSs) are conventionally viewed as analog resources for quantum metrology. Here we develop algorithms to efficiently generate and exploit SSSs on a digital quantum computer. We introduce an adaptive local-circuit protocol that prepares SSSs with squeezing parameter $ξ$ in depth $\mathrm{O}\left(\log{1/ξ}\right)$, yielding an exponential improvement over non-adaptive approaches. We prove that this depth is optimal for permutation symmetric SSSs by deriving a matching lower bound on entanglement entropy. We further leverage the squeezing paradigm to deterministically prepare the Dicke states using asymptotically fewer resources than prior methods. Remarkably, classical simulations of our preparation protocols under realistic noise models predicts a metrological gain of 4.2 dB beyond the standard quantum limit with 55 superconducting qubits in total including ancillae. Our work paves the way for performing quantum metrology on near-term digital quantum devices.

quant-pharXiv:2609.36004•Sep 30, 2026•1 citation

Fermionic simulators for enhanced scalability of variational quantum simulation

Qingyu Li, Chiranjib Mukhopadhyay, Abolfazl Bayat

Near-term quantum simulators are mostly based on qubit-based architectures. However, their imperfect nature significantly limits their practical application. The situation is even worse for simulating fermionic systems, which underlie most of material science and chemistry, as one has to adopt fermion-to-qubit encodings which create significant additional resource overhead and trainability issues. Thanks to recent advances in trapping and manipulation of neutral atoms in optical tweezers, digital fermionic quantum simulators are becoming viable. A key question is whether these emerging fermionic simulators can outperform qubit-based simulators for characterizing strongly correlated electronic systems. Here we perform a comprehensive comparison of resource efficiency between qubit and fermionic simulators for variational ground-state emulation of fermionic systems in both condensed matter systems and quantum chemistry problems. We show that the fermionic simulators indeed outperform their qubit counterparts with respect to resources for quantum evolution (circuit depth) as well as classical optimization (number of required parameters and iterations). In addition, they show less sensitivity to the random initialization of the circuit. The relative advantage of fermionic simulators becomes even more pronounced as interaction becomes stronger, or tunneling is allowed in more than one dimension, as well as for spinful fermions. Importantly, this improvement is scalable, i.e., the performance gap between fermionic and qubit simulators only grows for bigger system sizes.

arXiv:2306.14842•Physical Review Research•Nov 27, 2023•11 citations
Abstract Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach in near-term quantum simulation to achieve practical quantum advantage over classical computers. Here, we explore variational quantum algorithms, with different levels of qubit connectivity, for digital simulation of the ground state of long-range interacting systems as well as generation of spin squeezed states. We find that as the interaction becomes more long-ranged, the variational algorithms become less efficient, achieving lower fidelity and demanding more optimization iterations. In particular, when the system is near its criticality the efficiency is even lower. Increasing the connectivity between distant qubits improves the results, even with less quantum and classical resources. Our results show that by mixing circuit layers with different levels of connectivity one can sensibly improve the performance. Interestingly, the order of layers becomes very important and grouping the layers with long-distance connectivity at the beginning of the circuit outperforms other permutations. The same design of circuits can also be used to variationally produce spin squeezed states, as a resource for quantum metrology.
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog sense, adiabatic evolution has been proposed to slowly evolve a simple Hamiltonian, initialized in its ground state, to the Hamiltonian of interest such that the final state becomes the desired ground state. Recently, variational methods have also been proposed and realized in quantum simulators for emulating the ground state of many-body systems. Here, we first provide a quantitative comparison between the adiabatic and variational methods with respect to required quantum resources on digital quantum simulators, namely the depth of the circuit and the number of two-qubit quantum gates. Our results show that the variational methods are less demanding with respect to these resources. However, they need to be hybridized with a classical optimization which can converge slowly. Therefore, as the second result of the paper, we provide two different approaches for speeding the convergence of the classical optimizer by taking a good initial guess for the parameters of the variational circuit. We show that these approaches are applicable to a wide range of Hamiltonian and provide significant improvement in the optimization procedure.
State preparation protocols ideally require as minimal operations as possible in order to be implemented in near-term, potentially noisy quantum devices. Motivated by long-range interactions (LRIs) intrinsic to many present-day experimental platforms (trapped ions, Rydberg atom arrays, etc.), we investigate the efficacy of variationally simulating nontrivial quantum states using the variational quantum-classical simulation (VQCS) protocol explored recently [W. W. Ho and T. H. Hsieh, SciPost Phys. 6, 29 (2019)], in the presence of LRIs. We show that this approach leads to extremely efficient state preparation: for example, Greenberger-Horne-Zeilinger (GHZ) states can be prepared with O(1)O(1)O(1) iterations of the protocol, and a quantum critical point of the long-range transverse-field Ising model (TFIM) can be prepared with >99>99%>99 fidelity on a 100-qubit system with only one iteration. Furthermore, we show that VQCS with LRIs is a promising route for exploring generic points in the phase diagram of the long-range TFIM. Our approach thus provides concrete, ultrafast protocols for quantum simulators equipped with long-range interactions.
Long-range entanglement is an important quantum resource, particularly for topological orders and quantum error correction. In reality, preparing long-range entangled states requires a deep unitary circuit, which poses significant experimental challenges. A promising avenue is offered by replacing some quantum resources with local operations and classical communication (LOCC). With these classical components, one can communicate outcomes of midcircuit measurements in distant subsystems, substantially reducing circuit depth in many important cases. However, to prepare general long-range entangled states, finding LOCC-assisted circuits of a short depth remains an open question. Here, to address this challenge, we propose a quantum-classical hybrid algorithm to find optimal LOCC protocols for preparing ground states of given Hamiltonians. In our algorithm, we introduce an efficient way to estimate parameter gradients and use such gradients for variational optimization. Theoretically, we establish the conditions for the absence of barren plateaus, ensuring trainability at a large system size. Numerically, the algorithm accurately solves the ground state of long-range entangled models, such as the perturbed Greenberger-Horne-Zeilinger state and surface code. Our results demonstrate the advantage of our method over conventional unitary variational circuits: the practical advantage in the accuracy of estimated ground-state energy and the theoretical advantage in creating long-range entanglement.
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.
Spin squeezed states (SSSs) are conventionally viewed as analog resources for quantum metrology. Here we develop algorithms to efficiently generate and exploit SSSs on a digital quantum computer. We introduce an adaptive local-circuit protocol that prepares SSSs with squeezing parameter ξξξ in depth O(log⁡1/ξ)\mathrm{O}\left(\log{1/ξ}\right)O(log1/ξ), yielding an exponential improvement over non-adaptive approaches. We prove that this depth is optimal for permutation symmetric SSSs by deriving a matching lower bound on entanglement entropy. We further leverage the squeezing paradigm to deterministically prepare the Dicke states using asymptotically fewer resources than prior methods. Remarkably, classical simulations of our preparation protocols under realistic noise models predicts a metrological gain of 4.2 dB beyond the standard quantum limit with 55 superconducting qubits in total including ancillae. Our work paves the way for performing quantum metrology on near-term digital quantum devices.
Near-term quantum simulators are mostly based on qubit-based architectures. However, their imperfect nature significantly limits their practical application. The situation is even worse for simulating fermionic systems, which underlie most of material science and chemistry, as one has to adopt fermion-to-qubit encodings which create significant additional resource overhead and trainability issues. Thanks to recent advances in trapping and manipulation of neutral atoms in optical tweezers, digital fermionic quantum simulators are becoming viable. A key question is whether these emerging fermionic simulators can outperform qubit-based simulators for characterizing strongly correlated electronic systems. Here we perform a comprehensive comparison of resource efficiency between qubit and fermionic simulators for variational ground-state emulation of fermionic systems in both condensed matter systems and quantum chemistry problems. We show that the fermionic simulators indeed outperform their qubit counterparts with respect to resources for quantum evolution (circuit depth) as well as classical optimization (number of required parameters and iterations). In addition, they show less sensitivity to the random initialization of the circuit. The relative advantage of fermionic simulators becomes even more pronounced as interaction becomes stronger, or tunneling is allowed in more than one dimension, as well as for spinful fermions. Importantly, this improvement is scalable, i.e., the performance gap between fermionic and qubit simulators only grows for bigger system sizes.