This research has been carried out in collaboration with D.Melnikov, A.Mironov, A.Morozov and An.Morozov. We study the relation between quantum programming and knot theory. The general idea is that knot theory provides a special basis for unitary matrices. We suggest to use R-matrices of knot theory as universal gates in quantum code. We also examine basic operations in reversible programming.
This research has been carried out in collaboration with D.Melnikov, A.Mironov, A.Morozov and An.Morozov. We study the relation between quantum programming and knot theory. The general idea is that knot theory provides a special basis for unitary matrices. We suggest to use R-matrices of knot theory as universal gates in quantum code. We also examine basic operations in reversible programming.
Quantum R-matrices, the entangling deformations of non-entangling (classical) permutations, provide a distinguished basis in the space of unitary evolutions and, consequently, a natural choice for a minimal set of basic operations (universal gates) for quantum computation. Yet they play a special role in group theory, integrable systems and modern theory of non-perturbative calculations in quantum field and string theory. Despite recent developments in those fields the idea of topological quantum computing and use of R-matrices, in particular, practically reduce to reinterpretation of standard sets of quantum gates, and subsequently algorithms, in terms of available topological ones. In this paper we summarize a modern view on quantum R-matrix calculus and propose to look at the R-matrices acting in the space of irreducible representations, which are unitary for the real-valued couplings in Chern–Simons theory, as the fundamental set of universal gates for topological quantum computer. Such an approach calls for a more thorough investigation of the relation between topological invariants of knots and quantum algorithms.
. This paper is an introduction to relationships between quantum topology and quantum computing. We show how knots are related not just to braiding and quantum operators, but to quantum set theoretical foundations, algebras of fermions, and we show how the operation of negation in logic, seen as both a value and an operator, can generate the fusion algebra for a Majorana fermion. We call negation in this mode the mark, as it operates on itself to change from marked to unmarked states. The mark viewed recursively as a simplest discrete dynamical system naturally generates the fermion algebra, the quaternions and the braid group representations related to Majorana fermions. The paper begins with these fundamentals. It then discusses unitary solutions to the Yang-Baxter equation that are universal quantum gates, quantum entanglement and topological entanglement, and gives an exposition of knot-theoretic recoupling theory, its relationship with topological quantum field theory and applies these methods to produce unitary representations of the braid groups that are dense in the unitary groups. These methods are rooted in the bracket state sum model for the Jones polynomial. A self-contained study of the quantum universal Fibonacci model is given. Results are applied to give quantum algorithms for the computation of the colored Jones polynomials for knots and links, and theWitten-Reshetikhin-Turaev invariant of three manifolds. Two constructions are given for the Fibonacci model, one based in Temperley-Lieb recoupling theory, the other quite elementary and also based on the Temperley-Lieb algebra. This paper begins an exploration of quantum epistemology in relation to the structure of discrimination as the underpinning of basic logic, perception and measurement. Introduction. This paper is an introduction to relationships between quantum topology and quantum computing. We take a foundational approach, showing how knots are related not just to braiding and quantum operators, but to quantum set theoretical foundations and algebras of fermions. We show how the operation of negation in logic, seen as both a value and an operator, can generate the fusion algebra for a Majorana fermion, a particle that is its own anti-particle and interacts with itself either to annihilate itself or to produce itself. We call negation in this mode the mark , as it operates on itself to change from marked to unmarked states.
It has been conjectured that quantum entanglement operators can be lifted to braiding operators by the way of the topological quantum field theory axioms set forth by Witten and Atiyah. Moreover, it can be readily shown that quantum link invariants need entanglement to construct topological invariants. Given these results and the already dense mathematical framework underlying topology and quantum field theory, we propose that, through the usage of quantum algebra and bracket models, we can identify a significant area of overlap where entangling R-matrix solutions to the Yang-Baxter equation can be used to construct invariants of knots and links. Such a connection illuminates the relationship between quantum and topological entanglement, and allows us to draw novel insights about properties of entangling gates, for example the question of what it is that allows some entangling R-matrices to generate topological invariants when others do not. In conclusion, by studying the boundary between topological and quantum entanglement we construct novel topological invariants that can have significant impact on the study of quantum computing and can help make progress towards the problem of representing the Artin braid group as unitary matrices.
Arising from a special session held at the 2010 North American Annual Meeting of the Association for Symbolic Logic, this volume is an international cross-disciplinary collaboration with contributions from leading experts exploring connections across their respective fields. Themes range from philosophical examination of the foundations of physics and quantum logic, to exploitations of the methods and structures of operator theory, category theory, and knot theory in an effort to gain insight into the fundamental questions in quantum theory and logic. The book will appeal to researchers and students working in related fields, including logicians, mathematicians, computer scientists, and physicists. A brief introduction provides essential background on quantum mechanics and category theory, which, together with a thematic selection of articles, may also serve as the basic material for a graduate course or seminar.
The field of quantum computing is growing rapidly and there is a surprisingly large literature.Research in this area includes the design of quantum reversible circuits and developing quantum algorithms for the models of quantum computing.This paper is focused on representing quantum reversible gates in matrix form.In turn these matrices can be used to develop quantum circuits with help of K-Map.Also this paper gives the historical development of quantum algorithms and basics concepts in quantum compuation.
In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50