Search NASA⌕ Search
Home/Archive/DOE OSTI

DOE OSTI · 1856055

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

Carbone, Alessandro [Ecole Polytechnique Federale Lausanne (EPFL) (Switzerland); Univ. degli Studi di Milano (Italy)]·Galli, Davide Emilio [Univ. degli Studi di Milano (Italy)] (ORCID:0000000213121181)·Motta, Mario [IBM Research-Almaden, San Jose, CA (United States)]·Jones, Barbara [IBM Research-Almaden, San Jose, CA (United States)]
View original source ↗Export metadata ↓

Abstract

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.

Explore related subjects

97 MATHEMATICS AND COMPUTINGeigenstatesquantum computingquantum error mitigationspin liquids

Keep this discovery

BibTeXRIS

Carbone, Alessandro [Ecole Polytechnique Federale Lausanne (EPFL) (Switzerland); Univ. degli Studi di Milano (Italy)], Galli, Davide Emilio [Univ. degli Studi di Milano (Italy)] (ORCID:0000000213121181), Motta, Mario [IBM Research-Almaden, San Jose, CA (United States)], Jones, Barbara [IBM Research-Almaden, San Jose, CA (United States)]. 2022-03-21. Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers. https://doi.org/10.3390/sym14030624

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

97 MATHEMATICS AND COMPUTING subjecteigenstates subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

DOE OSTI2026

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code

In this work, we propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial state, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. We prove that fast mixing at low temperature for the two-dimensional toric code can be achieved by augmenting local jump operators with simple global jump operators, which enable efficient transitions between logical sectors. To establish tight lower bounds on the spectral gap, we introduce a new reduction method that eventually maps the problem to estimating the spectral gap of a perturbed graph Laplacian on a stair graph. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state toward the ground state manifold.

97 MATHEMATICS AND COMPUTING↗