相关论文: Realizable Hamiltonians for Universal Adiabatic Qu…

We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum…

We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability (Q2SAT) problem, which is a generalization of 2-satisfiability (2SAT) problem. For a Q2SAT problem, we construct the Hamiltonian which is similar to that of a…

Proposed is a generalization of Jordan-Wigner transform that allows to exactly fermionize a large family of quantum spin Hamiltonians in dimensions higher than one. The key new steps are to enlarge the Hilbert space of the original model by…

Exploiting inherent symmetries is a common and effective approach to speed up the simulation of quantum systems. However, efficiently accounting for non-Abelian symmetries, such as the $SU(2)$ total-spin symmetry, remains a major challenge.…

We consider error suppression schemes in which quantum information is encoded into the ground subspace of a Hamiltonian comprising a sum of commuting terms. Since such Hamiltonians are gapped they are considered natural candidates for…

We describe a many-body quantum system which can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field quantum information is localized on one boundary of the…

The rigorous approach aimed at providing exact analytical results for hybrid classical-quantum models is elaborated on the grounds of generalized algebraic mapping transformations. This conceptually simple method allows one to obtain novel…

One of the current major challenges surrounding the use of quantum annealers for solving practical optimization problems is their inability to encode even moderately sized problems---the main reason for this being the rigid layout of their…

Consider two quantum systems A and B interacting according to a product Hamiltonian H = H_A x H_B. We show that any two such Hamiltonians can be used to simulate each other reversibly (i.e., without efficiency losses) with the help of local…

We study the computational complexity of the Local Hamiltonian problem under the promise that its ground state is succinctly represented. We show that the Succinct State 2-Local Hamiltonian problem, for qubit Hamiltonians, is (promise)…

We show how quantum metrology protocols that seek to estimate the parameters of a Hamiltonian that exhibits a quantum phase transition can be efficiently simulated on an exponentially smaller quantum computer. Specifically, by exploiting…

The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…

Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge.…

We examine the problem of simulating lattice gauge theories on a universal quantum computer. The basic strategy of our approach is to transcribe lattice gauge theories in the Hamiltonian formulation into a Hamiltonian involving only Pauli…

Adiabatic quantum computing is an analog quantum computing scheme with various applications in solving optimization problems. In the parity picture of quantum optimization, the problem is encoded in local fields that act on qubits which are…

Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization. We introduce a transformation that…

The implementation of holonomic quantum computation on superconducting quantum circuits is challenging due to the general requirement of controllable complicated coupling between multilevel systems. Here we solve this problem by proposing a…

Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…

We introduce a two-body quantum Hamiltonian model with spins-$\half$ located on the vertices of a 2D spatial lattice. The model exhibits an exact topological degeneracy in all coupling regimes. This is a remarkable non-perturbative effect.…

Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…