Related papers: Polyadic braid operators and higher braiding gates
We present a survey of recent results, scattered in a series of papers that appeared during past five years, whose common denominator is the use of cubic relations in various algebraic structures. Cubic (or ternary) relations can represent…
Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on $SO(3)_2 $ theory we obtain a total of 6 anyon models utilizing…
We describe several methods of constructing R-matrices that are dependent upon many parameters, for example unitary R-matrices and R-matrices whose entries are functions. As an application, we construct examples of R-matrices with…
Quantum nonlinear operations for harmonic oscillator systems play a key role in the development of analog quantum simulators and computers. Since a variety of strong highly nonlinear operations are unavailable in the existing physical…
Certain families of quantum mechanical models can be described and solved efficiently on a classical computer, including qubit or qudit Clifford circuits and stabilizer codes, free-boson or free-fermion models, and certain rotor and GKP…
We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit…
A six-qubit quantum network consisting of conditional unitary gates is presented which is capable of implementing a large class of covariant two-qubit quantum operations. Optimal covariant NOT operations for one and two-qubit systems are…
In this article we review the basic concepts regarding quantum integrability. Special emphasis is given on the algebraic content of integrable models. The associated algebras are essentially described by the Yang-Baxter and boundary…
We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give…
Mathematically, ternary coding is more efficient than binary coding. It is little used in computation because technology for binary processing is already established and the implementation of ternary coding is more complicated, but remains…
We explore the utilization of higher-order discretization techniques in optimizing the gate count needed for quantum computer based solutions of partial differential equations. To accomplish this, we present an efficient approach for…
We study non-local two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that the geometric structure of non-local gates is a 3-Torus. We derive the invariants for local transformations, and…
We study quantum entanglements induced on product states by the action of 8-vertex braid matrices, rendered unitary with purely imaginary spectral parameters (rapidity). The unitarity is displayed via the "canonical factorization" of the…
We find new solutions to the Yang--Baxter equation in terms of the intertwiner matrix for semi-cyclic representations of the quantum group $U_q(s\ell(2))$ with $q= e^{2\pi i/N}$. These intertwiners serve to define the Boltzmann weights of a…
Fast entangling gate operations are a fundamental prerequisite for quantum simulation and computation. We propose an entangling scheme for arbitrary pairs of ions in a linear crystal, harnessing the high electric polarizability of highly…
Computing polynomial form of the colored HOMFLY-PT for non-arborescent knots obtained from three or more strand braids is still an open problem. One of the efficient methods suggested for the three-strand braids relies on the eigenvalue…
Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons and…
The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…
We propose and analyze a physical system capable of performing topological quantum computation with Majorana zero modes (MZM) in a one-dimensional topological superconductor (1DTS). One of the leading methods to realize quantum gates in…
In an unpublished preprint \cite{batanin}, Batanin conjectures that it is possible to take `slices' of a globular operad, thereby isolating the algebraic structure in each dimension. It was further hypothesised that the slices of a globular…