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

An approach for calculating astrophysical opacities on quantum computers

Shivesh Pathak, Alina Kononov, Andrew D. Baczewski

quant-phSubmitted Jul 2, 2026• Announced Jul 6, 2026• 0 citations
arXivHTMLPDF

Abstract

We propose a quantum algorithmic protocol for calculating astrophysical opacities. Our implementation uses first- and second-quantized representations of interacting electronic and photonic subsystems and Hamiltonian simulation via the interaction picture. Inferring opacity from momentum-resolved measurements of the photonic register yields a direct relationship between qubit count and spectral range/resolution. Logical resource estimates for the classically challenging problem of solar iron opacity are comparable to another high-energy-density physics problem (Rubin et al., PNAS 121(3) (2024)).

Related papers

Quasiparticle quantum simulation of materials with the Bethe-Salpeter equation

Jielun Chen, Jiace Sun, Garnet Kin-Lic Chan

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.

quant-pharXiv:2610.02916•Oct 5, 2026•0 citations

Performing Joint Measurements of Light with Quantum Computers

Spencer Dimitroff, Mohan Sarovar

We establish a model employing transduction of optical states to qubits in a quantum computer followed by quantum computation to ease the difficulty of performing joint measurements of optical quantum states.

Quantum 2.0 Conference and Exhibition•Jan 1, 2024•0 citations

Exponentially More Precise Algorithms for Quantum Simulation of Quantum Chemistry

Annie Y. Wei

In quantum chemistry, the "electronic structure problem" refers to the process of numerically solving Schrodinger's equation for a given molecular system. These calculations rank among the most CPU-intensive computations that are performed nowadays, yet they are also crucial to the design of new drugs and materials. The idea behind quantum simulation of quantum chemistry is that a quantum computer could perform such calculations in a manner that is exponentially more efficient than what a classical computer could accomplish. In fact, quantum simulation is quite possibly the application most naturally suited to a quantum computer. In this work we introduce novel algorithms for the simulation of quantum chemistry, algorithms that are exponentially more precise than previous algorithms in the literature. Previous algorithms are based on the Trotter-Suzuki decomposition and scale like the inverse of the desired precision, while our algorithms represent the first practical application of the recently developed truncated Taylor series approach, and they achieve scaling that is logarithmic in the inverse of the precision. We explore algorithms for both second-quantized and first-quantized encodings of the chemistry Hamiltonian, where the second-quantized encoding requires $\\mathcal{O}(N)$ qubits for an $N$ spin-orbital system, and the highly compressed first-quantized encoding requires $\\mathcal{O}(\\eta)$ qubits, where $\\eta<<N$ is the number of electrons in the system. We first introduce a second-quantized algorithm that uses pre-computed molecular integrals, resulting in a gate count that scales like $\\widetilde{\\cal O}(N^8t)$. Next we introduce algorithms that compute molecular integrals on the fly by carefully discretizing these integrals. Indeed, figuring out how to evaluate the integrals in an efficient manner is one of the main challenges of applying the truncated Taylor series approach to the chemistry problem: the complexity of a general quantum algorithm is traditionally formulated in terms of the number of queries made to an oracle whose assumption we just assume, but in this case, we actually construct the oracle for our specific problem. The evaluation of the oracle itself requires evaluating molecular integrals, which adds additional complexity to an algorithm. We find that the gate count of the second-quantized on-the-fly algorithm scales like $\\widetilde{\\cal O}(N^5t)$. We also find that the first-quantized on-the-fly algorithm, which uses the configuration interaction (CI) matrix representation of the Hamiltonian, requires at most $\\widetilde{\\cal O}(\\eta^2N^3t)$ gates. In general, the discovery of exponentially more precise algorithms will allow for the simulation of larger molecular systems than was previously possible under Trotter-based methods. In addition, the results here can be generalized to the simulation of other fermionic systems beyond the electronic structure problem.

•Jun 21, 2016•0 citations

Hardware efficient quantum algorithms for vibrational structure calculations

Pauline J. Ollitrault, Alberto Baiardi, Markus Reiher +1 more

We introduce a framework for the calculation of ground and excited state energies of bosonic systems suitable for near-term quantum devices and apply it to molecular vibrational anharmonic Hamiltonians.

arXiv:2003.12578•Chemical Science•Jan 1, 2020•99 citations

Quantum computation of stopping power for inertial fusion target design

Nicholas C. Rubin, Dominic William Berry, Alina Kononov +7 more

