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:2610.02916

Quasiparticle quantum simulation of materials with the Bethe-Salpeter equation

Jielun Chen, Jiace Sun, Garnet Kin-Lic Chan

quant-phphysics.chem-phSubmitted Oct 2, 2026• Announced Oct 5, 2026• 0 citations
arXivHTMLPDF

Abstract

The first-principles quantum simulation of the full electronic Hamiltonian of a material model of realistic size appears daunting even in a future era of fully fault-tolerant quantum computers. In contrast, classical simulations of material excited states rely on heuristic quasiparticle frameworks, such as the GW approximation and Bethe-Salpeter equation, where only a few quasiparticles are explicitly considered. Here we give a detailed description of quasiparticle quantum simulation for multi-excitonic states within the BSE. We develop an explicit first-quantized, orbital-based block encoding of the multi-exciton BSE Hamiltonian for qubitization, and reduce its cost using integral factorization and crystal symmetries. For a materials model of size $N$, and a fixed number of quasiparticles, the resulting algorithms require $\widetilde{O}(N)$ Toffoli gates and $O(\log N)$ logical qubits, or, using space-time tradeoffs, $\widetilde{O}(\sqrt{N})$ Toffoli gates and $\widetilde{O}(\sqrt{N})$ logical qubits, achieving up to a sixth power reduction in Toffoli count, or up to exponential reduction in qubit count, versus standard full Hamiltonian simulation techniques that have been explored in materials simulation. Resource estimates for the classically challenging problem of triexcitonic eigenvalue estimation across a range of semiconductor models of a realistic physical size of $O(10^3)$ atoms, show that our Toffoli-optimized implementation reduces the Toffoli count by $10^6-10^7$ relative to full Hamiltonian simulation estimates, while a qubit-optimized implementation requires only a few hundred logical qubits. More broadly, these results show that classical heuristic frameworks will be essential in the design of future fault-tolerant quantum algorithms for materials.

AI Summary

The paper asks whether fault-tolerant simulation of material excitations can use fewer resources by solving an approximate few-quasiparticle model rather than the full electronic Hamiltonian. It develops first-quantized quantum simulation of multi-excitonic states within static GW/Bethe–Salpeter theory, using the Tamm–Dancoff approximation. The construction block-encodes electron–hole, electron–electron and hole–hole interactions using tensor hypercontraction, crystal symmetries and QROM/QROAM synthesis. A momentum-block encoding avoids an unnecessary system-size factor in the exchange normalization. At fixed quasiparticle number, basis resolution and phase-estimation precision, the predicted costs are $\widetilde O(N)$ Toffolis with $O(\log N)$ logical qubits, or $\widetilde O(\sqrt N)$ Toffolis and qubits. These bounds rely on size-independent subnormalization, supported by localized-orbital arguments; finite-size diamond calculations instead show effective growth near $N^{0.2}$. Circuit-level resource estimates target triexcitonic energies in five semiconductors at $0.1\,\mathrm{eV}$ phase-estimation precision. For diamond with 1,000 primitive cells, an unadapted Toffoli-optimized calculation requires $5.5\times10^{11}$ Toffolis, $10^6$–$10^7$ below the selected full-Hamiltonian estimates. Relaxed fitting tolerances and space-group adaptation reduce this to $4.7\times10^{10}$ Toffolis and approximately 17,000 logical qubits. A separate qubit-optimized implementation requires 266 logical qubits but substantially more gates. The comparisons involve different physical approximations, not equivalent exact simulations. Initial-state preparation is excluded; fitting-error criteria are empirical rather than excitation-energy guarantees; and large-system inputs are extrapolated. Classical comparisons use dense iterative linear algebra. Recent improved full-Hamiltonian algorithms are discussed but not benchmarked end to end.

No sign of AI-generated textOverclaimsStrong assumptions

Central claim may not hold: The advertised size scalings are established only in a fixed-primitive-cell crystalline setting with additional gap and localization assumptions, rather than for arbitrary material models. The eigenvalue-estimation resource counts exclude initial-state preparation and do not establish the overlap or repetition overhead needed for an end-to-end calculation. The quoted resource reductions compare different physical Hamiltonians, and the empirical fitting-error calibration does not certify the reported target precision for triexciton excitation energies. The appendix's bounded-normalization construction uses independent tensor-leg selectors without establishing the corresponding bounded normalization for the shared-orbital-factor encoding used in the main algorithm, leaving a gap in the justification of the central asymptotic gate bounds.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
31 pages, 9 figures

Related papers

Fault-tolerant quantum algorithms for simulating atomic nuclei

James Benstead, Michael Garn, Neil Gaspar +5 more

