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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Scalable Quantum Simulation for Topological Phases on NISQ Devices

Rong-Yang Sun, Tomonori Shirakawa, Seiji Yunoki

Published Sep 17, 2023• 3 citations
Publisher

Abstract

Topological quantum phases emerge from correlated quantum many-body systems containing novel features such as nontrivial entanglement structure and mutual statistics. However, the co-emerged exponential computational complexity strongly hampers the research of these systems using classical computers. Present booming quantum computing techniques offer a new way to investigate these challenging systems: the quantum simulation approach. Combining current available noise intermediate-scale quantum (NISQ) devices with variational quantum eigensolver (VQE) algorithm to solve quantum many-body problems has attracted extensive attention. Although the NISQ devices have up to hundreds of qubits, treating a quantum many-body problem with a similar size on these devices is still impossible. One fundamental reason for this is the lack of scalability in current quantum algorithms (i.e., the required quantum resources for realizing a quantum algorithm increase much faster than the increase of the problem size). In this poster, we introduce how to realize scalable VQE calculation in the topological quantum phases by designing problem-specified scalable parameterized quantum circuits (PQC). We construct a PQC with a two-layer structure to capture both the basic entanglement structure of the target topological phase and finite correlations governed by the details of the many-body Hamiltonian. Utilizing such a PQC, we numerically simulate both symmetry-protected topological (SPT) Haldane phase and trivial dimmer phase in the non-exactly solvable alternating Heisenberg chain using the VQE algorithm. Furthermore, we realize these optimized circuits on real quantum computers provided by IBM Quantum and observe the main characterizations of the SPT Haldane phase.

DOI
10.1109/qce57702.2023.10225

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•7 citations

Variational quantum eigensolver with reduced circuit complexity

Yu Zhang, Łukasz Cincio, Christian F. A. Negre +6 more

Abstract The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenstates of a given Hamiltonian on noisy intermediate-scale quantum devices (NISQ). The practical realization is limited by the complexity of quantum circuits. Here we present an approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our ClusterVQE algorithm splits the initial qubit space into clusters which are further distributed on individual (shallower) quantum circuits. The clusters are obtained based on mutual information reflecting maximal entanglement between qubits, whereas inter-cluster correlation is taken into account via a new “dressed” Hamiltonian. ClusterVQE therefore allows exact simulation of the problem by using fewer qubits and shallower circuit depth at the cost of additional classical resources, making it a potential leader for quantum chemistry simulations on NISQ devices. Proof-of-principle demonstrations are presented for several molecular systems based on quantum simulators as well as IBM quantum devices.

arXiv:2106.07619•npj Quantum Information•Aug 12, 2022•74 citations

Preparing 100-qubit symmetry-protected topological order on a digital quantum computer

George Pennington, Kevin C. Smith, James R. Garrison +3 more

Symmetry-protected topological (SPT) phases extend the Landau paradigm of quantum matter by admitting distinct symmetry-preserving phases that lack any local order parameter. Demonstrating these phases at scale on programmable quantum processors is a key milestone in using quantum hardware to probe emergent many-body phenomena, yet it is impeded by the circuit depth normally required to capture non-trivial entanglement. Here we use a tensor network based approximate quantum compiling (AQC) protocol to construct shallow quantum circuits (18-39 CNOT depth), which prepare 100-site ground states of the spin-1/2 bond-alternating Heisenberg chain in both SPT phases, to 97.9-99.0% fidelity. Upon executing the circuits on IBM quantum hardware, the resulting states exhibit all defining signatures of SPT order including non-local string order for strings of up to length 20, characteristic degeneracies in the entanglement spectrum and clear evidence of symmetry-protected edge modes. The simultaneous observation of these independent diagnostics establishes current quantum computers as versatile platforms for large-scale studies of symmetry-protected quantum matter. More broadly, our results establish a practical foundation for probing non-equilibrium quench dynamics of such systems in regimes that challenge classical computational methods.

quant-pharXiv:2603.06325•npj Quantum Information•Mar 9, 2026•0 citations

Variational quantum eigensolver for SU( N ) fermions

Mirko Consiglio, Wayne Jordan Chetcuti, Carlos Bravo-Prieto +5 more

