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:2410.02848 · Physical Review C

Simplified projection on total spin zero for state preparation on quantum computers

Evan Rule, Ionel Stetcu, Joseph Carlson

Published Dec 24, 2024• 4 citations
arXivHTMLPDF

Abstract

We introduce a simple algorithm for projecting on $J=0$ states of a many-body system by performing a series of rotations to remove states with angular momentum projections greater than zero. Existing methods rely on unitary evolution with the two-body operator ${J}^{2}$, which when expressed in the computational basis contains many complicated Pauli strings requiring Trotterization and leading to very deep quantum circuits. Our approach performs the necessary projections using the one-body operators ${J}_{x}$ and ${J}_{z}$. By leveraging the method of Cartan decomposition, the unitary transformations that perform the projection can be parametrized as a product of a small number of two-qubit rotations, with angles determined by an efficient classical optimization. Given the reduced complexity in terms of gates, this approach can be used to prepare approximate ground states of even-even nuclei by projecting onto the $J=0$ component of deformed Hartree-Fock states. We estimate the resource requirements in terms of the universal gate set ${H,S,\mathrm{CNOT},T}$ and briefly discuss a variant of the algorithm that projects onto $J=1/2$ states of a system with an odd number of fermions.

DOI
10.1103/physrevc.110.064003

Related papers

Quantum-state preparation with universal gate decompositions

Martin Plesch, Časlav Brukner

In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of $2$. It also reduces the total number of cnot gates from ${2}^{n}$ to $\frac{23}{24}{2}^{n}$ in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from $11$ cnot gates to $9$ and the depth from $11$ to $5$ steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

arXiv:1003.5760•Physical Review A•Mar 3, 2011•387 citations

Compressing Many-Body Fermion Operators under Unitary Constraints

Nicholas C. Rubin, Joonho Lee, Ryan Babbush

The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of Fermionic Gaussian circuits and Ising interaction-type circuits. These circuits arise from factorizing the two-body operators generating those unitaries as a sum of squared one-body operators that are simulated using product formulas. We introduce a numerical algorithm for performing this factorization that has an iteration complexity no worse than single particle basis transformations of the two-body operators and often results in many times fewer squared one-body operators in the sum of squares, compared to the analytical decompositions. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators and prepare the necessary high-quality initial states for techniques (like ADAPT-VQE) that iteratively construct approximations to the ground state.

arXiv:2109.05010•Journal of Chemical Theory and Computation•Feb 15, 2022•25 citations

A Novel Approach to State-to-State Transformation in Quantum Computing

Artyom M. Grigoryan, Alexis A. Gomez, Sos С. Agaian

This article presents a new approach to the problem of transforming one quantum state into another. It is shown that an r-qubit superposition |x⟩ can be obtained from another r-qubit superposition |y⟩, by using only (2r−1) rotations, each presented by one controlled rotation gate. The quantum superpositions with real amplitudes are considered. The traditional two-stage approach Uy−1Ux:|x⟩→|0⟩⊕r→|y⟩ requires twice as many rotations. Here, both transformations to the conventual basis state, Ux: |x⟩→ |0⟩⊕r and Uy: |y⟩→ |0⟩⊕r, use (2r−1) rotations each on two binary planes, and many of these rotations require additional sets of CNOTs to be represented as 1- or 2-qubit-controlled gates. The proposed method is based on the concept of the discrete signal-induced heap transform (DsiHT) which is unitary and generated by a vector and a set of angular equations with given parameters. The quantum analog of this transform is described. The main characteristic of the DsiHT is the path of processing the data. It is shown that there exist such fast paths that allow for effective computing of the DsiHT, which leads to the simple quantum circuits for state preparation and transformation. Examples of such paths are given and quantum circuits for preparation and transformation of 2-, 3-, and 4-qubits are described in detail. CNOT gates are not used, but only controlled gates of elementary rotations around the y-axis. It is shown that the transformation and, in particular, only rotation gates with control qubits are required for initialization of 2-, 3-, and 4-qubits. The quantum circuits are simple and have a recursive form, which makes them easy to implement for arbitrary r-qubit superposition, with r≥2. This approach significantly reduces the complexity of quantum state transformations, paving the way for more efficient quantum algorithms and practical implementations on near-term quantum devices.

Information•Aug 13, 2025•7 citations

Symmetry conservation with Trotterization and Quantum Phase Estimation

Edith Leal-Sánchez, Fanny Vain, Jong-Kwon Ha +1 more

