Related papers: Elementary gates for quantum computation

It is well-known that the Toffoli gate and the negation gate together yield a universal gate set, in the sense that every permutation of $\{0,1\}^n$ can be implemented as a composition of these gates. Since every bit operation that does not…

We supply a rigorous proof that an open dense set of all possible 2-qubit gates G has the property that if the quantum circuit model is restricted to only permit swap of qubits lines and the application of G to pairs of lines, then the…

We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are…

There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus,…

We investigate the minimal resources that are required in the local implementation of non-local quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We…

It is not a problem to complement a classical bit, i.e. to change the value of a bit, a 0 to a 1 and vice versa. This is accomplished by a NOT gate. Complementing a qubit in an unknown state, however, is another matter. We show that this…

In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by…

We present a universal set of quantum gate operations based on exchange-only spin qubits in a double quantum dot, where each qubit is obtained by three electrons in the (2,1) filling. Gate operations are addressed by modulating…

A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons…

We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…

Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…

Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…

We determine the minimal number of qubits that it is necessary to have access to in order to transform Dicke states into other Dicke states. In general, the number of qubits in Dicke states cannot be increased via transformation gates by…

Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code,…

Quantum circuit model is the most popular paradigm for implementing complex quantum computation. Based on Cartan decomposition, we show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and…

We examine a class of operations for topological quantum computation based on fusing and measuring topological charges for systems with SU$(2)_4$ or $k=4$ Jones-Kauffman anyons. We show that such operations augment the braiding operations,…

Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…

Most of the work on implementing arithmetic on a quantum computer has borrowed from results in classical reversible computing (e.g. [VBE95], [BBF02], [DKR04]). These quantum networks are inherently classical, as they can be implemented with…

We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{g_1,\ldots,g_n\}\subset G$ is universal, i.e if the closure $\overline{<\mathcal{S}>}$ is equal to $G$, where $G$ is either the special unitary or the…

We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of…