To maximize the value of fault-tolerant quantum computers, it is essential to develop concrete applications beyond well-established domains such as chemistry and condensed-matter physics. Here we construct and compile quantum algorithms to simulate the structure of atomic nuclei -- a topic that has received relatively little attention from the quantum computing community despite its similarities to the electronic structure problem in chemistry -- via effective shell-model Hamiltonians and no-core-shell-model Hamiltonians with three-body interactions derived from chiral effective field theory. Furthermore, we provide quantum resource estimates, in terms of Toffoli gate and qubit counts, for these algorithms, which, to our knowledge, are the first such estimates for fault-tolerant quantum simulation of atomic nuclei. Notably, the estimates for $^{32}$Mg and $^{219}$At shell-model Hamiltonians are comparable to recent estimates of Femoco simulations, a standard benchmark in chemistry. For no-core-shell-model Hamiltonians suitable for light nuclei (up to $^{40}$Ca or so), we find that resource requirements are significantly higher, suggesting that more bespoke strategies are required to make such simulations practicable. Throughout this work, we draw upon the similarities between nuclear and electronic structure problems, while also highlighting challenges that are specific to the former. We hope this work will spur long-term collaborations between the nuclear and quantum computing community with the ultimate goal of realizing useful nuclear simulations on quantum computers.

quant-pharXiv:2607.21563•Jul 24, 2026•1 citation

Quantum simulation of battery materials using ionic pseudopotentials

Modjtaba Shokrian Zini, Alain Delgado, Roberto dos Reis +4 more

Ionic pseudopotentials are widely used in classical simulations of materials to model the effective potential due to the nucleus and the core electrons. Modeling fewer electrons explicitly results in a reduction in the number of plane waves needed to accurately represent the states of a system. In this work, we introduce a quantum algorithm that uses pseudopotentials to reduce the cost of simulating periodic materials on a quantum computer. We use a qubitization-based quantum phase estimation algorithm that employs a first-quantization representation of the Hamiltonian in a plane-wave basis. We address the challenge of incorporating the complexity of pseudopotentials into quantum simulations by developing highly-optimized compilation strategies for the qubitization of the Hamiltonian. This includes a linear combination of unitaries decomposition that leverages the form of separable pseudopotentials. Our strategies make use of quantum read-only memory subroutines as a more efficient alternative to quantum arithmetic. We estimate the computational cost of applying our algorithm to simulating lithium-excess cathode materials for batteries, where more accurate simulations are needed to inform strategies for gaining reversible access to the excess capacity they offer. We estimate the number of qubits and Toffoli gates required to perform sufficiently accurate simulations with our algorithm for three materials: lithium manganese oxide, lithium nickel-manganese oxide, and lithium manganese oxyfluoride. Our optimized compilation strategies result in a pseudopotential-based quantum algorithm with a total Toffoli cost four orders of magnitude lower than the previous state of the art for a fixed target accuracy.

arXiv:2302.07981•Quantum•Jul 10, 2023•28 citations

Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models

Angus Kan, Benjamin C. B. Symons

Abstract Exploring low-cost applications is paramount to creating value in early fault-tolerant quantum computers. Here, we optimize both gate and qubit counts of recent algorithms for simulating the Fermi-Hubbard model. We further devise and compile algorithms to simulate established models of cuprate and pnictide high-temperature superconductors, which include beyond-nearest-neighbor hopping terms and multi-orbital interactions that are absent in the Fermi-Hubbard model. We show that simulations of these more realistic models of high-temperature superconductors require only an order of magnitude or so more Toffoli gates than a simulation of the Fermi-Hubbard model. Furthermore, we find plenty classically difficult instances with Toffoli and qubit counts that are far lower than commonly considered quantum phase estimation circuits for electronic structure problems in quantum chemistry. We believe our results pave the way towards studying high-temperature superconductors on early fault-tolerant quantum computers.

arXiv:2411.02160•npj Quantum Information•Aug 11, 2025•21 citations

A comprehensive framework to simulate real-time chemical dynamics on a fault-tolerant quantum computer

Karthik Seetharam, Burak Sahinoglu, Matteo Lostaglio +2 more