Abstract Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum (NISQ) computers, by using a classical optimizer to train a parameterized quantum circuit to solve tractable quantum problems. The variational quantum eigensolver (VQE) is one of the aforementioned algorithms designed to determine the ground-state of many-body Hamiltonians. Here, we apply the VQE to study the ground-state properties of N -component fermions. With such knowledge, we study the persistent current of interacting SU( N ) fermions, which is employed to reliably map out the different quantum phases of the system. Our approach lays out the basis for a current-based quantum simulator of many-body systems that can be implemented on NISQ computers.

arXiv:2106.15552•Journal of Physics A Mathematical and Theoretical•May 16, 2022•15 citations

Scalable Quantum Ground State Preparation of the Heisenberg Model: A Variational Quantum Eigensolver Approach

Wang, Jinao, Rimika Jaiswal

Quantum systems have historically been formidable to simulate using classical computational methods, particularly as the system size grows. In recent years, advancements in quantum computing technology have offered new opportunities for tackling complex quantum systems, potentially enabling the study and preparation of quantum states directly on quantum processors themselves. The Variational Quantum Eigensolver (VQE) algorithm is a system composed of a quantum circuit as well as a classical optimizer that can be used to efficiently prepare interesting many-body states on the current noisy intermediate-scale quantum (NISQ) devices. We assess the efficacy and scalability of VQE by preparing the ground states of the 1D generalized Heisenberg model, a pivotal model in understanding magnetic materials. We present an ansatz capable of preparing the ground states for all possible values of the coupling, including the critical states for the anisotropic XXZ model. This paper also aims to provide insights into the precision and time consumption involved in classical and optimized sampling approaches in the calculation of expectation values. In preparing the ground state for the Heisenberg models, this paper paves the way for more efficient quantum algorithms and contributes to the broader field of condensed matter physics.

arXiv:2308.12020•Aug 23, 2023•1 citation

Symmetry-Preserving Variational Quantum Simulation of the Heisenberg Spin Chain on Noisy Quantum Hardware

Rudraksh Sharma

Variational quantum algorithms are among the most promising approaches for simulating interacting quantum many-body systems on noisy intermediate-scale quantum (NISQ) devices. However, the practical success of variational quantum eigensolvers (VQE) critically depends on the structure of the chosen variational ansatz. In this work, we investigate the ground-state properties of the one-dimensional antiferromagnetic Heisenberg spin-1/2 chain using both generic hardware-efficient ansatz and physics-informed, symmetry-preserving variational circuits. We benchmark variational results against exact diagonalization and noiseless simulations, and subsequently validate the approach on real IQM Garnet quantum hardware. Our results demonstrate that incorporating physical symmetries into the circuit design leads to significantly improved energy estimates, enhanced robustness against hardware noise, and clearer convergence behavior when compared to hardware-efficient ansatz under identical resource constraints. These findings highlight the importance of problem specific ansatz construction for reliable quantum simulations in the NISQ era.

