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

Antisymmetrization of composite fermionic states for quantum simulations of nuclear reactions in first-quantization mapping

Ionel Stetcu

quant-phnucl-thSubmitted Dec 18, 2025• Announced Dec 19, 2025• 0 citations
arXivHTMLPDF

Abstract

I present a first-quantization deterministic algorithm for antisymmetrizing a spatially separated target-projectile system containing $N_T$ and $N_p$ identical fermions, respectively. The method constructs a fully antisymmetric wavefunction from the product of two independently antisymmetrized many-body states, each of which may be a superposition of Slater determinants. The algorithm uses a Dicke-state ancilla register that coherently encodes all one-particle exchange channels between the two subsystems, and, crucially, requires only single-particle swaps to generate the full antisymmetric structure. A total of $O(N_T N_p)$ single-particle exchanges are needed, with up to $N_p$ of them implemented in parallel, if an additional $N_p$ ancillae are used. The correct fermionic phase is incorporated through application of $Z$ gates on $N_T$ ancillae, after which the ancilla register is efficiently uncomputed using a compact sequence of controlled operations. This construction provides a nontrivial and scalable protocol for preparing fully antisymmetric states in reaction and scattering simulations, significantly expanding the range of systems that can be addressed with first-quantized quantum algorithms.

Comments
6 pages, 2 figures; 2 pages of supplemental material included

Related papers

Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping

Evan Rule, I. A. Chernyshev, Ionel Stetcu +2 more

We devise a deterministic quantum algorithm to produce antisymmetric states of single-particle orbitals in the first quantization mapping. Unlike sorting-based antisymmetrization algorithms, which require ordered input states and high Clifford-gate overhead, our approach initializes the state of each particle independently. For a system of η particles and N single-particle states, our algorithm prepares antisymmetrized states of non-trivial localized (e.g., Hartree-Fock) orbitals using O ( η 2 N ) T -gates, outperforming alternative algorithms when η ≲ N . To achieve such scaling, we require O ( N ) dirty ancilla qubits for intermediate calculations. Knowledge of the single-particle states to be antisymmetrized can be leveraged to further improve the efficiency of the circuit, and a measurement-based variant reduces gate cost by roughly a factor of two. We show example circuits for two- and three-particle systems and discuss the generalization to an arbitrary number of particles. For a specific three-particle example, we decompose the circuit into Clifford + T gates and study the impact of noise on the prepared state.

arXiv:2509.07279•Quantum•Apr 8, 2026•2 citations

Low-Depth Quantum Symmetrization

Zhenning Liu, Andrew M. Childs, Daniel Gottesman

Quantum symmetrization is the task of transforming a nonstrictly increasing list of n integers into an equal superposition of all permutations of the list (or more generally, performing this operation coherently on a superposition of such lists). This task plays a key role in initial state preparation for first-quantized simulations. Motivated by an application to fermionic systems, various algorithms have been proposed to solve a weaker version of symmetrization in which the input list is increasing, but the general symmetrization problem with repetitions in the input list has not been well studied. We present the first efficient quantum algorithms for the general symmetrization problem. If m is the greatest possible value of the input list, our first algorithm symmetrizes any single classical input list using O ˜ ( log n ) depth and O ( n log n + log m ) ancilla qubits, and our second algorithm symmetrizes an arbitrary superposition of input lists using O ˜ ( log 3 n ) depth and O ( n log n ) ancilla qubits. Our algorithms enable efficient simulation of bosonic quantum systems in first quantization (in particular, we describe a simulation of the Bose-Hubbard model with complexity poly ( n , log m ) ) and can prepare (superpositions of) Dicke states of any Hamming weight in O ˜ ( log n ) depth (respectively, O ˜ ( log 3 n ) depth) using O ( n log n ) ancilla qubits. We also propose an O ˜ ( log 3 n ) -depth quantum algorithm to transform second-quantized states to first-quantized states. Using this algorithm, QFT-based quantum telescope arrays can image brighter photon sources, extending quantum interferometric imaging systems to a new regime.

arXiv:2411.04019•Physical Review X•Jul 20, 2026•2 citations

Towards Antisymmetric Neural Ansatz Separation

Aaron Zweig, Joan Bruna

