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:2204.03013 · Physical Review A

Adiabatic quantum algorithm for artificial graphene

Axel Pérez-Obiol, Adrián Pérez-Salinas, Sergio Sanchez, Bruna G. M. Araújo, Artur García-Sáez

Published Nov 8, 2022• 11 citations
arXivHTMLPDF

Abstract

We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. The algorithm implements a Trotterized adiabatic evolution from a purely tight-binding Hamiltonian to one including kinetic, spin-orbit, and Coulomb terms. The initial state is obtained efficiently using Gaussian-state preparation, while the readout of the ground energy is organized into seventeen sets of measurements, irrespective of the size of the problem. The total depth of the corresponding quantum circuit scales polynomially with the size of the system. A full simulation of the algorithm is performed and ground energies are obtained for lattices with up to four hexagons. Our results are benchmarked with exact diagonalization for systems with one and two hexagons. For larger systems we use the exact state vector and approximate matrix product state simulation techniques. The latter allows us to systematically trade off precision with memory and therefore to tackle larger systems. We analyze adiabatic and Trotterization errors, providing estimates for optimal periods and time discretizations given a finite accuracy. In the case of large systems we also study approximation errors.

DOI
10.1103/physreva.106.052408

Related papers

Quantum simulation of the Hubbard model on a graphene hexagon: strengths of IQPE and noise constraints

M. Mirzakhani, Kyungsun Moon

Quantum computing offers transformative potential for simulating real-world materials, providing a powerful platform to investigate complex quantum systems across quantum chemistry and condensed matter physics. In this work, we leverage this capability to simulate the Hubbard model on a six-site graphene hexagon using Qiskit, employing the Iterative Quantum Phase Estimation (IQPE) and adiabatic evolution algorithms to determine its ground-state properties. Our results show that a single Slater determinant is sufficient to initialize IQPE and accurately recover ground-state energies (GSEs) in small-scale Hubbard systems. In noiseless simulations, IQPE converges within a few iterations to exact GSEs, while adiabatic simulations yield charge and spin densities and correlation functions in excellent agreement with exact diagonalization. However, deploying IQPE and adiabatic evolution on today’s noisy quantum hardware remains highly challenging. To investigate these limitations in IQPE, we use the Qiskit Aer simulator with a custom noise model tailored to the characteristics of IBM’s real hardware. This model includes realistic depolarizing gate errors, thermal relaxation, and readout noise, allowing us to explore how these factors degrade simulation accuracy. Further, we implement the IQPE algorithm on IBM’s ibm_strasbourg and ibm_fez devices for a reduced three-site Hubbard model, enabling direct comparison between simulated and real hardware noise. While ibm_fez runs closely match exact results, discrepancies highlight the gap between modeled and physical noise. Extending the study to systems up to $N=6$ sites, we benchmark IQPE’s scalability, demonstrating its potential and current limitations for simulating strongly correlated materials under realistic conditions.

arXiv:2506.05031•EPJ Quantum Technology•Nov 18, 2025•0 citations

Practicality of a quantum adiabatic algorithm for chemistry applications

Etienne Granet, Khaldoon Ghanem, Henrik Dreyer

Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for this are the large number of gates required for Trotterizing time-dependent electronic structure Hamiltonians, as well as discretization errors heating the state. We show that a recently proposed randomized algorithm [E. Granet and H. Dreyer, npj Quantum Inf. 10, 82 (2024)], which implements exact adiabatic evolution without heating and with far fewer gates than Trotterization, can overcome this problem. We develop three methods for measuring the energy of the prepared state in an efficient and noise-resilient manner, yielding chemically accurate results on a four-qubit molecule in the presence of realistic gate noise, without the need for error mitigation. These findings suggest that adiabatic approaches to state preparation could play a key role in quantum chemistry simulations both in the era of noisy as well as error-corrected quantum computers.

arXiv:2407.09993•Physical Review A•Feb 18, 2025•11 citations