quant-pharXiv:2512.23009•Dec 30, 2025•0 citations
Topological quantum phases emerge from correlated quantum many-body systems containing novel features such as nontrivial entanglement structure and mutual statistics. However, the co-emerged exponential computational complexity strongly hampers the research of these systems using classical computers. Present booming quantum computing techniques offer a new way to investigate these challenging systems: the quantum simulation approach. Combining current available noise intermediate-scale quantum (NISQ) devices with variational quantum eigensolver (VQE) algorithm to solve quantum many-body problems has attracted extensive attention. Although the NISQ devices have up to hundreds of qubits, treating a quantum many-body problem with a similar size on these devices is still impossible. One fundamental reason for this is the lack of scalability in current quantum algorithms (i.e., the required quantum resources for realizing a quantum algorithm increase much faster than the increase of the problem size). In this poster, we introduce how to realize scalable VQE calculation in the topological quantum phases by designing problem-specified scalable parameterized quantum circuits (PQC). We construct a PQC with a two-layer structure to capture both the basic entanglement structure of the target topological phase and finite correlations governed by the details of the many-body Hamiltonian. Utilizing such a PQC, we numerically simulate both symmetry-protected topological (SPT) Haldane phase and trivial dimmer phase in the non-exactly solvable alternating Heisenberg chain using the VQE algorithm. Furthermore, we realize these optimized circuits on real quantum computers provided by IBM Quantum and observe the main characterizations of the SPT Haldane phase.
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.
Abstract The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenstates of a given Hamiltonian on noisy intermediate-scale quantum devices (NISQ). The practical realization is limited by the complexity of quantum circuits. Here we present an approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our ClusterVQE algorithm splits the initial qubit space into clusters which are further distributed on individual (shallower) quantum circuits. The clusters are obtained based on mutual information reflecting maximal entanglement between qubits, whereas inter-cluster correlation is taken into account via a new “dressed” Hamiltonian. ClusterVQE therefore allows exact simulation of the problem by using fewer qubits and shallower circuit depth at the cost of additional classical resources, making it a potential leader for quantum chemistry simulations on NISQ devices. Proof-of-principle demonstrations are presented for several molecular systems based on quantum simulators as well as IBM quantum devices.
Symmetry-protected topological (SPT) phases extend the Landau paradigm of quantum matter by admitting distinct symmetry-preserving phases that lack any local order parameter. Demonstrating these phases at scale on programmable quantum processors is a key milestone in using quantum hardware to probe emergent many-body phenomena, yet it is impeded by the circuit depth normally required to capture non-trivial entanglement. Here we use a tensor network based approximate quantum compiling (AQC) protocol to construct shallow quantum circuits (18-39 CNOT depth), which prepare 100-site ground states of the spin-1/2 bond-alternating Heisenberg chain in both SPT phases, to 97.9-99.0% fidelity. Upon executing the circuits on IBM quantum hardware, the resulting states exhibit all defining signatures of SPT order including non-local string order for strings of up to length 20, characteristic degeneracies in the entanglement spectrum and clear evidence of symmetry-protected edge modes. The simultaneous observation of these independent diagnostics establishes current quantum computers as versatile platforms for large-scale studies of symmetry-protected quantum matter. More broadly, our results establish a practical foundation for probing non-equilibrium quench dynamics of such systems in regimes that challenge classical computational methods.
Abstract Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum (NISQ) computers, by using a classical optimizer to train a parameterized quantum circuit to solve tractable quantum problems. The variational quantum eigensolver (VQE) is one of the aforementioned algorithms designed to determine the ground-state of many-body Hamiltonians. Here, we apply the VQE to study the ground-state properties of N -component fermions. With such knowledge, we study the persistent current of interacting SU( N ) fermions, which is employed to reliably map out the different quantum phases of the system. Our approach lays out the basis for a current-based quantum simulator of many-body systems that can be implemented on NISQ computers.
Quantum systems have historically been formidable to simulate using classical computational methods, particularly as the system size grows. In recent years, advancements in quantum computing technology have offered new opportunities for tackling complex quantum systems, potentially enabling the study and preparation of quantum states directly on quantum processors themselves. The Variational Quantum Eigensolver (VQE) algorithm is a system composed of a quantum circuit as well as a classical optimizer that can be used to efficiently prepare interesting many-body states on the current noisy intermediate-scale quantum (NISQ) devices. We assess the efficacy and scalability of VQE by preparing the ground states of the 1D generalized Heisenberg model, a pivotal model in understanding magnetic materials. We present an ansatz capable of preparing the ground states for all possible values of the coupling, including the critical states for the anisotropic XXZ model. This paper also aims to provide insights into the precision and time consumption involved in classical and optimized sampling approaches in the calculation of expectation values. In preparing the ground state for the Heisenberg models, this paper paves the way for more efficient quantum algorithms and contributes to the broader field of condensed matter physics.
Variational quantum algorithms are among the most promising approaches for simulating interacting quantum many-body systems on noisy intermediate-scale quantum (NISQ) devices. However, the practical success of variational quantum eigensolvers (VQE) critically depends on the structure of the chosen variational ansatz. In this work, we investigate the ground-state properties of the one-dimensional antiferromagnetic Heisenberg spin-1/2 chain using both generic hardware-efficient ansatz and physics-informed, symmetry-preserving variational circuits. We benchmark variational results against exact diagonalization and noiseless simulations, and subsequently validate the approach on real IQM Garnet quantum hardware. Our results demonstrate that incorporating physical symmetries into the circuit design leads to significantly improved energy estimates, enhanced robustness against hardware noise, and clearer convergence behavior when compared to hardware-efficient ansatz under identical resource constraints. These findings highlight the importance of problem specific ansatz construction for reliable quantum simulations in the NISQ era.