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:2505.18027 · Journal of Chemical Theory and Computation

A Variational Quantum Eigensolver Based on the Measurement Scheme Tailored to Multiband Tight-Binding Simulations

Dongkeun Lee, Hoon Ryu

Published Aug 26, 2025• 0 citations
arXivHTMLPDF

Abstract

High Resolution Image Download MS PowerPoint Slide We propose a cost-efficient measurement scheme of the variational quantum eigensolver (VQE) for atomistic simulations of electronic structures based on a tight-binding (TB) theory. Leveraging the lattice geometry of a material domain, the sparse TB Hamiltonian is constructed in a bottom-up manner and is represented as a linear combination of the standard-basis (SB) operators. The cost function is evaluated with an extended version of the Bell measurement circuit that can simultaneously measure multiple SB operators and therefore reduces the number of circuits required by the evaluation process. The proposed VQE scheme is applied to find band gap energies of metal-halide-perovskite supercells that have finite dimensions with closed boundaries and are described with an sp 3 TB model. Experimental results confirm that the proposed scheme gives solutions that follow well the accurate ones but, more importantly, has computing efficiency that is obviously superior to the commutativity-based Pauli grouping methods. Extending the application scope of VQE to three-dimensional confined atomic structures, this work can serve as a practical guideline for handling TB simulations and, more generally, for calculations of sparse Hermitian matrices in the noise-intermediate-scale quantum devices.

DOI
10.1021/acs.jctc.5c00961

Related papers

Minimum measurements quantum protocol for band structure calculation

Michal Krejčí, Lucie Krejčí, Ijaz Ahamed Mohammad +2 more

Protocols for quantum measurement are an essential part of quantum computing. Measurements are no longer confined to the final step of computation but are increasingly embedded within quantum circuits as integral components of noise-resilient algorithms. However, each observable typically requires a distinct measurement basis, often demanding a different circuit configuration. As the number of such configurations typically grows with the number of qubits, measurements constitute a major bottleneck. Focusing on electronic structure calculations in crystalline systems, we propose a measurement protocol that restricts the required measurement configurations to an absolute minimum of just three, independent of the number of qubits. This makes it one of the few known protocols that do not scale with qubit number. In particular, we derive the measurement protocol from the symmetries of tight-binding (TB) Hamiltonians and implement it within the Orthogonal-Ansatz Variational Quantum Eigensolver (OA-VQE) algorithm. We demonstrate its performance on three systems, namely a two-dimensional CuO$_2$ square lattice (3 qubits), bilayer graphene with hexagonal (Honeycomb) lattice (4 qubits) and three-dimensional diamond lattice (10 qubits). Beyond tight-binding systems, the protocol can be extended to enable efficient initial state preparation for many-body Hamiltonians, such as multi-orbital Hubbard models in a momentum space.

quant-pharXiv:2511.04389•Nov 7, 2025•0 citations

Quantum computing of the electronic structure of crystals by the Variational Quantum Deflation algorithm

Michal Ďuriška, Ivana Miháliková, Martin Friák

Abstract Variational Quantum Eigensolver (VQE) and its extension, Variational Quantum Deflation (VQD), have emerged as promising algorithms for computing ground and excited state energy eigenvalues of Hamiltonians, particularly in quantum physics, chemistry, and materials science. Recently, the VQE and VQD algorithms were implemented to calculate the electronic band structure described by the tight-binding Hamiltonian. Despite their success for simple models, scalability remains a challenge due to the need for a large number of circuit executions, limited qubit coherence times, and low gate fidelities. In this work, we implemented the VQE and VQD algorithms for tight-binding models of diamond and zincblende crystal structures (Sn, C, Si, Ge, AlP, AlAs, AlSb, and GaP) using a quantum computer simulator. We investigate the scalability challenges, focusing on the significant overhead caused by a large number of quantum circuit executions required to find the energy eigenvalues. Our analysis highlights the substantial amount of both measurement and optimization overheads in VQD, particularly as the number of excited states increases. Based on our findings, we critically discuss the implications of implementing VQD on current noisy intermediate-scale quantum (NISQ) devices.

Physica Scripta•Feb 27, 2025•6 citations

Minimum measurements quantum protocol for band structure calculations

Michal Krejčí, Lucie Krejčí, Ijaz Ahamed Mohammad +2 more