Stopping power is the rate at which a material absorbs the kinetic energy of a charged particle passing through it—one of many properties needed over a wide range of thermodynamic conditions in modeling inertial fusion implosions. First-principles stopping calculations are classically challenging because they involve the dynamics of large electronic systems far from equilibrium, with accuracies that are particularly difficult to constrain and assess in the warm-dense conditions preceding ignition. Here, we describe a protocol for using a fault-tolerant quantum computer to calculate stopping power from a first-quantized representation of the electrons and projectile. Our approach builds upon the electronic structure block encodings of Su et al. [ PRX Quant. 2 , 040332 (2021)], adapting and optimizing those algorithms to estimate observables of interest from the non-Born–Oppenheimer dynamics of multiple particle species at finite temperature. We also work out the constant factors associated with an implementation of a high-order Trotter approach to simulating a grid representation of these systems. Ultimately, we report logical qubit requirements and leading-order Toffoli costs for computing the stopping power of various projectile/target combinations relevant to interpreting and designing inertial fusion experiments. We estimate that scientifically interesting and classically intractable stopping power calculations can be quantum simulated with roughly the same number of logical qubits and about one hundred times more Toffoli gates than is required for state-of-the-art quantum simulations of industrially relevant molecules such as FeMoco or P450.

arXiv:2308.12352•Proceedings of the National Academy of Sciences•May 31, 2024•44 citations

Fault-tolerant quantum simulation of the Pauli-Breit Hamiltonian for ab initio hybrid quantum-classical molecular design with applications to photodynamic therapy

Emil Zak

Relativistic spin effects drive subtle molecular phenomena ranging from intersystem crossing in photodynamic therapy to spin-mediated catalysis and high-resolution spectroscopy. These effects are described by the Pauli-Breit Hamiltonian, which extends the nonrelativistic electronic Hamiltonian by including one- and two-electron spin-orbit and spin-spin interactions. First-principles simulations of the full Pauli-Breit Hamiltonian rapidly become intractable on classical computers due to the exponential growth of the Hilbert space and the complexity of two-body spin-dependent terms. We propose a fault-tolerant quantum algorithm for computing molecular energy levels and properties governed by the Pauli-Breit Hamiltonian. Our approach block-encodes the relativistic Hamiltonian in a second-quantized, doubly factorized representation. By reformulating the Hamiltonian in a symmetry-adapted Majorana basis, we construct efficient linear-combination-of-unitaries circuits that encode spin-orbit interactions without effective or mean-field approximations. We introduce spin-controlled Pauli-SWAP networks that decouple spin and orbital control logic, enabling a unified treatment of relativistic spin mixing with only modest overhead relative to spin-free simulations. We analyze quantum resources in terms of logical qubits and T-gate complexity, showing that explicit spin degrees of freedom do not worsen the asymptotic scaling. The prefactor is reduced by a factor of two compared to direct linear-combination-of-unitaries approaches. Finally, we outline a hybrid quantum-classical workflow for designing photodynamic therapy photosensitizers, artificial photosynthesis catalysts, and other systems where accurate relativistic spin effects are essential.

