Noisy intermediate-scale quantum algorithms

K Bharti, A Cervera-Lierta, TH Kyaw, T Haug… - Reviews of Modern …, 2022‏ - APS
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 …

Emerging quantum computing algorithms for quantum chemistry

M Motta, JE Rice - Wiley Interdisciplinary Reviews …, 2022‏ - Wiley Online Library
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 …

Bose-Einstein condensation in quantum magnets

V Zapf, M Jaime, CD Batista - Reviews of Modern Physics, 2014‏ - APS
This article reviews experimental and theoretical work on Bose-Einstein condensation in
quantum magnets. These magnets are natural realizations of gases of interacting bosons …

Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians

NPD Sawaya, T Menke, TH Kyaw, S Johri… - npj Quantum …, 2020‏ - nature.com
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 …

Exact emergent higher-form symmetries in bosonic lattice models

SD Pace, XG Wen - Physical Review B, 2023‏ - APS
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 …

Theoretical investigation of magnetic dynamics in

W Wang, ZY Dong, SL Yu, JX Li - Physical Review B, 2017‏ - APS
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 …

Subspace methods for electronic structure simulations on quantum computers

M Motta, W Kirby, I Liepuoniute, KJ Sung… - Electronic …, 2024‏ - iopscience.iop.org
Quantum subspace methods (QSMs) are a class of quantum computing algorithms where
the time-independent Schrödinger equation for a quantum system is projected onto a …

A symmetry principle for topological quantum order

Z Nussinov, G Ortiz - Annals of Physics, 2009‏ - Elsevier
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 …

Simulating lattice gauge theories on a quantum computer

T Byrnes, Y Yamamoto - Physical Review A—Atomic, Molecular, and Optical …, 2006‏ - APS
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 …

Electron-phonon systems on a universal quantum computer

A Macridin, P Spentzouris, J Amundson, R Harnik - Physical review letters, 2018‏ - APS
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 …