Band structure of two-dimensional graphene and of one-dimensional nanoribbons via variational quantum algorithms: from energies to wavefunction quality

Raúl Medrano Millán, Rodrigo Gil-Merino y Rubio, J. Borge +1 more

Simulating quantum many-body systems classically encounters exponential bottlenecks, which quantum devices circumvent by natively encoding wavefunctions. In the Noisy Intermediate-Scale Quantum (NISQ) era, however, hardware noise constrains simulation accuracy. As a stepping stone toward strongly correlated materials, we compute the band structure of 2D monolayer graphene and 1D nanoribbons (zigzag and armchair) using a single variational workflow in the $p_z$ tight-binding approximation. Non-interacting ground states also provide essential initial reference states for subspace and warm-started variational methods to solve interacting spectra. By mapping the Bloch Hamiltonian to Pauli operators, we extract the ground band via the Variational Quantum Eigensolver (VQE) and excited subbands via Variational Quantum Deflation (VQD), validating our approach from ideal simulations to execution on physical IBM Quantum processors. In ideal simulations, the workflow reproduces exact diagonalization results with high precision, whereas hardware noise introduces energy deviations of a few hundredths of the hopping parameter. While qubit counts scale logarithmically with ribbon width, fixed-depth ansatz accuracy degrades with Hilbert space dimension. Crucially, deepening the ansatz improves ideal simulation accuracy by over three orders of magnitude but worsens energy estimates under noise, proving that practical circuit depth is bounded by hardware noise rather than expressivity. Finally, we complement energy evaluations with a wavefunction-level diagnostic measuring subspace containment. This diagnostic captures degenerate manifolds and exposes optimization failure modes disguised by energy agreement alone. Operating directly on NISQ hardware, this validated workflow establishes a controlled baseline for studying topological and strongly correlated phases in realistic materials.

arXiv:2611.04975•Nov 3, 2026•0 citations

Alternative adiabatic quantum dynamics with algorithmic applications

Joseph Cunningham, Jérémie Roland

