Quantum computers are promising tools for the simulation of many-body systems, and among those, QCD stands out by its rich phenomenology. Every simulation starts with a codification, and here we succently review a newly developed compact encoding based on the identification between registers and particles; the quantum memory is divided into registers, and to each we associate a Hilbert space of dimension the number of degrees of freedom of the codified particles. In this way we gain an exponential compression over direct encodings for a low number of particles with many degrees of freedom. As an example we apply this encoding on a two-register memory and implement antisymmetrization and exponentiation algorithms.
Quantum devices may overcome limitations of classical computers in studies of nuclear structure functions and parton Wigner distributions of protons and nuclei. In this talk, we discuss a worldline approach to compute nuclear structure functions in the high energy Regge limit of QCD using a hybrid quantum computer, by expressing the fermion determinant in the QCD path integral as a quantum mechanical path integral over $0+1$-dimensional fermionic and bosonic world-lines in background gauge fields. Our simplest example of computing the well-known dipole model result for the structure function $…
Starting from the Quantum-Phase-Estimate (QPE) algorithm, a method is proposed to construct entangled states that describe correlated many-body systems on quantum computers. Using operators for which the discrete set of eigenvalues is known, the QPE approach is followed by measurements that serve as projectors on the entangled states. These states can then be used as inputs for further quantum or hybrid quantum-classical processing. When the operator is associated to a symmetry of the Hamiltonian, the approach can be seen as a quantum--computer formulation of symmetry breaking followed by symm…
We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail.
The phase diagram of quantum chromodynamics in one dimension on a quantum computer
Joint Quantum Institute and Department of Physics, University of Maryland（马里兰大学联合量子研究所和物理系）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）；Department of Physics & Astronomy, University of Waterloo（滑铁卢大学物理与天文系）；College of William & Mary（威廉玛丽学院）；Department of Physics and Astronomy, York University（约克大学物理与天文系）
We show that current noisy quantum computers are ideal platforms for the simulation of quantum many-body dynamics in generic open systems. We demonstrate this using the IBM Quantum Computer as an experimental platform for confirming the theoretical prediction from [Phys. Rev. Lett.124, 100604 (2020)] of an emergent hierarchy of relaxation timescales of many-body observables involving different numbers of qubits. Using different protocols, we leverage the intrinsic dissipation of the machine responsible for gate errors, to implement a quantum simulation of generic (i.e. structureless) local dis…
We estimate the resources required to prepare the ground state of a quantum many-body system on a quantum computer of intermediate size. This estimate is made possible using a combination of quantum many-body methods and analytic upper bounds. Our routine can also be used to optimize certain design parameters for specific problem instances. Lastly, we propose and benchmark an improved quantum state preparation procedure. We find that it reduces the circuit T-depth by a factor as large as $10^6$ for intermediate-size lattices.
Extensions of average Hamiltonian theory to quantum computation permit the design of arbitrary Hamiltonians, allowing rotations throughout a large Hilbert space. In this way, the kinematics and dynamics of any quantum system may be simulated by a quantum computer. A basis mapping between the systems dictates the average Hamiltonian in the quantum computer needed to implement the desired Hamiltonian in the simulated system. The flexibility of the procedure is illustrated with NMR on 13-C labelled Alanine by creating the non-physical Hamiltonian ZZZ corresponding to a three body interaction.
Universal quantum computers are potentially an ideal setting for simulating many-body quantum dynamics that is out of reach for classical digital computers. We use state-of-the-art IBM quantum computers to study paradigmatic examples of condensed matter physics -- we simulate the effects of disorder and interactions on quantum particle transport, as well as correlation and entanglement spreading. Our benchmark results show that the quality of the current machines is below what is necessary for quantitatively accurate continuous time dynamics of observables and reachable system sizes are small …
We explore the possibility to perform symmetry restoration with the variation after projection technique on a quantum computer followed by additional post-processing. The final goal is to develop configuration interaction techniques based on many-body trial states pre-optimized on a quantum computer. We show how the projection method used for symmetry restoration can prepare optimized states that could then be employed as initial states for quantum or hybrid quantum-classical algorithms. We use the quantum phase estimation and quantum Krylov approaches for the post-processing. The latter metho…
Many-body localization, the persistence against electron-electron interactions of the localization of states with non-zero excitation energy density, poses a challenge to current methods of theoretical and numerical analysis. Numerical simulations have so far been limited to a small number of sites, making it difficult to obtain reliable statements about the thermodynamic limit. In this paper, we explore the ways in which a relatively small quantum computer could be leveraged to study many-body localization. We show that, in addition to studying time-evolution, a quantum computer can, in polyn…
In the effort to design and to construct a quantum computer, several leading proposals make use of spin-based qubits. These designs generally assume that spins undergo pairwise interactions. We point out that, when several spins are engaged mutually in pairwise interactions, the quantitative strengths of the interactions can change and qualitatively new terms can arise in the Hamiltonian, including four-body interactions. In parameter regimes of experimental interest, these coherent effects are large enough to interfere with computation, and may require new error correction or avoidance techni…
Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to determine the one with lowest energy, requiring a running time proportional to N. A quantum computer, if it could be built, could solve this problem in time sqrt(N). Here, we present a powerful extension of this result to the case of interacting quantum particles, demonstrating that a quantum computer can prepare the ground state of a quantum system as efficientl…
A disordered system of interacting particles exhibits localized behavior when the disorder is large compared to the interaction strength. Studying this phenomenon on a quantum computer without error correction is challenging because even weak coupling to a thermal environment destroys most signatures of localization. Fortunately, spectral functions of local operators are known to contain features that can survive the presence of noise. In these spectra, discrete peaks and a soft gap at low frequencies compared to the thermal phase indicate localization. Here, we present the computation of spec…
We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body interactions, so that it equips built-in robustness against noise. Second, computation is processed by single-spin measurements along multiple chains dynamically coupled on demand, so as to keep teleporting only logical information into a gap-protected ground state of the residual chains after the interactions with spins to be measured are turned off. We descri…
Quantum chromodynamics - the theory of quarks and gluons - has been known for decades, but it is yet to be fully understood. A recent example is the prediction and experimental discovery of tetraquarks, that opened a new research field. Crucially, numerous unsolved questions of the standard model can exclusively be addressed by nonperturbative calculations. Quantum computers can solve problems for which well established QCD methods are inapplicable, such as real-time evolution. We take a key step in exploring this possibility by performing a real-time evolution of tetraquark and pentaquark phy…
We discuss here some aspects related to the symmetries of a quantum many-body problem when trying to treat it on a quantum computer. Several features related to symmetry conservation, symmetry breaking, and possible symmetry restoration are reviewed. After briefly discussing some of the standard symmetries relevant for many-particle systems, we discuss the advantage of encoding some symmetries directly in quantum ansätze, especially to reduce the quantum register size. It is, however, well-known that the use of symmetry-breaking states can also be a unique way to incorporate specific internal …
A general class of discrete unitary models are described whose behavior in the continuum limit corresponds to a many-body Schrodinger equation. On a quantum computer, these models could be used to simulate quantum many-body systems with an exponential speedup over analogous simulations on classical computers. On a classical computer, these models give an explicitly unitary and local prescription for discretizing the Schrodinger equation. It is shown that models of this type can be constructed for an arbitrary number of particles moving in an arbitrary number of dimensions with an arbitrary int…
The generating function of a Hamiltonian $H$ is defined as $F(t)=\langle e^{-itH}\rangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. This function gives access to the different moments of the Hamiltonian $\langle H^{K}\rangle$ at various orders $K$. The real and imaginary parts of $F(t)$ can be respectively evaluated on quantum computers using one extra ancillary qubit with a set of measurement for each value of the time $t$. The low cost in terms of qubits renders it very attractive in the near term period where the number of qubits is li…
Highly excited many-particle states in quantum systems (nuclei, atoms, quantum dots, spin systems, quantum computers) can be ``chaotic'' superpositions of mean-field basis states (Slater determinants, products of spin or qubit states). This is a result of the very high energy level density of many-body states which can be easily mixed by a residual interaction between particles. We consider the time dynamics of wave functions and increase of entropy in such chaotic systems. As an example we present the time evolution in a closed quantum computer. A time scale for the entropy S(t) increase is t…
We perform quantum simulation on classical and quantum computers and set up a machine learning framework in which we can map out phase diagrams of known and unknown quantum many-body systems in an unsupervised fashion. The classical simulations are done with state-of-the-art tensor network methods in one and two spatial dimensions. For one dimensional systems, we utilize matrix product states (MPS) that have many practical advantages and can be optimized using the efficient density matrix renormalization group (DMRG) algorithm. The data for two dimensional systems is obtained from entangled pr…
Digital quantum simulation uses the capabilities of quantum computers to determine the dynamics of quantum systems, which are beyond the computability of modern classical computers. A notoriously challenging task in this field is the description of non-equilibrium dynamics in quantum many-body systems. Here we use the IBM quantum computers to simulate the non-equilibrium dynamics of few spin and fermionic systems. Our results reveal, that with a combination of error mitigation, noise extrapolation and optimized initial state preparation, one can tackle the most important drawbacks of modern qu…
Interacting quantum systems illustrate complex phenomena including phase transitions to novel ordered phases. The universal nature of critical phenomena reduces their description to determining only the transition temperature and the critical exponents. Numerically calculating these results for systems in new universality classes is complicated due to critical slowing down, requiring increasing resources near the critical point. An alternative approach analytically continues the calculation onto the complex plane and determines the partition function via its zeros. Here we show how to robustly…
