Related papers: Ground State Quantum Computation
We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body…
A new implementation of the topological cluster state quantum computer is suggested, in which the basic elements are linear optics, measurements, and a two-dimensional array of quantum dots. This overcomes the need for non-linear devices to…
Recently we have introduced a lightweight, perturbative approach to quantum solitons. Thus far, our approach has been largely limited to configurations consisting of a single soliton plus a finite number of mesons, whose classical limit is…
We propose an experimental design for universal continuous-variable quantum computation that incorporates recent innovations in linear-optics-based continuous-variable cluster state generation and cubic-phase gate teleportation. The first…
A central result in the study of Quantum Hamiltonian Complexity is that the k-Local hamiltonian problem is QMA-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above…
A solid-state implementation of a quantum computer composed entirely of silicon is proposed. Qubits are Si-29 nuclear spins arranged as chains in a Si-28 (spin-0) matrix with Larmor frequencies separated by a large magnetic field gradient.…
We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell…
We investigate non-Gaussian states of light as ancillary inputs for generating nonlinear transformations required for quantum computing with continuous variables. We consider a recent proposal for preparing a cubic phase state, find the…
This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
One-way quantum computation proceeds by sequentially measuring individual spins (qubits) in an entangled many-spin resource state. It remains a challenge, however, to efficiently produce such resource states. Is it possible to reduce the…
We report an experimental realization of one-way quantum computing on a two-photon four-qubit cluster state. This is accomplished by developing a two-photon cluster state source entangled both in polarization and spatial modes. With this…
Generating large, non-trivial quantum chemistry test problems with known ground-state solutions remains a core challenge for benchmarking electronic structure methods. Inspired by planted-solution techniques from combinatorial optimization,…
In the current era of noisy quantum devices, there is a need for quantum algorithms that are efficient and robust against noise. Towards this end, we introduce the projected cooling algorithm for quantum computation. The projected cooling…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
Quantum computers have been widely speculated to offer significant advantages in obtaining the ground state of difficult Hamiltonian in chemistry and physics. In this work, we first propose a Lyapunov control-inspired strategy to accelerate…
By allowing measurements of observables other than the state of the qubits in a quantum computer, one can find eigenvectors very quickly. If a unitary operation U is implemented as a time-independent Hamiltonian, for instance, one can…
Many-body entangled quantum states studied in condensed matter physics can be primary resources for quantum information, allowing any quantum computation to be realized using measurements alone, on the state. Such a universal state would be…
In a recent paper we have suggested that a formulation of quantum mechanics should exist, which does not require the concept of time, and that the appropriate mathematical language for such a formulation is noncommutative differential…
We propose a heuristic method to obtain the approximate groundstate for a Hamiltonian in the qubit form, based on the stabilizer formalism. These states may serve as proper initial states for further refined computation. It would be…