Related papers: A Lecture on Quantum Logic Gates
Recently, remote-controlled quantum information processing has been proposed for its applications in secure quantum processing protocols and distributed quantum networks. For remote-controlled quantum gates, the experimental realization of…
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array…
An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…
We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first…
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as…
In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
Logical gates studied in quantum computation suggest a natural logical abstraction that gives rise to a new form of unsharp quantum logic. We study the logical connectives corresponding to the following gates: the Toffoli gate, the NOT and…
The complexity of a quantum gate, defined as the minimal number of elementary gates to build it, is an important concept in quantum information and computation. It is shown recently that the complexity of quantum gates built from random…
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,…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the…
With the onset of gated quantum machine learning, the architecture for such a system is an open question. Many architectures are created either ad hoc or are directly analogous from known classical architectures. Presented here is a novel…
Controlled operations allow for the entanglement of quantum registers. In particular, a controlled-$U$ gate allows an operation, $U$, to be applied to the target register and entangle the results to certain values in the control register.…
We study quantum information processing using superpositions of Fock states in superconducting resonators, as quantum $d$-level systems (qudits). A universal set of single and coupled logic gates is theoretically proposed for resonators…
In this tutorial, we introduce basic conceptual elements to understand and build a gate-based superconducting quantum computing system.
We discuss techniques for producing, manipulating and measureing qubits encoded optically as vacuum and single photon states. We show that a universal set of non-deterministic gates can be constructed using linear optics and photon…
We propose a new system for implementing quantum logic gates: neutral atoms trapped in a very far-off-resonance optical lattice. Pairs of atoms are made to occupy the same well by varying the polarization of the trapping lasers, and then a…
We study two-level q-deformed angular momentum states and us- ing q-deformed harmonic oscillators, we provide a framework for con- structing qubits and quantum gates. We also present the construction of some basic quantum gates including…
We introduce a novel scheme of quantum recursive programming, in which large unitary transformations, i.e. quantum gates, can be recursively defined using quantum case statements, which are quantum counterparts of conditionals and case…
We describe the construction of a conditional quantum control-not (CNOT) gate from linear optical elements following the program of Knill, Laflamme and Milburn [Nature {\bf 409}, 46 (2001)]. We show that the basic operation of this gate can…