Related papers: Universal gates with wires in a row
In this paper we consider circuit synthesis for n-wire linear reversible circuits using the C-NOT gate library. These circuits are an important class of reversible circuits with applications to quantum computation. Previous algorithms,…
We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases.…
It has been widely assumed that one-qubit gates in spin-based quantum computers suffer from severe technical difficulties. We show that one-qubit gates can in fact be generated using only modest and presently feasible technological…
We design composite controlled-phase gates, which compensate errors in the phase of a single gate. The errors can be of various nature, such as relative, absolute or both. We present composite sequences which are robust to relative errors…
A finitely generated shift invariant space $V$ is a closed subspace of $L^2(\R^d)$ that is generated by the integer translates of a finite number of functions. A set of frame generators for $V$ is a set of functions whose integer translates…
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…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
Causal Graph Dynamics extend Cellular Automata to arbitrary, bounded-degree, time-varying graphs. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of physics-like symmetries:…
In literature, NAND and NOR are two logic gates that display functional completeness, hence regarded as Universal gates. So, the present effort is focused on exploring a library of universal gates in binary that are still unexplored in…
We propose a theoretical scheme to realize arbitrary single-qubit gates through two simple device units: one-dimensional semiconductor wires with Dresselhaus spin-orbit coupling (SOC) and Rashba SOC, separately. Qubit information coded by…
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…
In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how…
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…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary $t$-design is designed to tackle this challenge in an efficient way, yet constructions to date rely…
The Fredkin three-bit gate is universal for computational logic, and is reversible. Classically, it is impossible to do universal computation using reversible two-bit gates only. Here we construct the Fredkin gate using a combination of six…
Say a collection of $n$-qu$d$it gates $\Gamma$ is eventually universal if and only if there exists $N_0 \geq n$ such that for all $N \geq N_0$, one can approximate any $N$-qu$d$it unitary to arbitrary precision by a circuit over $\Gamma$.…
The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…