Related papers: Hamiltonian quantum computer in one dimension
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
Principal component analysis is an important dimension reduction technique in machine learning. In [S. Lloyd, M. Mohseni and P. Rebentrost, Nature Physics 10, 631-633, (2014)], a quantum algorithm to implement principal component analysis…
In the Hamiltonian formulation, Quantum Field Theory calculations scale exponentially with spatial volume, making real-time simulations intractable on classical computers and motivating quantum computation approaches. In Hamiltonian…
A `register' in quantum information processing -- is composition of k quantum systems, `qudits'. The dimensions of Hilbert spaces for one qudit and whole quantum register are d and d^k respectively, but we should have possibility to prepare…
We prove that adiabatic computation is equivalent to standard quantum computation even when the adiabatic quantum system is restricted to be a set of particles on a one-dimensional chain. We give a construction that uses a 2-local…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
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…
In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2+1 dimensional space-time. In…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers. The method integrates exact curvilinear kinetic energy operators and general-form potential energy surfaces expressed in a hybrid…
We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
We briefly review what a quantum computer is, what it promises to do for us, and why it is so hard to build one. Among the first applications anticipated to bear fruit is quantum simulation of quantum systems. While most quantum computation…
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…
Holonomic Quantum Computation (HQC) is an all-geometrical approach to quantum information processing. In the HQC strategy information is encoded in degenerate eigen-spaces of a parametric family of Hamiltonians. The computational network of…
We describe an alternative approach to quantum computation that is ideally suited for today's sub-threshold-fidelity qubits, and which can be applied to a family of hardware models that includes superconducting qubits with tunable coupling.…
Recent work has characterised rigorously what it means for one quantum system to simulate another, and demonstrated the existence of universal Hamiltonians -- simple spin lattice Hamiltonians that can replicate the entire physics of any…
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in…