Exploiting inherent symmetries is a common and effective approach to speed up the simulation of quantum systems. However, efficiently accounting for non-Abelian symmetries, such as the global SU(2) spin symmetry, remains a major challenge. In fact, expressing total-spin eigenstates in terms of the computational basis can require an exponentially large number of coefficients. In this work, we introduce a novel formalism for designing quantum algorithms directly in an eigenbasis of the total-spin operator. Our strategy relies on the symmetric group approach in conjunction with a truncation scheme for the internal degrees of freedom of total-spin eigenstates. For the case of the antiferromagnetic Heisenberg model, we show that this formalism yields a hierarchy of spin-adapted Hamiltonians, for each truncation threshold, whose ground-state energy and wave function quickly converge to their exact counterparts, calculated on the full model. These truncated Hamiltonians can be encoded with sparse and local qubit Hamiltonians that are suitable for quantum simulations. We demonstrate this by developing a state-preparation schedule to construct shallow quantum-circuit approximations, expressed in a total-spin eigenbasis, for the ground states of the Heisenberg Hamiltonian in different symmetry sectors.
The measurement of the nuclear spin state in the Kane's solid-state quantum computer was investigated for a simple two-qubit system. To simplify the calculations, the Hamiltonian matrix was divided into five invariant subspaces based on the projection of the total spins along the external magnetic field. The calculations analyzed the relations between the eigenvalues and eigenstates of the Hamiltonian matrix and the interactions between the two electrons. The results show that measurement of the nuclear spin state by exchanging the nuclear and election spin wave functions is restricted. Only four of the sixteen possible states in a two-qubit system can be measured using this method.
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
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 and
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=0 component of deformed Hartree-Fock states. We estimate the resource requirements in terms of the universal gate set
H,S,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.
A general quantum search algorithm aims to evolve a quantum system from a known source state $|s\ensuremath{\rangle}$ to an unknown target state $|t\ensuremath{\rangle}$. It uses a diffusion operator
Ds that has the source state as one of its eigenstates and
It, where ${I}_{\ensuremath{\psi}}$ denotes the selective phase inversion of the $|\ensuremath{\psi}\ensuremath{\rangle}$ state. It evolves $|s\ensuremath{\rangle}$ to a particular state $|w\ensuremath{\rangle}$, which we will call the
w state, in $O(B/\ensuremath{\alpha})$ time steps, where $\ensuremath{\alpha}$ is $|\ensuremath{\langle}t|s\ensuremath{\rangle}|$ and
B is a characteristic of the diffusion operator. Measuring the
w state gives the target state with a success probability of
O(1/B2), and
O(B2) applications of the algorithm can boost it from
O(1/B2) to
O(1), making the total time complexity $O({B}^{3}/\ensuremath{\alpha})$. In the special case of Grover's algorithm,
Ds is
Is and
B is very close to 1. A more efficient way to boost the success probability is quantum amplitude amplification provided we can efficiently implement
Iw. Such an efficient implementation is not known so far. In this paper, we present an efficient algorithm to approximate selective phase inversions of the unknown eigenstates of an operator using a phase estimation algorithm. This algorithm is used to efficiently approximate
Iw, which reduces the time complexity of general algorithm to $O(B/\ensuremath{\alpha})$. Although $O(B/\ensuremath{\alpha})$ algorithms are known to exist, our algorithm offers physical implementation advantages.
Binary tree states (BTSs) are states whose decomposition on a quantum register basis formed by a set of qubits can be made sequentially. Such states sometimes appear naturally in many-body systems treated in Fock space when a global symmetry is imposed, such as the total spin or particle number symmetries. Examples are the Dicke states, the eigenstates of the total spin for a set of particles having individual spin
1/2, or states obtained by projecting a BCS states onto particle number, also called projected BCS in small superfluid systems. Starting from a BTS described on the set of
n qubits or orbitals, the entanglement entropy of any subset of
k qubits is analyzed. Specifically, a practical method is developed to access the
k-qubit or
k-particle von Neumann entanglement entropy of the subsystem of interest. Properties of these entropies are discussed, including scaling properties, upper bounds, or how these entropies correlate with fluctuations. Illustrations are given for the Dicke state and the projected BCS states.
The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.