In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the adiabatic theorem. We propose several alternative processes that achieve the same goal, but can easily be implemented on a gate-based quantum computer without the overhead of simulating time-dependent Hamiltonian evolution. We give a general framework for deriving `adiabatic' theorems for these processes. As an application, we give various algorithms for solving the Quantum Linear Systems Problem (QLSP) with optimal scaling in the condition number. One of these algorithms was previously developed in [Cunningham, Roland 2024] and another can be seen as a randomised version of the discrete adiabatic algorithm of [Costa et al. 2022]. We also describe versions of Trotterisation in our framework, which allows several results from [An et al. 2025] to be reproduced in a randomised setting. In particular, bounds on the Trotter error in terms of the fidelity are obtained that are asymptotically better than the standard bounds.

quant-pharXiv:2605.30110•May 29, 2026•2 citations

Digital quantum state preparation by nucleation

Jean Paul Sadia, Morten Hjorth-Jensen, Dean Lee +1 more

Quantum state preparation is crucial for quantum algorithms, and improved state preparation methods can reduce resource requirements by orders of magnitude. In this work, we introduce a state preparation method for lattice Hamiltonians on digital quantum computers inspired by nucleation. In our method, the exact ground state of a small lattice Hamiltonian is prepared in a quantum circuit, then a series of growth stages are performed via Trotterized adiabatic evolution to increase the size of the lattice to the desired model. Using the adiabatic theorem and Trotter error bounds, we provide sufficient conditions on the total evolution time and number of Trotter steps required for nucleation to prepare an initial state with desired fidelity. In addition, we introduce optimized nucleation which considers variational optimization on top of the nucleation structure. For a two-dimensional Ising model, we show that optimized nucleation can outperform a current leading method for state preparation on digital quantum computers.

quant-pharXiv:2609.37527•Sep 30, 2026•0 citations

Efficient Quantum Algorithm for Filtering Product States

Reinis Irmejs, Mari Carmen Bañuls, J. I. Cirac

We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width δ . Given a local Hamiltonian on N qubits, we construct a parent Hamiltonian whose ground state corresponds to the filtered product state with variable energy variance proportional to δN . We prove that the parent Hamiltonian is gapped and its ground state can be efficiently implemented in poly(N,1/δ) time via adiabatic evolution. We numerically benchmark the algorithm for a particular non-integrable model and find that the adiabatic evolution time to prepare the filtered state with a width δ is independent of the system size N . Furthermore, the adiabatic evolution can be implemented with circuit depth O(N2δ−4) . Our algorithm provides a way to study the finite energy regime of many body systems in quantum simulators by directly preparing a finite energy state, providing access to an approximation of the microcanonical properties at an arbitrary energy.

arXiv:2312.13892•Quantum•Jun 27, 2024•12 citations
We devise a quantum-circuit algorithm to solve the ground state and ground energy of artificial graphene. The algorithm implements a Trotterized adiabatic evolution from a purely tight-binding Hamiltonian to one including kinetic, spin-orbit, and Coulomb terms. The initial state is obtained efficiently using Gaussian-state preparation, while the readout of the ground energy is organized into seventeen sets of measurements, irrespective of the size of the problem. The total depth of the corresponding quantum circuit scales polynomially with the size of the system. A full simulation of the algorithm is performed and ground energies are obtained for lattices with up to four hexagons. Our results are benchmarked with exact diagonalization for systems with one and two hexagons. For larger systems we use the exact state vector and approximate matrix product state simulation techniques. The latter allows us to systematically trade off precision with memory and therefore to tackle larger systems. We analyze adiabatic and Trotterization errors, providing estimates for optimal periods and time discretizations given a finite accuracy. In the case of large systems we also study approximation errors.
Quantum computing offers transformative potential for simulating real-world materials, providing a powerful platform to investigate complex quantum systems across quantum chemistry and condensed matter physics. In this work, we leverage this capability to simulate the Hubbard model on a six-site graphene hexagon using Qiskit, employing the Iterative Quantum Phase Estimation (IQPE) and adiabatic evolution algorithms to determine its ground-state properties. Our results show that a single Slater determinant is sufficient to initialize IQPE and accurately recover ground-state energies (GSEs) in small-scale Hubbard systems. In noiseless simulations, IQPE converges within a few iterations to exact GSEs, while adiabatic simulations yield charge and spin densities and correlation functions in excellent agreement with exact diagonalization. However, deploying IQPE and adiabatic evolution on today’s noisy quantum hardware remains highly challenging. To investigate these limitations in IQPE, we use the Qiskit Aer simulator with a custom noise model tailored to the characteristics of IBM’s real hardware. This model includes realistic depolarizing gate errors, thermal relaxation, and readout noise, allowing us to explore how these factors degrade simulation accuracy. Further, we implement the IQPE algorithm on IBM’s ibm_strasbourg and ibm_fez devices for a reduced three-site Hubbard model, enabling direct comparison between simulated and real hardware noise. While ibm_fez runs closely match exact results, discrepancies highlight the gap between modeled and physical noise. Extending the study to systems up to N=6N=6N=6 sites, we benchmark IQPE’s scalability, demonstrating its potential and current limitations for simulating strongly correlated materials under realistic conditions.
Despite its simplicity and strong theoretical guarantees, adiabatic state preparation has received considerably less interest than variational approaches for the preparation of low-energy electronic structure states. Two major reasons for this are the large number of gates required for Trotterizing time-dependent electronic structure Hamiltonians, as well as discretization errors heating the state. We show that a recently proposed randomized algorithm [E. Granet and H. Dreyer, npj Quantum Inf. 10, 82 (2024)], which implements exact adiabatic evolution without heating and with far fewer gates than Trotterization, can overcome this problem. We develop three methods for measuring the energy of the prepared state in an efficient and noise-resilient manner, yielding chemically accurate results on a four-qubit molecule in the presence of realistic gate noise, without the need for error mitigation. These findings suggest that adiabatic approaches to state preparation could play a key role in quantum chemistry simulations both in the era of noisy as well as error-corrected quantum computers.
Simulating quantum many-body systems classically encounters exponential bottlenecks, which quantum devices circumvent by natively encoding wavefunctions. In the Noisy Intermediate-Scale Quantum (NISQ) era, however, hardware noise constrains simulation accuracy. As a stepping stone toward strongly correlated materials, we compute the band structure of 2D monolayer graphene and 1D nanoribbons (zigzag and armchair) using a single variational workflow in the pzp_zpz​ tight-binding approximation. Non-interacting ground states also provide essential initial reference states for subspace and warm-started variational methods to solve interacting spectra. By mapping the Bloch Hamiltonian to Pauli operators, we extract the ground band via the Variational Quantum Eigensolver (VQE) and excited subbands via Variational Quantum Deflation (VQD), validating our approach from ideal simulations to execution on physical IBM Quantum processors. In ideal simulations, the workflow reproduces exact diagonalization results with high precision, whereas hardware noise introduces energy deviations of a few hundredths of the hopping parameter. While qubit counts scale logarithmically with ribbon width, fixed-depth ansatz accuracy degrades with Hilbert space dimension. Crucially, deepening the ansatz improves ideal simulation accuracy by over three orders of magnitude but worsens energy estimates under noise, proving that practical circuit depth is bounded by hardware noise rather than expressivity. Finally, we complement energy evaluations with a wavefunction-level diagnostic measuring subspace containment. This diagnostic captures degenerate manifolds and exposes optimization failure modes disguised by energy agreement alone. Operating directly on NISQ hardware, this validated workflow establishes a controlled baseline for studying topological and strongly correlated phases in realistic materials.
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the adiabatic theorem. We propose several alternative processes that achieve the same goal, but can easily be implemented on a gate-based quantum computer without the overhead of simulating time-dependent Hamiltonian evolution. We give a general framework for deriving `adiabatic' theorems for these processes. As an application, we give various algorithms for solving the Quantum Linear Systems Problem (QLSP) with optimal scaling in the condition number. One of these algorithms was previously developed in [Cunningham, Roland 2024] and another can be seen as a randomised version of the discrete adiabatic algorithm of [Costa et al. 2022]. We also describe versions of Trotterisation in our framework, which allows several results from [An et al. 2025] to be reproduced in a randomised setting. In particular, bounds on the Trotter error in terms of the fidelity are obtained that are asymptotically better than the standard bounds.
Quantum state preparation is crucial for quantum algorithms, and improved state preparation methods can reduce resource requirements by orders of magnitude. In this work, we introduce a state preparation method for lattice Hamiltonians on digital quantum computers inspired by nucleation. In our method, the exact ground state of a small lattice Hamiltonian is prepared in a quantum circuit, then a series of growth stages are performed via Trotterized adiabatic evolution to increase the size of the lattice to the desired model. Using the adiabatic theorem and Trotter error bounds, we provide sufficient conditions on the total evolution time and number of Trotter steps required for nucleation to prepare an initial state with desired fidelity. In addition, we introduce optimized nucleation which considers variational optimization on top of the nucleation structure. For a two-dimensional Ising model, we show that optimized nucleation can outperform a current leading method for state preparation on digital quantum computers.
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width δ . Given a local Hamiltonian on N qubits, we construct a parent Hamiltonian whose ground state corresponds to the filtered product state with variable energy variance proportional to δN . We prove that the parent Hamiltonian is gapped and its ground state can be efficiently implemented in poly(N,1/δ) time via adiabatic evolution. We numerically benchmark the algorithm for a particular non-integrable model and find that the adiabatic evolution time to prepare the filtered state with a width δ is independent of the system size N . Furthermore, the adiabatic evolution can be implemented with circuit depth O(N2δ−4) . Our algorithm provides a way to study the finite energy regime of many body systems in quantum simulators by directly preparing a finite energy state, providing access to an approximation of the microcanonical properties at an arbitrary energy.