相关论文: A simple nearest-neighbor two-body Hamiltonian sys…
We present a general procedure for constructing lattices of qubits with a Hamiltonian composed of nearest-neighbour two-body interactions such that the ground state encodes a cluster state. We give specific details for lattices in one-,…
Many-body entangled quantum states studied in condensed matter physics can be primary resources for quantum information, allowing any quantum computation to be realized using measurements alone, on the state. Such a universal state would be…
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…
Entanglement between the constituents of a quantum system is an essential resource in the implementation of many quantum processes and algorithms. Indeed, universal quantum computation is possible by measuring individual qubits comprising…
We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…
Computing many-body ground state energies and resolving electronic structure calculations are fundamental problems for fields such as quantum chemistry or condensed matter. Several quantum computing algorithms that address these problems…
Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state…
We propose a framework to design concurrently a frustration-free quantum many-body Hamiltonian and its numerically exact ground states on a sufficiently large finite-size cluster in one and two dimensions using an elementary matrix product…
Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state. Resource states can arise from ground states of carefully designed two-body interacting Hamiltonians. This…
The common spin Hamiltonians such as the Ising, XY, or Heisenberg model do not have ground states that are the graph states needed in measurement-based quantum computation. Various highly-entangled many-body states have been suggested as a…
We show that a local Hamiltonian of spin-3/2 particles with only two-body nearest-neighbor Affleck-Kennedy-Lieb-Tasaki and exchange-type interactions has an unique ground state, which can be used to implement universal quantum computation…
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…
Quantum many-body systems exhibit an extremely diverse range of phases and physical phenomena. Here, we prove that the entire physics of any other quantum many-body system is replicated in certain simple, "universal" spin-lattice models. We…
Estimating ground state energies of many-body Hamiltonians is a central task in many areas of quantum physics. In this work, we give quantum algorithms which, given any $k$-body Hamiltonian $H$, compute an estimate for the ground state…
Numerical simulation of lattice gauge theories is an indispensable tool in high energy physics, and their quantum simulation is expected to become a major application of quantum computers in the future. In this work, for an Abelian lattice…
We establish a connection between ground states of local quantum Hamiltonians and thermal states of classical spin systems. For any discrete classical statistical mechanical model in any spatial dimension, we find an associated quantum…
A numerical bootstrap method is proposed to provide rigorous and nontrivial bounds in general quantum many-body systems with locality. In particular, lower bounds on ground state energies of local lattice systems are obtained by imposing…
We propose a general strategy to develop quantum many-body approximations of primitives in linear algebra algorithms. As a practical example, we introduce a coupled-cluster inspired framework to produce approximate Hamiltonian moments, and…
The two-dimensional cluster state, a universal resource for measurement-based quantum computation, is also the gapped ground state of a short-ranged Hamiltonian. Here, we examine the effect of perturbations to this Hamiltonian. We prove…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…