Related papers: Abelian logic gates
Abelian complexity of a word $\mathbf{u}$ is a function that counts the number of pairwise non-abelian-equivalent factors of $\mathbf{u}$ of length $n$. We prove that for any $c$-balanced Parry word $\mathbf{u}$, the values of the abelian…
We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the…
We design logic circuits based on the notion of zero forcing on graphs; each gate of the circuits is a gadget in which zero forcing is performed. We show that such circuits can evaluate every monotone Boolean function. By using two vertices…
Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing…
We demonstrate parallel composite quantum logic gates with phases implemented locally through nanoscale movement of ions within a global laser beam of fixed pulse duration. We show that a simple four-pulse sequence suffices for constructing…
We have been striving to exceed computational complexity, and in the process, we have come to realize the dilemma of classical computing, and in turn we realize that superpositioner may be a way to solve. A superpositioner is a model formed…
We describe an architecture based on a processing 'core' where multiple qubits interact perpetually, and a separate 'store' where qubits exist in isolation. Computation consists of single qubit operations, swaps between the store and the…
A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a…
Quantum bits based on individual trapped atomic ions constitute a promising technology for building a quantum computer, with all the elementary operations having been achieved with the necessary precision for some error-correction schemes.…
Errors in quantum logic gates are usually modeled by quantum process matrices (CPTP maps). But process matrices can be opaque, and unwieldy. We show how to transform a gate's process matrix into an error generator that represents the same…
This paper describes a system, called PLP, for compiling ordered logic programs into standard logic programs under the answer set semantics. In an ordered logic program, rules are named by unique terms, and preferences among rules are given…
Reversible computation is gaining increasing relevance in the context of several post-CMOS technologies, the most prominent of those being Quantum computing. One of the key theoretical problem pertaining to reversible logic synthesis is the…
Memristors have been suggested as a novel route to neuromorphic computing based on the similarity between them and neurons (specifically synapses and ion pumps). The d.c. action of the memristor is a current spike which imparts a short-term…
We demonstrate single-qubit operations by transporting a beryllium ion with a controlled velocity through a stationary laser beam. We use these to perform coherent sequences of quantum operations, and to perform parallel quantum logic gates…
The Abelian sandpile model is the simplest analytically tractable model of self-organized criticality. This paper presents a brief review of known results about the model. The abelian group structure allows an exact calculation of many of…
We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete…
In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it…
We propose the use of a trapped electron to implement quantum logic operations. The fundamental controlled-NOT gate is shown to be feasible. The two quantum bits are stored in the internal and external (motional) degrees of freedom.
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…