Related papers: How many quantum gates do gauge theories require?
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step…
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of…
Numerical simulations have become an important tool to understand and predict non-perturbative phenomena in particle physics. In this article we attempt to present a general overview over the field. First, the basic concepts of lattice…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
We study the implementation of quantum channels with quantum computers while minimizing the experimental cost, measured in terms of the number of Controlled-NOT (C-NOT) gates required (single-qubit gates are free). We consider three…
Numerical simulation is an important method for verifying the quantum circuits used to simulate low-energy nuclear states. However, real-world applications of quantum computing for nuclear theory often generate deep quantum circuits that…
We develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. A qubit has dependence on a 1-qubit unitary…
Exploring low-cost applications is paramount to creating value in early fault-tolerant quantum computers. Here we optimize both gate and qubit counts of recent algorithms for simulating the Fermi-Hubbard model. We further devise and compile…
As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order $K$) makes a good candidate for simulating Hamiltonian dynamics. Here, we adapt the method but…
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.
Discrete translational symmetry plays a fundamental role in condensed matter physics and lattice gauge theories, enabling the analysis of systems that would otherwise be intractable. Despite this, many open problems remain. Quantum…
Cold atoms have become a powerful platform for quantum-simulating lattice gauge theories in higher spatial dimensions. However, such realizations have been restricted to the lowest possible truncations of the gauge field, which limit the…
We present a quantum computational framework for SU(2) lattice gauge theory, leveraging continuous variables instead of discrete qubits to represent the infinite-dimensional Hilbert space of the gauge fields. We consider a ladder as well as…
$\mathbb{Z}_3$ lattice gauge theory is the simplest discrete gauge theory with three-quark bound states, i.e., baryons. Since it has a finite-dimensional Hilbert space, it can be used for testing quantum simulation of lattice gauge theory…
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales…
Abelian and non-Abelian gauge theories are of central importance in many areas of physics. In condensed matter physics, Abelian U(1) lattice gauge theories arise in the description of certain quantum spin liquids. In quantum information…
The von Neumann and quantum R\'enyi entropies characterize fundamental properties of quantum systems and lead to theoretical and practical applications in many fields. Quantum algorithms for estimating quantum entropies, using a quantum…
Gate set tomography (GST) is a self-consistent and highly accurate method for the tomographic reconstruction of a quantum information processor's quantum logic operations, including gates, state preparations, and measurements. However,…
We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the…
Quantum circuit cutting has been proposed to help execute large quantum circuits using only small and noisy machines. Intuitively, cutting a qubit wire can be thought of as classically passing information of a quantum state along each…