We study separations between two fundamental models (or \emph{Ansätze}) of antisymmetric functions, that is, functions $f$ of the form $f(x_{σ(1)}, \ldots, x_{σ(N)}) = \text{sign}(σ)f(x_1, \ldots, x_N)$, where $σ$ is any permutation. These arise in the context of quantum chemistry, and are the basic modeling tool for wavefunctions of Fermionic systems. Specifically, we consider two popular antisymmetric Ansätze: the Slater representation, which leverages the alternating structure of determinants, and the Jastrow ansatz, which augments Slater determinants with a product by an arbitrary symmetric function. We construct an antisymmetric function in $N$ dimensions that can be efficiently expressed in Jastrow form, yet provably cannot be approximated by Slater determinants unless there are exponentially (in $N^2$) many terms. This represents the first explicit quantitative separation between these two Ansätze.

arXiv:2208.03264•Aug 5, 2022•1 citation

Universal initial state preparation for first quantized quantum simulations

Jack S. Baker, Saxena, Gaurav, Thi Ha Kyaw

Preparing symmetry-adapted initial states is a principal bottleneck in first-quantized quantum simulation. We present a universal approach that efficiently maps any polynomial-size superposition of occupation-number configurations to the first-quantized representation on a digital quantum computer. The method exploits the Jordan--Schwinger Lie algebra homomorphism, which identifies number-conserving second-quantized operators with their first-quantized action and induces an equivariant bijection between Fock occupations and $\mathfrak{su}(d)$ weight states within the Schur--Weyl decomposition. Operationally, we deterministically prepare an superposition of target Schur labels and apply the inverse quantum Schur transform. For $L$ configurations of $N$ particles over $d$ modes prepared to accuracy $ε$, the most efficient variant of the algorithm runs with non-Clifford gate complexity $\mathrm{poly}(L, N, \log d, \log ε^{-1})$. The protocol applies universally to fermions, bosons, and Green's paraparticles in arbitrary single-particle bases. Resource estimates establish practicality within leading first-quantized pipelines, with statistics-aware specializations promising further reductions.

arXiv:2510.07278•Oct 8, 2025•0 citations

Coupled-Equations Method for the Scattering of Identical Particles

F. S. Levin

The completely antisymmetric solution ${\ensuremath{\Psi}}^{A}$ to the problem of the scattering of a fermion by a finite system of identical fermions is studied by means of the expansion ${\ensuremath{\Psi}}^{A}=\ensuremath{\Sigma}{\ensuremath{\phi}}_{\ensuremath{\alpha}}{\ensuremath{\psi}}_{\ensuremath{\alpha}}$, where ${{\ensuremath{\phi}}_{\ensuremath{\alpha}}}$ is a complete set of antisymmetric states for the target and ${\ensuremath{\psi}}_{\ensuremath{\alpha}}$ are one-particle functions. Coupled equations for the ${\ensuremath{\psi}}_{\ensuremath{\alpha}}$ are found that obey the proper boundary conditions. This is done by means of the integral equation for ${\ensuremath{\Psi}}^{A}$ and the use of projection operators. The elastic-scattering (optical-model) wave function ${\ensuremath{\psi}}_{0}$ is shown to obey an inhomogeneous differential equation, rather than a Schr\"odinger equation. The homogeneous solution is identical to the elastic wave function obtained when the projectile is distinguishable, while the inhomogeneous solution is due entirely to exchange effects. The function ${\ensuremath{\psi}}_{0}$ is identical to the optical-model wave function found by Bell and Squires, who showed that ${\ensuremath{\psi}}_{0}$ obeys a Schr\"odinger equation with an optical potential containing direct and exchange contributions. It is shown that ${\ensuremath{\psi}}_{0}$ yields the exact elastic amplitude including direct and exchange contributions, and a phase-shift analysis of the exchange term is given. The more standard form of solution ${\ensuremath{\Psi}}^{A}=\ensuremath{\Sigma}\mathcal{a}{{\ensuremath{\phi}}_{\ensuremath{\alpha}}{f}_{\ensuremath{\alpha}}}$, where $\mathcal{a}$ is an antisymmetrizer, is briefly discussed. The extension to the cases of inelastic scattering and deuteron elastic scattering is made.

Physical Review•Nov 22, 1965•21 citations

Efficient Simulation of Pre-Born-Oppenheimer Dynamics on a Quantum Computer

Matthew Pocrnic, Ignacio Loaiza, Juan Miguel Arrazola +2 more