quant-pharXiv:2601.18898•International Journal of Quantum Chemistry•Jan 28, 2026•0 citations
We propose a quantum algorithmic protocol for calculating astrophysical opacities. Our implementation uses first- and second-quantized representations of interacting electronic and photonic subsystems and Hamiltonian simulation via the interaction picture. Inferring opacity from momentum-resolved measurements of the photonic register yields a direct relationship between qubit count and spectral range/resolution. Logical resource estimates for the classically challenging problem of solar iron opacity are comparable to another high-energy-density physics problem (Rubin et al., PNAS 121(3) (2024)).
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.
In quantum chemistry, the "electronic structure problem" refers to the process of numerically solving Schrodinger's equation for a given molecular system. These calculations rank among the most CPU-intensive computations that are performed nowadays, yet they are also crucial to the design of new drugs and materials. The idea behind quantum simulation of quantum chemistry is that a quantum computer could perform such calculations in a manner that is exponentially more efficient than what a classical computer could accomplish. In fact, quantum simulation is quite possibly the application most naturally suited to a quantum computer. In this work we introduce novel algorithms for the simulation of quantum chemistry, algorithms that are exponentially more precise than previous algorithms in the literature. Previous algorithms are based on the Trotter-Suzuki decomposition and scale like the inverse of the desired precision, while our algorithms represent the first practical application of the recently developed truncated Taylor series approach, and they achieve scaling that is logarithmic in the inverse of the precision. We explore algorithms for both second-quantized and first-quantized encodings of the chemistry Hamiltonian, where the second-quantized encoding requires mathcalO(N)\\mathcal{O}(N)mathcalO(N) qubits for an NNN spin-orbital system, and the highly compressed first-quantized encoding requires mathcalO(eta)\\mathcal{O}(\\eta)mathcalO(eta) qubits, where eta<<N\\eta<<Neta<<N is the number of electrons in the system. We first introduce a second-quantized algorithm that uses pre-computed molecular integrals, resulting in a gate count that scales like widetildecalO(N8t)\\widetilde{\\cal O}(N^8t)widetildecalO(N8t). Next we introduce algorithms that compute molecular integrals on the fly by carefully discretizing these integrals. Indeed, figuring out how to evaluate the integrals in an efficient manner is one of the main challenges of applying the truncated Taylor series approach to the chemistry problem: the complexity of a general quantum algorithm is traditionally formulated in terms of the number of queries made to an oracle whose assumption we just assume, but in this case, we actually construct the oracle for our specific problem. The evaluation of the oracle itself requires evaluating molecular integrals, which adds additional complexity to an algorithm. We find that the gate count of the second-quantized on-the-fly algorithm scales like widetildecalO(N5t)\\widetilde{\\cal O}(N^5t)widetildecalO(N5t). We also find that the first-quantized on-the-fly algorithm, which uses the configuration interaction (CI) matrix representation of the Hamiltonian, requires at most widetildecalO(eta2N3t)\\widetilde{\\cal O}(\\eta^2N^3t)widetildecalO(eta2N3t) gates. In general, the discovery of exponentially more precise algorithms will allow for the simulation of larger molecular systems than was previously possible under Trotter-based methods. In addition, the results here can be generalized to the simulation of other fermionic systems beyond the electronic structure problem.
Stopping power is the rate at which a material absorbs the kinetic energy of a charged particle passing through it—one of many properties needed over a wide range of thermodynamic conditions in modeling inertial fusion implosions. First-principles stopping calculations are classically challenging because they involve the dynamics of large electronic systems far from equilibrium, with accuracies that are particularly difficult to constrain and assess in the warm-dense conditions preceding ignition. Here, we describe a protocol for using a fault-tolerant quantum computer to calculate stopping power from a first-quantized representation of the electrons and projectile. Our approach builds upon the electronic structure block encodings of Su et al. [ PRX Quant. 2 , 040332 (2021)], adapting and optimizing those algorithms to estimate observables of interest from the non-Born–Oppenheimer dynamics of multiple particle species at finite temperature. We also work out the constant factors associated with an implementation of a high-order Trotter approach to simulating a grid representation of these systems. Ultimately, we report logical qubit requirements and leading-order Toffoli costs for computing the stopping power of various projectile/target combinations relevant to interpreting and designing inertial fusion experiments. We estimate that scientifically interesting and classically intractable stopping power calculations can be quantum simulated with roughly the same number of logical qubits and about one hundred times more Toffoli gates than is required for state-of-the-art quantum simulations of industrially relevant molecules such as FeMoco or P450.
Relativistic spin effects drive subtle molecular phenomena ranging from intersystem crossing in photodynamic therapy to spin-mediated catalysis and high-resolution spectroscopy. These effects are described by the Pauli-Breit Hamiltonian, which extends the nonrelativistic electronic Hamiltonian by including one- and two-electron spin-orbit and spin-spin interactions. First-principles simulations of the full Pauli-Breit Hamiltonian rapidly become intractable on classical computers due to the exponential growth of the Hilbert space and the complexity of two-body spin-dependent terms. We propose a fault-tolerant quantum algorithm for computing molecular energy levels and properties governed by the Pauli-Breit Hamiltonian. Our approach block-encodes the relativistic Hamiltonian in a second-quantized, doubly factorized representation. By reformulating the Hamiltonian in a symmetry-adapted Majorana basis, we construct efficient linear-combination-of-unitaries circuits that encode spin-orbit interactions without effective or mean-field approximations. We introduce spin-controlled Pauli-SWAP networks that decouple spin and orbital control logic, enabling a unified treatment of relativistic spin mixing with only modest overhead relative to spin-free simulations. We analyze quantum resources in terms of logical qubits and T-gate complexity, showing that explicit spin degrees of freedom do not worsen the asymptotic scaling. The prefactor is reduced by a factor of two compared to direct linear-combination-of-unitaries approaches. Finally, we outline a hybrid quantum-classical workflow for designing photodynamic therapy photosensitizers, artificial photosynthesis catalysts, and other systems where accurate relativistic spin effects are essential.