Related papers: Universal quantum computer from a quantum magnet
In recent decades the field of quantum computation has seen remarkable development. While much progress has been made toward the realization of a fully digital, scalable, and fault tolerant quantum computer, there are still many essential…
We suggest using the method of quantum annealing for computing the ground state of the Heisenberg spin chains. Our initial Hamiltonian describes a spin system in a highly non-uniform magnetic field. The initial Hamiltonian gradually…
We prove that universal quantum computation can be realized---using only linear optics and $\chi^{(2)}$ (three-wave mixing) interactions---in any $(n+1)$-dimensional qudit basis of the $n$-pump-photon subspace. First, we exhibit a strictly…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
A measurement-based quantum computer could consist of a local-gapped Hamiltonian system, whose thermal states --at sufficiently low temperature-- are universal resources for the computation. Initialization of the computer would correspond…
The physics of a closed quantum mechanical system is governed by its Hamiltonian. However, in most practical situations, this Hamiltonian is not precisely known, and ultimately all there is are data obtained from measurements on the system.…
Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint…
We report on our systematic attempts at finding local interactions for which the lowest-Landau-level projected composite-fermion wave functions are the unique zero energy ground states. For this purpose, we study in detail the simplest…
We demonstrate how a one parameter family of interacting non-commuting Hamiltonians, which are physically equivalent, can be constructed in non-commutative quantum mechanics. This construction is carried out exactly (to all orders in the…
We consider a quantum mechanical three-particle system made of two identical fermions of mass one and a different particle of mass $ m $, where each fermion interacts via a zero-range force with the different particle. In particular we…
We propose a detailed analysis of datasets generated from simulations of two-dimensional quantum spin systems using the quantum Ising model at absolute zero temperature. Our focus is on examining how fundamental physical properties, energy,…
We consider the geometry of quantum states associated with different classes of random matrix Hamiltonians, in particular ensembles that show integrability to chaotic transition in terms of the nearest neighbour energy level spacing…
Multipartite quantum states saturating the Heisenberg limit of sensitivity typically require full-body correlators to be prepared. On the other hand, experimentally practical Hamiltonians often involve few-body correlators only. Here, we…
We combine elements of the 1998 quantum computing proposals by Privman, Vagner and Kventsel, and by Kane, with the new idea of nuclear-spin qubit interactions mediated indirectly via the bound outer electrons of impurity atoms whose nuclear…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
We propose a method for Hamiltonian engineering in quantum information processing architectures that requires no local control, but only relies on collective qubit rotations and field gradients. The technique achieves a spatial modulation…
Current quantum devices execute specific tasks that are hard for classical computers and have the potential to solve problems such as quantum simulation of material science and chemistry, even without error correction. For practical…
The task of estimating the ground state of Hamiltonians is an important problem in physics with numerous applications ranging from solid-state physics to combinatorial optimization. We provide a hybrid quantum-classical algorithm for…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
In this paper, we investigate a system of quantum electrodynamics with cutoffs. The total Hamiltonian is defined on a tensor product of a fermion Fock space and a boson Fock. It is shown that, under spatially localized conditions and…