In this work, we present a quantum algorithm for direct first-principles simulation of electron-nuclear dynamics on a first-quantized real-space grid. Our algorithm achieves best-in-class efficiency for block-encoding the pre-Born-Oppenheimer molecular Hamiltonian by harnessing the linear scaling of swap networks for implementing the quadratic number of particle interactions, while using a novel alternating sign implementation of the Coulomb interaction that exploits highly optimized arithmetic routines. We benchmark our approach for a series of scientifically and industrially relevant chemical reactions. We demonstrate over an order-of-magnitude reduction in costs compared to previous state-of-the-art for the $\rm NH_3+BF_3$ reaction, achieving a Toffoli cost of $8.7\times10^{9}$ per femtosecond using $1362$ logical qubits (system + ancillas). Our results significantly lower the resources required for fault-tolerant simulations of photochemical reactions, while providing a suite of algorithmic primitives that are expected to serve as foundational building blocks for a broader class of quantum algorithms.

quant-pharXiv:2602.11272•Feb 13, 2026•0 citations
I present a first-quantization deterministic algorithm for antisymmetrizing a spatially separated target-projectile system containing NTN_TNT​ and NpN_pNp​ identical fermions, respectively. The method constructs a fully antisymmetric wavefunction from the product of two independently antisymmetrized many-body states, each of which may be a superposition of Slater determinants. The algorithm uses a Dicke-state ancilla register that coherently encodes all one-particle exchange channels between the two subsystems, and, crucially, requires only single-particle swaps to generate the full antisymmetric structure. A total of O(NTNp)O(N_T N_p)O(NT​Np​) single-particle exchanges are needed, with up to NpN_pNp​ of them implemented in parallel, if an additional NpN_pNp​ ancillae are used. The correct fermionic phase is incorporated through application of ZZZ gates on NTN_TNT​ ancillae, after which the ancilla register is efficiently uncomputed using a compact sequence of controlled operations. This construction provides a nontrivial and scalable protocol for preparing fully antisymmetric states in reaction and scattering simulations, significantly expanding the range of systems that can be addressed with first-quantized quantum algorithms.
We devise a deterministic quantum algorithm to produce antisymmetric states of single-particle orbitals in the first quantization mapping. Unlike sorting-based antisymmetrization algorithms, which require ordered input states and high Clifford-gate overhead, our approach initializes the state of each particle independently. For a system of η particles and N single-particle states, our algorithm prepares antisymmetrized states of non-trivial localized (e.g., Hartree-Fock) orbitals using O ( η 2 N ) T -gates, outperforming alternative algorithms when η ≲ N . To achieve such scaling, we require O ( N ) dirty ancilla qubits for intermediate calculations. Knowledge of the single-particle states to be antisymmetrized can be leveraged to further improve the efficiency of the circuit, and a measurement-based variant reduces gate cost by roughly a factor of two. We show example circuits for two- and three-particle systems and discuss the generalization to an arbitrary number of particles. For a specific three-particle example, we decompose the circuit into Clifford + T gates and study the impact of noise on the prepared state.
Quantum symmetrization is the task of transforming a nonstrictly increasing list of n integers into an equal superposition of all permutations of the list (or more generally, performing this operation coherently on a superposition of such lists). This task plays a key role in initial state preparation for first-quantized simulations. Motivated by an application to fermionic systems, various algorithms have been proposed to solve a weaker version of symmetrization in which the input list is increasing, but the general symmetrization problem with repetitions in the input list has not been well studied. We present the first efficient quantum algorithms for the general symmetrization problem. If m is the greatest possible value of the input list, our first algorithm symmetrizes any single classical input list using O ˜ ( log n ) depth and O ( n log n + log m ) ancilla qubits, and our second algorithm symmetrizes an arbitrary superposition of input lists using O ˜ ( log 3 n ) depth and O ( n log n ) ancilla qubits. Our algorithms enable efficient simulation of bosonic quantum systems in first quantization (in particular, we describe a simulation of the Bose-Hubbard model with complexity poly ( n , log m ) ) and can prepare (superpositions of) Dicke states of any Hamming weight in O ˜ ( log n ) depth (respectively, O ˜ ( log 3 n ) depth) using O ( n log n ) ancilla qubits. We also propose an O ˜ ( log 3 n ) -depth quantum algorithm to transform second-quantized states to first-quantized states. Using this algorithm, QFT-based quantum telescope arrays can image brighter photon sources, extending quantum interferometric imaging systems to a new regime.
We study separations between two fundamental models (or \emph{Ansätze}) of antisymmetric functions, that is, functions fff of the form f(xσ(1),…,xσ(N))=sign(σ)f(x1,…,xN)f(x_{σ(1)}, \ldots, x_{σ(N)}) = \text{sign}(σ)f(x_1, \ldots, x_N)f(xσ(1)​,…,xσ(N)​)=sign(σ)f(x1​,…,xN​), where σσσ is any permutation. These arise in the context of quantum chemistry, and are the basic modeling tool for wavefunctions of Fermionic systems. Specifically, we consider two popular antisymmetric Ansätze: the Slater representation, which leverages the alternating structure of determinants, and the Jastrow ansatz, which augments Slater determinants with a product by an arbitrary symmetric function. We construct an antisymmetric function in NNN dimensions that can be efficiently expressed in Jastrow form, yet provably cannot be approximated by Slater determinants unless there are exponentially (in N2N^2N2) many terms. This represents the first explicit quantitative separation between these two Ansätze.
Preparing symmetry-adapted initial states is a principal bottleneck in first-quantized quantum simulation. We present a universal approach that efficiently maps any polynomial-size superposition of occupation-number configurations to the first-quantized representation on a digital quantum computer. The method exploits the Jordan--Schwinger Lie algebra homomorphism, which identifies number-conserving second-quantized operators with their first-quantized action and induces an equivariant bijection between Fock occupations and su(d)\mathfrak{su}(d)su(d) weight states within the Schur--Weyl decomposition. Operationally, we deterministically prepare an superposition of target Schur labels and apply the inverse quantum Schur transform. For LLL configurations of NNN particles over ddd modes prepared to accuracy εεε, the most efficient variant of the algorithm runs with non-Clifford gate complexity poly(L,N,log⁡d,log⁡ε−1)\mathrm{poly}(L, N, \log d, \log ε^{-1})poly(L,N,logd,logε−1). The protocol applies universally to fermions, bosons, and Green's paraparticles in arbitrary single-particle bases. Resource estimates establish practicality within leading first-quantized pipelines, with statistics-aware specializations promising further reductions.
The completely antisymmetric solution ${\ensuremath{\Psi}}^{A}$ to the problem of the scattering of a fermion by a finite system of identical fermions is studied by means of the expansion ${\ensuremath{\Psi}}^{A}=\ensuremath{\Sigma}{\ensuremath{\phi}}_{\ensuremath{\alpha}}{\ensuremath{\psi}}_{\ensuremath{\alpha}}$, where ${{\ensuremath{\phi}}_{\ensuremath{\alpha}}}$ is a complete set of antisymmetric states for the target and ${\ensuremath{\psi}}_{\ensuremath{\alpha}}$ are one-particle functions. Coupled equations for the ${\ensuremath{\psi}}_{\ensuremath{\alpha}}$ are found that obey the proper boundary conditions. This is done by means of the integral equation for ${\ensuremath{\Psi}}^{A}$ and the use of projection operators. The elastic-scattering (optical-model) wave function ${\ensuremath{\psi}}_{0}$ is shown to obey an inhomogeneous differential equation, rather than a Schr\"odinger equation. The homogeneous solution is identical to the elastic wave function obtained when the projectile is distinguishable, while the inhomogeneous solution is due entirely to exchange effects. The function ${\ensuremath{\psi}}_{0}$ is identical to the optical-model wave function found by Bell and Squires, who showed that ${\ensuremath{\psi}}_{0}$ obeys a Schr\"odinger equation with an optical potential containing direct and exchange contributions. It is shown that ${\ensuremath{\psi}}_{0}$ yields the exact elastic amplitude including direct and exchange contributions, and a phase-shift analysis of the exchange term is given. The more standard form of solution ${\ensuremath{\Psi}}^{A}=\ensuremath{\Sigma}\mathcal{a}{{\ensuremath{\phi}}_{\ensuremath{\alpha}}{f}_{\ensuremath{\alpha}}}$, where a\mathcal{a}a is an antisymmetrizer, is briefly discussed. The extension to the cases of inelastic scattering and deuteron elastic scattering is made.
In this work, we present a quantum algorithm for direct first-principles simulation of electron-nuclear dynamics on a first-quantized real-space grid. Our algorithm achieves best-in-class efficiency for block-encoding the pre-Born-Oppenheimer molecular Hamiltonian by harnessing the linear scaling of swap networks for implementing the quadratic number of particle interactions, while using a novel alternating sign implementation of the Coulomb interaction that exploits highly optimized arithmetic routines. We benchmark our approach for a series of scientifically and industrially relevant chemical reactions. We demonstrate over an order-of-magnitude reduction in costs compared to previous state-of-the-art for the NH3+BF3\rm NH_3+BF_3NH3​+BF3​ reaction, achieving a Toffoli cost of 8.7×1098.7\times10^{9}8.7×109 per femtosecond using 136213621362 logical qubits (system + ancillas). Our results significantly lower the resources required for fault-tolerant simulations of photochemical reactions, while providing a suite of algorithmic primitives that are expected to serve as foundational building blocks for a broader class of quantum algorithms.