A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

Digital quantum computers provide a computational framework for solving the Schrödinger
equation for a variety of many‐particle systems. Quantum computing algorithms for the …

Simulation of quantum systems is expected to be one of the most important applications of
quantum computing, with much of the theoretical work so far having focused on fermionic …

This article reviews experimental and theoretical work on Bose-Einstein condensation in
quantum magnets. These magnets are natural realizations of gases of interacting bosons …

We study spin-wave excitations in α-RuCl 3 by the spin-wave theory. Starting from the five-
orbital Hubbard model and the perturbation theory, we derive an effective isospin-1/2 model …

We present an algorithm that extends existing quantum algorithms for simulating fermion
systems in quantum chemistry and condensed matter physics to include bosons in general …

We present a unifying framework to study physical systems which exhibit topological
quantum order (TQO). The major guiding principle behind our approach is that of …

We examine the problem of simulating lattice gauge theories on a universal quantum
computer. The basic strategy of our approach is to transcribe lattice gauge theories in the …

Although condensed matter systems usually do not have higher-form symmetries, we show
that, unlike 0-form symmetry, higher-form symmetries can emerge as exact symmetries at …

We introduce a generalized Gaudin Lie algebra and a complete set of mutually commuting
quantum invariants allowing the derivation of several families of exactly solvable …