Related papers: Universal 2-local Hamiltonian Quantum Computing
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
Quantum computer versus quantum algorithm processor in CMOS are compared to find (in parallel) all Hamiltonian cycles in a graph with m edges and n vertices, each represented by k bits. A quantum computer uses quantum states analogous to…
Many-body fermionic quantum calculations performed on analog quantum computers are restricted by the presence of k-local terms, which represent interactions among more than two qubits. These originate from the fermion-to-qubit mapping…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…
An adiabatic cyclic evolution of control parameters of a quantum system ends up with a holonomic operation on the system, determined entirely by the geometry in the parameter space. The operation is given either by a simple phase factor (a…
Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is $n \ge 2$.
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,…
Quantum computation promises applications that are thought to be impossible with classical computation. To realize practical quantum computation, the following three properties will be necessary: universality, scalability, and…
We show in detail how the Jordan-Wigner transformation can be used to simulate any fermionic many-body Hamiltonian on a quantum computer. We develop an algorithm based on appropriate qubit gates that takes a general fermionic Hamiltonian,…
The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…
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…
An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…
We present a protocol which allows a client to have a server carry out a quantum computation for her such that the client's inputs, outputs and computation remain perfectly private, and where she does not require any quantum computational…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…