Related papers: Universal Quantum Computation with Metaplectic Any…
The Measurement Based Quantum Computation (MBQC) model achieves universal quantum computation by employing projective single qubit measurements with classical feedforward on a highly entangled multipartite cluster state. Rapid advances in…
We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…
We consider the problem of building an arbitrary $N\times N$ real orthogonal operator using a finite set, $S$, of elementary quantum optics gates operating on $m\leq N$ modes - the problem of universality of $S$ on $N$ modes. In particular,…
We propose a set of techniques that enable universal quantum computing to be carried out using dressed states. This applies in particular to the effort of realising quantum computation in trapped ions using long-wavelength radiation, where…
We show a method for implementing universal quantum computing using of a singlet and triplets of nanowire double quantum dots coupled to a one-dimensional transmission line resonator. This method is attractive for both quantum computing and…
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…
In seminal work (arxiv:quant-ph/9707021) Alexei Kitaev proposed topological quantum computing (arXiv:cond-mat/0010440, arxiv:quant-ph/9707021, arXiv:quant-ph/0001108, arXiv:0707.1889), whereby logic gates of a quantum computer are conducted…
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…
We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…
As information carriers for fault-tolerant quantum computing, systems composed of anyons exhibit non-tensor product state spaces due to their distinctive fusion rules, leading to fundamentally different entanglement properties from…
We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of Nielsen [quant-ph/0108020], who proposed a scheme in…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
This Letter discusses topological quantum computation with gapped boundaries of two-dimensional topological phases. Systematic methods are presented to encode quantum information topologically using gapped boundaries, and to perform…
Topological quantum computation employs two-dimensional quasiparticles called anyons. The generally accepted mathematical basis for the theory of anyons is the framework of modular tensor categories. That framework involves a substantial…
Acyclic anyon models are non-abelian anyon models for which thermal anyon errors can be corrected. In this note, we characterize acyclic anyon models and raise the question if the restriction to acyclic anyon models is a deficiency of the…
Indistinguishability of particles is a fundamental principle of quantum mechanics. For all elementary and quasiparticles observed to date - including fermions, bosons, and Abelian anyons - this principle guarantees that the braiding of…
Digital-analog quantum computing with two-level systems is a computational paradigm that combines an analog Hamiltonian with single-qubit gates to achieve universality. We extend this framework to $d$-level systems by conjugating an analog…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…