Related papers: Universal quantum computer from a quantum magnet
We study a model of quantum computation based on the continuously-parameterized yet finite-dimensional Hilbert space of a spin system. We explore the computational powers of this model by analyzing a pilot problem we refer to as the close…
We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…
We present an approximative simulation method for quantum many-body systems based on coarse graining the space of the momentum transferred between interacting particles, which leads to effective Hamiltonians of reduced size with the…
We prove the STP=BQP conjecture of Freedman, Hastings and Shokrian-Zini [1], namely that the two-qubit singlet/triplet measurement is quantum computationally universal given only an initial ensemble of maximally mixed single qubits. This…
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…
Using electrostatic gates to control the electron positions, we present a new controlled-NOT gate based on quantum dots. The qubit states are chosen to be the spin states of an excess conductor electron in the quantum dot; and the main…
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…
We show that the operators and the quadrupole and Zeeman Hamiltonians for a spin (3/2) can be represented in terms for a system of two coupling fictitious spins (1/2) using the Kronecker product of Pauli matrices. Particularly, the…
It is shown that every one-dimensional Hamiltonian with short-range interaction admits a quantum Gibbs sampler [CKG23] with a system-size independent spectral gap at all finite temperatures. Consequently, their Gibbs states can be prepared…
We derive a quantum spin Hamiltonian of the spin-1/2 zigzag chain realized in a rare earth ytterbium-based magnetic insulator, YbCuS2. This material undergoes a transition at 0.95K to an incommensurate magnetic phase with small moments,…
We prove the existence of gapped quantum Hamiltonians whose ground states exhibit an infinite entanglement length, as opposed to their finite correlation length. Using the concept of entanglement swapping, the localizable entanglement is…
Recent work has characterised rigorously what it means for one quantum system to simulate another, and demonstrated the existence of universal Hamiltonians -- simple spin lattice Hamiltonians that can replicate the entire physics of any…
Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate…
To gain deeper insight into the dynamics of complex quantum systems we need a quantum leap in computer simulations. We can not translate quantum behaviour arising with superposition states or entanglement efficiently into the classical…
We initiate a research program for the systematic investigation of quantum superintegrable systems involving the interaction of two non-relativistic particles with spin $1/2$ moving in the three-dimensional Euclidean space. In this paper,…
Quantum simulation using synthetic quantum systems offers unique opportunities to explore open questions in many-body physics and a path for the generation of useful entangled states. Nevertheless, so far many quantum simulators have been…
Today's devices for quantum computing are still far from implementing useful and powerful quantum algorithms. Decoherence and the wish to resist the effects of errors in a system of quantum bits incurs a lot of overhead in the number of…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…