Related papers: Power of Anisotropic Exchange Interactions: Univer…
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…
In this paper, we show that the ability to switch globally between two 2-local Hamiltonians on n qubits is sufficient for achieving universal unitary dynamics on those n qubits. Of the two Hamiltonians used in the construction, one is…
Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…
The realization of robust universal quantum computation with any platform ultimately requires both the coherent storage of quantum information and (at least) one entangling operation between individual elements. The use of…
Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its…
In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
Several prominent proposals have suggested that spins of localized electrons could serve as quantum computer qubits. The exchange interaction has been invoked as a means of implementing two qubit gates. In this paper, we analyze the…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) exchange interaction with uniform and non-uniform coupling constants. We show that for an odd number of sites a spin…
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…
We propose an effective realization of the universal set of elementary quantum gates in solid state quantum computer based on macroscopic (or mesoscopic) resonance systems - multi-atomic coherent ensembles, squids or quantum dots in quantum…
All-to-all interactions arise naturally in many areas of theoretical physics and across diverse experimental quantum platforms, motivating a systematic study of their information-processing power. Assuming each pair of qubits interacts with…
Quantum dot hybrid qubits formed from three electrons in double quantum dots represent a promising compromise between high speed and simple fabrication for solid state implementations of single qubit and two qubits quantum logic ports. We…
Simple constructions and protocols are demonstrated to allow the implementation of universal quantum computation on an arbitrarily large quantum system by controlling a fixed number of spins, vastly reducing the engineering requirements in…
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
Universal quantum computation requiring only the Heisenberg exchange interaction and suppressing decoherence via an energy gap is presented. The combination of an always-on exchange interaction between the three physical qubits comprising…