Quantum algorithms for quantum chemistry and other many-body fermionic systems work by expressing the Hamiltonian in a basis of qubits and fragmenting the Hamiltonian into a sum of products of Pauli operators whose exponentials are easily encoded on a quantum device. Applying the product of exponentials, known as Trotterization, leads to an error associated with the non-commutativity of operators. This error can lead to breaking the symmetries of the Hamiltonian because the fragments are not symmetry conserving in general. Nonetheless, many algorithms for time evolution rely on Trotterization, including time evolution and quantum phase estimation. We show that we can express the Hamiltonian in terms of Hermitian excitation operators which map to sums of commuting Pauli strings for any encoding and conserve symmetries corresponding to Abelian groups of symmetry operators. Symmetries corresponding to non-Abelian groups, on the other hand, are not fully conserved by Trotterized Hermitian excitation operators, so we developed ``operator kirigami'' to cut the sum of non-commuting operators by orthogonal projection and to fold terms together using unitary rotations. We tested pools of operators for small molecules and basis sets, and found that electron number and spin symmetry conserving pools led to greater errors that decreased for larger molecules and were negated with second-order Trotterization. Our work shows the potential for testing quantum computing algorithms on classical computers by adapting tools used in electronic structure theory with conserved symmetries.

quant-pharXiv:2607.01560•Jul 3, 2026•0 citations

Universal construction of unitary transformation of quantum computation with one- and two-body interactions

Xijia Miao

Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary representation in usual computational basis. This decomposition may be simplified greatly with the help of the properties of the finite-dimensional multiple-quantum operator algebra spaces of a quantum system and the specific properties of a given quantum algorithm. As elementary building blocks of quantum computation, the two-qubit diagonal gates and one-qubit gates may be constructed physically with one- and two-body interactions in a two-state quantum system and hence could be conveniently realized experimentally. The present work will be helpful for implementing generally any N-qubit quantum computation in those feasible two-state quantum systems and determining conveniently the time evolution of these systems in course of quantum computation.

arXiv:quant-ph/0003068•Mar 17, 2000•13 citations

Preparing angular momentum eigenstates using engineered quantum walks

Yuan Cheng Shi, Kristin M. Beck, Michael Kruse +1 more

Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta ${\mathbf{J}}_{1}$ and ${\mathbf{J}}_{2}$, forming eigenstates of their total angular momentum $\mathbf{J}={\mathbf{J}}_{1}+{\mathbf{J}}_{2}$, we develop a quantum-walk scheme that does not require inputting $O({j}^{3})$ nonzero Clebsch--Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of $O(j)$ and a worst-case complexity of $O({j}^{3})$. Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in $\text{su}(2)\ifmmode\times\else\texttimes\fi{}\text{su}(2)$, which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. We also implement small test problems on current quantum hardware.

