Related papers: Universality of single quantum gates
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…
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.…
In a series of recent works, an interesting quantum generative model based on parameterized instantaneous polynomial quantum (IQP) circuits has emerged as they can be trained efficiently classically using any loss function that depends only…
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 demonstrate that complete set of gates can be realized in a DXD superconducting solid state quantum computer (quamputer), thereby proving its universality.
For numerous applications of quantum theory it is desirable to be able to apply arbitrary unitary operations on a given quantum system. However, in particular situations only a subset of unitary operations is easily accessible. This raises…
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…
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding…
We propose a set of universal gate operations for the singlet-triplet qubit realized by two electron spins in a double quantum dot, in the presence of a fixed inhomogeneous magnetic field. All gate operations are achieved by switching the…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit…
What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This paper shows that a very different model…
We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction…
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 consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
We present numerical results which show how two-bit logic gates can be used in the design of a quantum computer. We show that the Toffoli gate, which is a universal gate for all classical reversible computation, can be implemented using a…
We present a new experimental protocol for performing universal gates in a register of superconducting qubits coupled by fixed on-chip linear reactances. The qubits have fixed, detuned Larmor frequencies and can remain, during the entire…
A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…
Suppose we can apply a given 2-qubit Hamiltonian H to any (ordered) pair of qubits. We say H is n-universal if it can be used to approximate any unitary operation on n qubits. While it is well known that almost any 2-qubit Hamiltonian is…