Related papers: Measurement-Based Quantum Computation on Two-Body …
Models of quantum computation are important because they change the physical requirements for achieving universal quantum computation (QC). For example, one-way QC requires the preparation of an entangled "cluster" state followed by…
Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state…
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…
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 computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
The cluster state quantum computation is a versatile approach to build a scalable quantum computer. In this thesis we theoretically demonstrate that a one dimensional array of double quantum dots with long spin relaxation time can evolve to…
We consider measurement-based quantum computation using the state of a spin-lattice system in equilibrium with a thermal bath and free to evolve under its own Hamiltonian. Any single qubit measurements disturb the system from equilibrium…
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
Measurement-based quantum computation has revolutionized quantum information processing, and the physical systems with which it can be implemented. One simply needs the ability to prepare a particular state, known as the cluster state, and…
Measurement-based quantum computation utilizes an initial entangled resource state and proceeds with subsequent single-qubit measurements. It is implicitly assumed that the interactions between qubits can be switched off so that the…
We provide several examples and an intuitive diagrammatic representation demonstrating the use of two-qubit unitary transformations for mapping coupled spin Hamiltonians to simpler ones and vice versa. The corresponding dualities may be…
An algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems. By introducing ancillary qubits, this approach allows k-body interactions to be…
We consider measurement-based quantum computation (MBQC) on thermal states of the interacting cluster Hamiltonian containing interactions between the cluster stabilizers that undergoes thermal phase transitions. We show that the long-range…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
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 give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…