arXiv:2408.14684•Physical Review A•Dec 16, 2024•2 citations
We introduce a simple algorithm for projecting on J=0J=0J=0 states of a many-body system by performing a series of rotations to remove states with angular momentum projections greater than zero. Existing methods rely on unitary evolution with the two-body operator J2{J}^{2}J2, which when expressed in the computational basis contains many complicated Pauli strings requiring Trotterization and leading to very deep quantum circuits. Our approach performs the necessary projections using the one-body operators Jx{J}_{x}Jx​ and Jz{J}_{z}Jz​. By leveraging the method of Cartan decomposition, the unitary transformations that perform the projection can be parametrized as a product of a small number of two-qubit rotations, with angles determined by an efficient classical optimization. Given the reduced complexity in terms of gates, this approach can be used to prepare approximate ground states of even-even nuclei by projecting onto the J=0J=0J=0 component of deformed Hartree-Fock states. We estimate the resource requirements in terms of the universal gate set H,S,CNOT,T{H,S,\mathrm{CNOT},T}H,S,CNOT,T and briefly discuss a variant of the algorithm that projects onto J=1/2J=1/2J=1/2 states of a system with an odd number of fermions.
In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 222. It also reduces the total number of cnot gates from 2n{2}^{n}2n to 23242n\frac{23}{24}{2}^{n}2423​2n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 111111 cnot gates to 999 and the depth from 111111 to 555 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.
The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of Fermionic Gaussian circuits and Ising interaction-type circuits. These circuits arise from factorizing the two-body operators generating those unitaries as a sum of squared one-body operators that are simulated using product formulas. We introduce a numerical algorithm for performing this factorization that has an iteration complexity no worse than single particle basis transformations of the two-body operators and often results in many times fewer squared one-body operators in the sum of squares, compared to the analytical decompositions. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators and prepare the necessary high-quality initial states for techniques (like ADAPT-VQE) that iteratively construct approximations to the ground state.
This article presents a new approach to the problem of transforming one quantum state into another. It is shown that an r-qubit superposition |x⟩ can be obtained from another r-qubit superposition |y⟩, by using only (2r−1) rotations, each presented by one controlled rotation gate. The quantum superpositions with real amplitudes are considered. The traditional two-stage approach Uy−1Ux:|x⟩→|0⟩⊕r→|y⟩ requires twice as many rotations. Here, both transformations to the conventual basis state, Ux: |x⟩→ |0⟩⊕r and Uy: |y⟩→ |0⟩⊕r, use (2r−1) rotations each on two binary planes, and many of these rotations require additional sets of CNOTs to be represented as 1- or 2-qubit-controlled gates. The proposed method is based on the concept of the discrete signal-induced heap transform (DsiHT) which is unitary and generated by a vector and a set of angular equations with given parameters. The quantum analog of this transform is described. The main characteristic of the DsiHT is the path of processing the data. It is shown that there exist such fast paths that allow for effective computing of the DsiHT, which leads to the simple quantum circuits for state preparation and transformation. Examples of such paths are given and quantum circuits for preparation and transformation of 2-, 3-, and 4-qubits are described in detail. CNOT gates are not used, but only controlled gates of elementary rotations around the y-axis. It is shown that the transformation and, in particular, only rotation gates with control qubits are required for initialization of 2-, 3-, and 4-qubits. The quantum circuits are simple and have a recursive form, which makes them easy to implement for arbitrary r-qubit superposition, with r≥2. This approach significantly reduces the complexity of quantum state transformations, paving the way for more efficient quantum algorithms and practical implementations on near-term quantum devices.
Quantum algorithms for quantum chemistry and other many-body fermionic systems work by expressing the Hamiltonian in a basis of qubits and fragmenting the Hamiltonian into a sum of products of Pauli operators whose exponentials are easily encoded on a quantum device. Applying the product of exponentials, known as Trotterization, leads to an error associated with the non-commutativity of operators. This error can lead to breaking the symmetries of the Hamiltonian because the fragments are not symmetry conserving in general. Nonetheless, many algorithms for time evolution rely on Trotterization, including time evolution and quantum phase estimation. We show that we can express the Hamiltonian in terms of Hermitian excitation operators which map to sums of commuting Pauli strings for any encoding and conserve symmetries corresponding to Abelian groups of symmetry operators. Symmetries corresponding to non-Abelian groups, on the other hand, are not fully conserved by Trotterized Hermitian excitation operators, so we developed ``operator kirigami'' to cut the sum of non-commuting operators by orthogonal projection and to fold terms together using unitary rotations. We tested pools of operators for small molecules and basis sets, and found that electron number and spin symmetry conserving pools led to greater errors that decreased for larger molecules and were negated with second-order Trotterization. Our work shows the potential for testing quantum computing algorithms on classical computers by adapting tools used in electronic structure theory with conserved symmetries.
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary representation in usual computational basis. This decomposition may be simplified greatly with the help of the properties of the finite-dimensional multiple-quantum operator algebra spaces of a quantum system and the specific properties of a given quantum algorithm. As elementary building blocks of quantum computation, the two-qubit diagonal gates and one-qubit gates may be constructed physically with one- and two-body interactions in a two-state quantum system and hence could be conveniently realized experimentally. The present work will be helpful for implementing generally any N-qubit quantum computation in those feasible two-state quantum systems and determining conveniently the time evolution of these systems in course of quantum computation.
Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta J1{\mathbf{J}}_{1}J1​ and J2{\mathbf{J}}_{2}J2​, forming eigenstates of their total angular momentum J=J1+J2\mathbf{J}={\mathbf{J}}_{1}+{\mathbf{J}}_{2}J=J1​+J2​, we develop a quantum-walk scheme that does not require inputting O(j3)O({j}^{3})O(j3) nonzero Clebsch--Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of O(j)O(j)O(j) and a worst-case complexity of O(j3)O({j}^{3})O(j3). Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in $\text{su}(2)\ifmmode\times\else\texttimes\fi{}\text{su}(2)$, which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. We also implement small test problems on current quantum hardware.