Related papers: Qudit-Basis Universal Quantum Computation using $\…
We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second one requires only 2-local qubit-qutrit projectors. We build…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…
Recent developments in qudit-based quantum computing, in particular with trapped ions, open interesting possibilities for scaling quantum processors without increasing the number of physical information carriers. In this work, we propose a…
Knill, Laflamme, and Milburn (KLM) proved that it is possible to build a scalable universal quantum computer using only linear-optics elements and conditional dynamics [Nature (London) {\bf 409}, 46 (2001)\cite{Knill}]. However, the…
We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…
Whilst holding great promise for low noise, ease of operation and networking, useful photonic quantum computing has been precluded by the need for beyond-state-of-the-art components, manufactured by the millions. Here we introduce a…
The Hubbard model may be the simplest model of particles interacting on a lattice, but simulation of its dynamics remains beyond the reach of current numerical methods. In this article, we show that general quantum computations can be…
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis.…
We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
Quantum computers require technologies that offer both sufficient control over coherent quantum phenomena and minimal spurious interactions with the environment. We show, that photons confined to photonic crystals, and in particular to…
We provide a scheme for quantum computation in lattice systems via global but periodic manipulation, in which only effective periodic magnetic fields and global nearest neighbor interaction are required. All operations in our scheme are…
We show that coupling ultracold atoms in optical lattices to quantized modes of an optical cavity leads to quantum phases of matter, which at the same time posses properties of systems with both short- and long-range interactions. This…
We propose a physical system consisting of two optical cavities and a two-level system (TLS), which can be viewed as a double single-sided cavity system. The two cavities are crossed each other in a mutually perpendicular way and are both…
Qudit-based quantum gates offer several advantages over qubit-based counterparts, such as higher information density, the ability to address more complex problems, and richer quantum operations. In this paper, we present three realistic…
The surface code is currently the primary proposed method for performing quantum error correction. However, despite its many advantages, it has no native method to fault-tolerantly apply non-Clifford gates. Additional techniques are…
We report the first experimental demonstration of a quantum controlled-NOT gate for different photons, which is classically feed-forwardable. In the experiment, we achieved this goal with the use only of linear optics, an entangled…
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…
We prove that the theorems of TDDFT can be applied to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used…
We show that quantum computation circuits with coherent states as the logical qubits can be constructed using very simple linear networks, conditional measurements and coherent superposition resource states.