Abstract
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.
Highlights
The definition of a quantum algorithm [1,2,3] is the following: quantum algorithm is a unitary matrix.This definition usually puzzles at first
We got accustomed to a classical coding, where algorithm is a sequence of operations, or a block diagram
The main reason is that quantum code is reversible, it’s natural to formulate it in a matrix form
Summary
The definition of a quantum algorithm [1,2,3] is the following: quantum algorithm is a unitary matrix.This definition usually puzzles at first. These are matrices of operators that act on a set of 0 and 1. The main reason is that quantum code is reversible, it’s natural to formulate it in a matrix form. We add several additional bits to distinguish the same results of computation to make the code reversible.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