Abstract We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between NH3 and BF3 (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately 10^11 Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.

arXiv:2504.06348•Sep 18, 2025•16 citations

Faster quantum simulation of quantum chemistry with tailored algorithms and Hamiltonians

Ian Kivlichan

With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.

•Jan 8, 2020•0 citations

Nanostructure modelling with early fault tolerant quantum computers

Zhu Sun, Christian Binder, Balint Koczor +1 more

Semiconductor nanostructures are central to many developing technologies. Notably, double quantum dots are especially important for semiconductor spin-qubit architectures, quantum sensing applications, and quantum-dot solar cells. Accurate modelling is highly desirable but conventional methods can struggle when dynamics involve more than two interacting electrons. In this work, we present a quantum simulation framework capable of addressing multi-electron double quantum dots. We adopt an efficiently scaling 1$^\text{st}$ quantised representation of the system and develop algorithms based on both Trotterisation and Qubitisation. Incorporating insights from classical simulations enables us to produce resource estimates that are more realistic than those obtained from theoretical error bounds. Using a standard surface code model with physical noise at $10^{-3}$, our results indicate that the ground-state energy of four electrons in a double quantum dot can be estimated in approximately 22 hours using 226k physical qubits, or an eight-electron system in 3.3 days with 314k qubits (with runtimes falling dramatically when more qubits are available). We anticipate that incorporating recent advances in surface code architectures may reduce these costs significantly further. Our results suggest that early fault-tolerant quantum computers may become valuable tools for designing mature-era quantum technologies.

quant-pharXiv:2606.06442•Jun 5, 2026•0 citations
The first-principles quantum simulation of the full electronic Hamiltonian of a material model of realistic size appears daunting even in a future era of fully fault-tolerant quantum computers. In contrast, classical simulations of material excited states rely on heuristic quasiparticle frameworks, such as the GW approximation and Bethe-Salpeter equation, where only a few quasiparticles are explicitly considered. Here we give a detailed description of quasiparticle quantum simulation for multi-excitonic states within the BSE. We develop an explicit first-quantized, orbital-based block encoding of the multi-exciton BSE Hamiltonian for qubitization, and reduce its cost using integral factorization and crystal symmetries. For a materials model of size NNN, and a fixed number of quasiparticles, the resulting algorithms require O~(N)\widetilde{O}(N)O(N) Toffoli gates and O(log⁡N)O(\log N)O(logN) logical qubits, or, using space-time tradeoffs, O~(N)\widetilde{O}(\sqrt{N})O(N​) Toffoli gates and O~(N)\widetilde{O}(\sqrt{N})O(N​) logical qubits, achieving up to a sixth power reduction in Toffoli count, or up to exponential reduction in qubit count, versus standard full Hamiltonian simulation techniques that have been explored in materials simulation. Resource estimates for the classically challenging problem of triexcitonic eigenvalue estimation across a range of semiconductor models of a realistic physical size of O(103)O(10^3)O(103) atoms, show that our Toffoli-optimized implementation reduces the Toffoli count by 106−10710^6-10^7106−107 relative to full Hamiltonian simulation estimates, while a qubit-optimized implementation requires only a few hundred logical qubits. More broadly, these results show that classical heuristic frameworks will be essential in the design of future fault-tolerant quantum algorithms for materials.
The paper asks whether fault-tolerant simulation of material excitations can use fewer resources by solving an approximate few-quasiparticle model rather than the full electronic Hamiltonian. It develops first-quantized quantum simulation of multi-excitonic states within static GW/Bethe–Salpeter theory, using the Tamm–Dancoff approximation.
The construction block-encodes electron–hole, electron–electron and hole–hole interactions using tensor hypercontraction, crystal symmetries and QROM/QROAM synthesis. A momentum-block encoding avoids an unnecessary system-size factor in the exchange normalization. At fixed quasiparticle number, basis resolution and phase-estimation precision, the predicted costs are O~(N)\widetilde O(N)O(N) Toffolis with O(log⁡N)O(\log N)O(logN) logical qubits, or O~(N)\widetilde O(\sqrt N)O(N​) Toffolis and qubits. These bounds rely on size-independent subnormalization, supported by localized-orbital arguments; finite-size diamond calculations instead show effective growth near N0.2N^{0.2}N0.2.
Circuit-level resource estimates target triexcitonic energies in five semiconductors at 0.1 eV0.1\,\mathrm{eV}0.1eV phase-estimation precision. For diamond with 1,000 primitive cells, an unadapted Toffoli-optimized calculation requires 5.5×10115.5\times10^{11}5.5×1011 Toffolis, 10610^6106–10710^7107 below the selected full-Hamiltonian estimates. Relaxed fitting tolerances and space-group adaptation reduce this to 4.7×10104.7\times10^{10}4.7×1010 Toffolis and approximately 17,000 logical qubits. A separate qubit-optimized implementation requires 266 logical qubits but substantially more gates.
The comparisons involve different physical approximations, not equivalent exact simulations. Initial-state preparation is excluded; fitting-error criteria are empirical rather than excitation-energy guarantees; and large-system inputs are extrapolated. Classical comparisons use dense iterative linear algebra. Recent improved full-Hamiltonian algorithms are discussed but not benchmarked end to end.
To maximize the value of fault-tolerant quantum computers, it is essential to develop concrete applications beyond well-established domains such as chemistry and condensed-matter physics. Here we construct and compile quantum algorithms to simulate the structure of atomic nuclei -- a topic that has received relatively little attention from the quantum computing community despite its similarities to the electronic structure problem in chemistry -- via effective shell-model Hamiltonians and no-core-shell-model Hamiltonians with three-body interactions derived from chiral effective field theory. Furthermore, we provide quantum resource estimates, in terms of Toffoli gate and qubit counts, for these algorithms, which, to our knowledge, are the first such estimates for fault-tolerant quantum simulation of atomic nuclei. Notably, the estimates for 32^{32}32Mg and 219^{219}219At shell-model Hamiltonians are comparable to recent estimates of Femoco simulations, a standard benchmark in chemistry. For no-core-shell-model Hamiltonians suitable for light nuclei (up to 40^{40}40Ca or so), we find that resource requirements are significantly higher, suggesting that more bespoke strategies are required to make such simulations practicable. Throughout this work, we draw upon the similarities between nuclear and electronic structure problems, while also highlighting challenges that are specific to the former. We hope this work will spur long-term collaborations between the nuclear and quantum computing community with the ultimate goal of realizing useful nuclear simulations on quantum computers.
Ionic pseudopotentials are widely used in classical simulations of materials to model the effective potential due to the nucleus and the core electrons. Modeling fewer electrons explicitly results in a reduction in the number of plane waves needed to accurately represent the states of a system. In this work, we introduce a quantum algorithm that uses pseudopotentials to reduce the cost of simulating periodic materials on a quantum computer. We use a qubitization-based quantum phase estimation algorithm that employs a first-quantization representation of the Hamiltonian in a plane-wave basis. We address the challenge of incorporating the complexity of pseudopotentials into quantum simulations by developing highly-optimized compilation strategies for the qubitization of the Hamiltonian. This includes a linear combination of unitaries decomposition that leverages the form of separable pseudopotentials. Our strategies make use of quantum read-only memory subroutines as a more efficient alternative to quantum arithmetic. We estimate the computational cost of applying our algorithm to simulating lithium-excess cathode materials for batteries, where more accurate simulations are needed to inform strategies for gaining reversible access to the excess capacity they offer. We estimate the number of qubits and Toffoli gates required to perform sufficiently accurate simulations with our algorithm for three materials: lithium manganese oxide, lithium nickel-manganese oxide, and lithium manganese oxyfluoride. Our optimized compilation strategies result in a pseudopotential-based quantum algorithm with a total Toffoli cost four orders of magnitude lower than the previous state of the art for a fixed target accuracy.
Abstract Exploring low-cost applications is paramount to creating value in early fault-tolerant quantum computers. Here, we optimize both gate and qubit counts of recent algorithms for simulating the Fermi-Hubbard model. We further devise and compile algorithms to simulate established models of cuprate and pnictide high-temperature superconductors, which include beyond-nearest-neighbor hopping terms and multi-orbital interactions that are absent in the Fermi-Hubbard model. We show that simulations of these more realistic models of high-temperature superconductors require only an order of magnitude or so more Toffoli gates than a simulation of the Fermi-Hubbard model. Furthermore, we find plenty classically difficult instances with Toffoli and qubit counts that are far lower than commonly considered quantum phase estimation circuits for electronic structure problems in quantum chemistry. We believe our results pave the way towards studying high-temperature superconductors on early fault-tolerant quantum computers.
Abstract We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between NH3 and BF3 (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately 10^11 Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.
With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.
Semiconductor nanostructures are central to many developing technologies. Notably, double quantum dots are especially important for semiconductor spin-qubit architectures, quantum sensing applications, and quantum-dot solar cells. Accurate modelling is highly desirable but conventional methods can struggle when dynamics involve more than two interacting electrons. In this work, we present a quantum simulation framework capable of addressing multi-electron double quantum dots. We adopt an efficiently scaling 1st^\text{st}st quantised representation of the system and develop algorithms based on both Trotterisation and Qubitisation. Incorporating insights from classical simulations enables us to produce resource estimates that are more realistic than those obtained from theoretical error bounds. Using a standard surface code model with physical noise at 10−310^{-3}10−3, our results indicate that the ground-state energy of four electrons in a double quantum dot can be estimated in approximately 22 hours using 226k physical qubits, or an eight-electron system in 3.3 days with 314k qubits (with runtimes falling dramatically when more qubits are available). We anticipate that incorporating recent advances in surface code architectures may reduce these costs significantly further. Our results suggest that early fault-tolerant quantum computers may become valuable tools for designing mature-era quantum technologies.