Related papers: Universal qudit Hamiltonians
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…
We introduce a new family of Hamiltonians with a deformed Kepler- Coulomb potential dependent on an indexing parameter k. We show that this family is superintegrable for all rational k and compute the classical trajectories and quantum wave…
We summarize recent work showing that the $1/r^2$ model of interacting particles in 1-dimension is a universal Hamiltonian for quantum chaotic systems. The problem is analyzed in terms of random matrices and of the evolution of their…
We consider the generalized rotor Hamiltonians capable of describing quantum systems invariant with respect to symmetry point-groups that go beyond the usual D_2-symmetry of a tri-axial rotor. We discuss the canonical de-quantisation…
A central result in the study of Quantum Hamiltonian Complexity is that the k-Local hamiltonian problem is QMA-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above…
The Local Hamiltonian problem (finding the ground state energy of a quantum system) is known to be QMA-complete. The Local Consistency problem (deciding whether descriptions of small pieces of a quantum system are consistent) is also known…
We analyze a general family of position-dependent mass quantum Hamiltonians which are not self-adjoint and include, as particular cases, some Hamiltonians obtained in phenomenological approaches to condensed matter physics. We build a…
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…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
Dualities are hidden symmetries that map seemingly unrelated physical systems onto each other. The goal of this work is to systematically construct families of Hamiltonians endowed with a given duality and to provide a universal description…
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 universal algorithm to construct N-particle (classical and quantum) completely integrable Hamiltonian systems from representations of coalgebras with Casimir element is presented. In particular, this construction shows that quantum…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
Exactly solvable Hamiltonians are useful in the study of quantum many-body systems using quantum computers. In the variational quantum eigensolver, a decomposition of the target Hamiltonian into exactly solvable fragments can be used for…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
We construct a family of hermitian potentials in 1D quantum mechanics that converges in the zero-range limit to a $\delta$ interaction with an energy-dependent coupling. It falls out of the standard four-parameter family of pointlike…
We show, for the first time, that continuous dynamical decoupling can preserve the coherence of a two-qubit state as it evolves during a SWAP quantum operation. Hence, because the Heisenberg exchange interaction alone can be used for…
We consider quantum systems consisting of a linear chain of n harmonic oscillators coupled by a nearest neighbour interaction of the form $-q_r q_{r+1}$ ($q_r$ refers to the position of the $r$th oscillator). In principle, such systems are…
According to a fundamental result in quantum computing, any unitary transformation on a composite system can be generated using so-called 2-local unitaries that act only on two subsystems. Beyond its importance in quantum computing, this…
In a system of coupled harmonic oscillators, the interaction can be represented by a real, symmetric and positive definite interaction matrix. The quantization of a Hamiltonian describing such a system has been done in the canonical case.…