Related papers: Realizable Hamiltonians for Universal Adiabatic Qu…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
A cluster state cannot be a unique ground state of a two-body interacting Hamiltonian. Here, we propose the creation of a cluster state of logical qubits encoded in spin-1/2 particles by adiabatically weakening two-body interactions. The…
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 discuss applications of shortcuts to adiabaticity (STA) to adiabatic quantum computation. After reviewing the fundamental properties and the present status of STA from the author's personal point of view, we apply the method to the…
A collective spin model is used to describe two species of mutually interacting ultracold bosonic atoms confined to a toroidal trap. The system is modeled by a Hamiltonian that can be split into two components, a linear part and a quadratic…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
Recently, synthetic spin-orbit coupling has been introduced into cold-atom systems for more flexible control of the Hamiltonian, which was further made time-varying through two-photon detuning to achieve dynamic control of the cold-atom…
Shortcuts to adiabaticity are alternative fast processes which reproduce the same final state as the adiabatic process in a finite or even shorter time, which have been extended from Hermitian systems to non-Hermitian systems in recent…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
In this work, we study a variant of the local Hamiltonian problem where we restrict to Hamiltonians that live on a lattice and are invariant under translations and rotations of the lattice. In the one-dimensional case this problem is known…
Quantum annealing (QA) is a generic method for solving optimization problems using fictitious quantum fluctuation. The current device performing QA involves controlling the transverse field; it is classically simulatable by using the…
A book about turning high-degree optimization problems into quadratic optimization problems that maintain the same global minimum (ground state). This book explores quadratizations for pseudo-Boolean optimization, perturbative gadgets used…
We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by…
We propose a quantum simulator based on driven superconducting qubits where the interactions are generated parametrically by a polychromatic magnetic flux modulation of a tunable bus element. Using a time-dependent Schrieffer-Wolff…
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…
While it is well-known that every nearly-periodic Hamiltonian system possesses an adiabatic invariant, extant methods for computing terms in the adiabatic invariant series are inefficient. The most popular method involves the heavy…
We provide a scheme for quantum computation in lattice systems via global but periodic manipulation, in which only effective periodic magnetic fields and global nearest neighbor interaction are required. All operations in our scheme are…
We present a simple quantum many-body system - a two-dimensional lattice of qubits with a Hamiltonian composed of nearest-neighbor two-body interactions - such that the ground state is a universal resource for quantum computation using…
Adiabatic quantum state evolution can be accelerated through a variety of shortcuts to adiabaticity. In one approach, a counterdiabatic quantum Hamiltonian $\hat H_{CD}$ is constructed to suppress nonadiabatic excitations. In the analogous…