Abstract Protocols for quantum measurement are an essential part of quantum computing. Measurements are no longer confined to the final step of computation but are increasingly embedded within quantum circuits as integral components of noise-resilient algorithms. However, each observable typically requires a distinct measurement basis, often demanding a different circuit configuration. As the number of such configurations typically grows with the number of qubits, measurements constitute a major bottleneck. Focusing on electronic structure calculations in crystalline systems, we propose a measurement protocol that restricts the required measurement configurations to an absolute minimum of just three, independent of the number of qubits. This makes it one of the few known protocols that do not scale with qubit number. In particular, we derive the measurement protocol from the symmetries of tight-binding (TB) Hamiltonians and implement it within the Orthogonal-Ansatz variational quantum eigensolver algorithm. We demonstrate its performance on three systems, namely a two-dimensional CuO 2 square lattice (3 qubits), bilayer graphene with hexagonal (Honeycomb) lattice (4 qubits) and three-dimensional diamond lattice (10 qubits). Beyond TB systems, the protocol can be extended to enable efficient initial state preparation for many-body Hamiltonians, such as multi-orbital Hubbard models in a momentum space.

Quantum Science and Technology•Jul 15, 2026•0 citations

SlaKoNet-VQD: A universal Slater-Koster tight-binding Hamiltonian for variational quantum band-structure calculations on near-term hardware

Akshaya Ajith, Jaehyung Lee, Charles Rhys Campbell +1 more

Abstract Variational quantum algorithms such as the variational quantum eigensolver (VQE) and variational quantum deflation (VQD) have emerged as leading candidates for computing electronic structure on near-term quantum hardware. For periodic solids, however, their reach has been limited not by the quantum algorithm itself but by the cost of constructing a faithful second-quantized Hamiltonian for each material, typically via density-functional theory (DFT) followed by Wannierization or by hand-fitted empirical tight-binding parameters. SlaKoNet, a recently developed method, significantly reduces the computational cost of electronic Hamiltonian construction with a small accuracy tradeoff. It integrates modern deep-learning methods and the Slater-Koster tight-binding formalism to fit thousands of onsite and distance-dependent hopping and overlap tight-binding parameters across 65 elements of the periodic table. After fitting, these parameters can be used to deterministically construct an electronic Hamiltonian for any crystal made up of any of the 65 elements in the training set, and the crystal's band structure can subsequently be computed. In this work, we combine a SlaKoNet model trained on the JARVIS-TBmBJ dataset with a Qiskit-based variational quantum deflation algorithm, replacing the traditional and costly Hamiltonian construction step with a universal neural Hamiltonian generator. Within the 65-element set, the resulting SlaKoNet-VQD workflow is structure-agnostic, fully differentiable, fast, and suited to high-throughput screening of band structures. We benchmark the workflow on silicon, recovering the full eight-band band structure along the standard high-symmetry k-path with a mean absolute deviation of 1.78 meV from exact diagonalization on a 3-qubit statevector simulator. We further compute the full band structure for five additional conventional superconductors, Al, Ta, Nb, V, and ZrN, achieving a mean absolute deviation within approximately 1.8 meV, and demonstrate full execution of SlaKoNet-VQD on IBM Quantum hardware for a representative k-point ground-state calculation on aluminum with a mean absolute error of roughly 0.37 eV. Beyond the single-particle level, we promote the same SlaKoNet Hamiltonian to a correlated Hubbard model and solve it with dynamical mean-field theory, recovering the weakening of correlations across the group-5 metals and strong quasiparticle renormalization in the cuprate La₂CuO₄, and we identify the resulting impurity problem as the natural target for a quantum solver. The pipeline opens a path to high-throughput benchmarking of variational quantum algorithms across the periodic table and to gradient-based co-optimization of ansatz and Hamiltonian for materials discovery. An interactive web app is available at https://atomgpt.org/quantum.

arXiv:2607.09761•Oct 13, 2026•0 citations

Efficient measurement schemes for the Monte Carlo projective quantum eigensolver

Divye Baid, Maria-Andreea Filip

The Monte Carlo Projective Quantum Eigensolver (MC-PQE) was recently introduced as an alternative to hybrid algorithms like the variational quantum eigensolver (VQE). By using a quantum Monte Carlo-inspired scheme for energy estimation, MC\nobreakdash-PQE was found to decrease the required measurement cost relative to comparable conventional approaches. However, in the context of VQE, numerous techniques have been developed to reduce the measurement overhead by joint measurement of multiple observables. In this work, we extend these approaches to the asymmetric expectation values required in MC-PQE and assess the performance of different techniques for various molecular systems of up to 12 qubits. We find full commuting Pauli term grouping combined with tailored measurement allocation techniques leads to a 5-10$\times$ reduction in standard error for the same total number of quantum measurements. Conventional Hamiltonian grouped measurement outperforms tractable classical shadows tomography based techniques for the considered systems.

quant-pharXiv:2608.30612•Sep 1, 2026•0 citations

Variational Quantum Eigensolvers for Sparse Hamiltonians

William M. Kirby, Peter J. Love

