Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum computing in spin-adapted representations for efficient simulations of spin systems

Published 19 Dec 2024 in quant-ph | (2412.14797v1)

Abstract: 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 $SU(2)$ total-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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 7 tweets with 0 likes about this paper.