Hybrid quantum-classical variational algorithms such as the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA) are promising applications for noisy, intermediate-scale quantum computers. Both VQE and QAOA variationally extremize the expectation value of a Hamiltonian. All work to date on VQE and QAOA has been limited to Pauli representations of Hamiltonians. However, many cases exist in which a sparse representation of the Hamiltonian is known but there is no efficient Pauli representation. We extend VQE to general sparse Hamiltonians. We provide a decomposition of a fermionic second-quantized Hamiltonian into a number of one-sparse, self-inverse, Hermitian terms linear in the number of ladder operator monomials in the second-quantized representation. We provide a decomposition of a general d-sparse Hamiltonian into O(d^{2}) such terms. In both cases, a single sample of any term can be obtained using two ansatz state preparations and at most six oracle queries. The number of samples required to estimate the expectation value to precision ε scales as ε^{-2} as for Pauli-based VQE. This widens the domain of applicability of VQE to systems whose Hamiltonian and other observables are most efficiently described in terms of sparse matrices.

arXiv:2012.07171•Physical Review Letters•Sep 9, 2021•43 citations
High Resolution Image Download MS PowerPoint Slide We propose a cost-efficient measurement scheme of the variational quantum eigensolver (VQE) for atomistic simulations of electronic structures based on a tight-binding (TB) theory. Leveraging the lattice geometry of a material domain, the sparse TB Hamiltonian is constructed in a bottom-up manner and is represented as a linear combination of the standard-basis (SB) operators. The cost function is evaluated with an extended version of the Bell measurement circuit that can simultaneously measure multiple SB operators and therefore reduces the number of circuits required by the evaluation process. The proposed VQE scheme is applied to find band gap energies of metal-halide-perovskite supercells that have finite dimensions with closed boundaries and are described with an sp 3 TB model. Experimental results confirm that the proposed scheme gives solutions that follow well the accurate ones but, more importantly, has computing efficiency that is obviously superior to the commutativity-based Pauli grouping methods. Extending the application scope of VQE to three-dimensional confined atomic structures, this work can serve as a practical guideline for handling TB simulations and, more generally, for calculations of sparse Hermitian matrices in the noise-intermediate-scale quantum devices.
Protocols for quantum measurement are an essential part of quantum computing. Measurements are no longer confined to the final step of computation but are increasingly embedded within quantum circuits as integral components of noise-resilient algorithms. However, each observable typically requires a distinct measurement basis, often demanding a different circuit configuration. As the number of such configurations typically grows with the number of qubits, measurements constitute a major bottleneck. Focusing on electronic structure calculations in crystalline systems, we propose a measurement protocol that restricts the required measurement configurations to an absolute minimum of just three, independent of the number of qubits. This makes it one of the few known protocols that do not scale with qubit number. In particular, we derive the measurement protocol from the symmetries of tight-binding (TB) Hamiltonians and implement it within the Orthogonal-Ansatz Variational Quantum Eigensolver (OA-VQE) algorithm. We demonstrate its performance on three systems, namely a two-dimensional CuO2_22​ square lattice (3 qubits), bilayer graphene with hexagonal (Honeycomb) lattice (4 qubits) and three-dimensional diamond lattice (10 qubits). Beyond tight-binding systems, the protocol can be extended to enable efficient initial state preparation for many-body Hamiltonians, such as multi-orbital Hubbard models in a momentum space.
Abstract Variational Quantum Eigensolver (VQE) and its extension, Variational Quantum Deflation (VQD), have emerged as promising algorithms for computing ground and excited state energy eigenvalues of Hamiltonians, particularly in quantum physics, chemistry, and materials science. Recently, the VQE and VQD algorithms were implemented to calculate the electronic band structure described by the tight-binding Hamiltonian. Despite their success for simple models, scalability remains a challenge due to the need for a large number of circuit executions, limited qubit coherence times, and low gate fidelities. In this work, we implemented the VQE and VQD algorithms for tight-binding models of diamond and zincblende crystal structures (Sn, C, Si, Ge, AlP, AlAs, AlSb, and GaP) using a quantum computer simulator. We investigate the scalability challenges, focusing on the significant overhead caused by a large number of quantum circuit executions required to find the energy eigenvalues. Our analysis highlights the substantial amount of both measurement and optimization overheads in VQD, particularly as the number of excited states increases. Based on our findings, we critically discuss the implications of implementing VQD on current noisy intermediate-scale quantum (NISQ) devices.
Abstract Protocols for quantum measurement are an essential part of quantum computing. Measurements are no longer confined to the final step of computation but are increasingly embedded within quantum circuits as integral components of noise-resilient algorithms. However, each observable typically requires a distinct measurement basis, often demanding a different circuit configuration. As the number of such configurations typically grows with the number of qubits, measurements constitute a major bottleneck. Focusing on electronic structure calculations in crystalline systems, we propose a measurement protocol that restricts the required measurement configurations to an absolute minimum of just three, independent of the number of qubits. This makes it one of the few known protocols that do not scale with qubit number. In particular, we derive the measurement protocol from the symmetries of tight-binding (TB) Hamiltonians and implement it within the Orthogonal-Ansatz variational quantum eigensolver algorithm. We demonstrate its performance on three systems, namely a two-dimensional CuO 2 square lattice (3 qubits), bilayer graphene with hexagonal (Honeycomb) lattice (4 qubits) and three-dimensional diamond lattice (10 qubits). Beyond TB systems, the protocol can be extended to enable efficient initial state preparation for many-body Hamiltonians, such as multi-orbital Hubbard models in a momentum space.
Abstract Variational quantum algorithms such as the variational quantum eigensolver (VQE) and variational quantum deflation (VQD) have emerged as leading candidates for computing electronic structure on near-term quantum hardware. For periodic solids, however, their reach has been limited not by the quantum algorithm itself but by the cost of constructing a faithful second-quantized Hamiltonian for each material, typically via density-functional theory (DFT) followed by Wannierization or by hand-fitted empirical tight-binding parameters. SlaKoNet, a recently developed method, significantly reduces the computational cost of electronic Hamiltonian construction with a small accuracy tradeoff. It integrates modern deep-learning methods and the Slater-Koster tight-binding formalism to fit thousands of onsite and distance-dependent hopping and overlap tight-binding parameters across 65 elements of the periodic table. After fitting, these parameters can be used to deterministically construct an electronic Hamiltonian for any crystal made up of any of the 65 elements in the training set, and the crystal's band structure can subsequently be computed. In this work, we combine a SlaKoNet model trained on the JARVIS-TBmBJ dataset with a Qiskit-based variational quantum deflation algorithm, replacing the traditional and costly Hamiltonian construction step with a universal neural Hamiltonian generator. Within the 65-element set, the resulting SlaKoNet-VQD workflow is structure-agnostic, fully differentiable, fast, and suited to high-throughput screening of band structures. We benchmark the workflow on silicon, recovering the full eight-band band structure along the standard high-symmetry k-path with a mean absolute deviation of 1.78 meV from exact diagonalization on a 3-qubit statevector simulator. We further compute the full band structure for five additional conventional superconductors, Al, Ta, Nb, V, and ZrN, achieving a mean absolute deviation within approximately 1.8 meV, and demonstrate full execution of SlaKoNet-VQD on IBM Quantum hardware for a representative k-point ground-state calculation on aluminum with a mean absolute error of roughly 0.37 eV. Beyond the single-particle level, we promote the same SlaKoNet Hamiltonian to a correlated Hubbard model and solve it with dynamical mean-field theory, recovering the weakening of correlations across the group-5 metals and strong quasiparticle renormalization in the cuprate La₂CuO₄, and we identify the resulting impurity problem as the natural target for a quantum solver. The pipeline opens a path to high-throughput benchmarking of variational quantum algorithms across the periodic table and to gradient-based co-optimization of ansatz and Hamiltonian for materials discovery. An interactive web app is available at https://atomgpt.org/quantum.
The Monte Carlo Projective Quantum Eigensolver (MC-PQE) was recently introduced as an alternative to hybrid algorithms like the variational quantum eigensolver (VQE). By using a quantum Monte Carlo-inspired scheme for energy estimation, MC\nobreakdash-PQE was found to decrease the required measurement cost relative to comparable conventional approaches. However, in the context of VQE, numerous techniques have been developed to reduce the measurement overhead by joint measurement of multiple observables. In this work, we extend these approaches to the asymmetric expectation values required in MC-PQE and assess the performance of different techniques for various molecular systems of up to 12 qubits. We find full commuting Pauli term grouping combined with tailored measurement allocation techniques leads to a 5-10×\times× reduction in standard error for the same total number of quantum measurements. Conventional Hamiltonian grouped measurement outperforms tractable classical shadows tomography based techniques for the considered systems.
Hybrid quantum-classical variational algorithms such as the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA) are promising applications for noisy, intermediate-scale quantum computers. Both VQE and QAOA variationally extremize the expectation value of a Hamiltonian. All work to date on VQE and QAOA has been limited to Pauli representations of Hamiltonians. However, many cases exist in which a sparse representation of the Hamiltonian is known but there is no efficient Pauli representation. We extend VQE to general sparse Hamiltonians. We provide a decomposition of a fermionic second-quantized Hamiltonian into a number of one-sparse, self-inverse, Hermitian terms linear in the number of ladder operator monomials in the second-quantized representation. We provide a decomposition of a general d-sparse Hamiltonian into O(d^{2}) such terms. In both cases, a single sample of any term can be obtained using two ansatz state preparations and at most six oracle queries. The number of samples required to estimate the expectation value to precision ε scales as ε^{-2} as for Pauli-based VQE. This widens the domain of applicability of VQE to systems whose Hamiltonian and other observables are most efficiently described in terms of sparse matrices.