Related papers: Generators and Relations for Un(Z[1/2,i])
The paper discusses the gate complexity of reversible circuits with the small number of additional inputs consisting of NOT, CNOT and 2-CNOT gates. We study Shannon's gate complexity function $L(n, q)$ for a reversible circuit implementing…
The controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a…
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…
The positive part $U^+_q$ of $U_q({\widehat{\mathfrak{sl}}}_2)$ has a presentation by two generators $X,Y$ that satisfy the $q$-Serre relations. The $q$-Onsager algebra $\mathcal O_q$ has a presentation by two generators $A,B$ that satisfy…
We introduce fusion algebras with not necessarily positive structure constants and without identity element. We prove that they are semisimple when tensored with $\mathbb{C}$ and that their characters satisfy orthogonality relations. Then…
In this paper, we introduce the notion of a normal form of one qubit quantum circuits over the basis $\{H, P, T\}$, where $H$, $P$ and $T$ denote the Hadamard, Phase and $\pi/8$ gates, respectively. This basis is known as the {\it standard…
The Clifford group is the set of gates generated by the CZ gate, and the two local gates: the Hadamard and the Pi/2 phase shift gate. It is known that, for a two qubit system, the Clifford group C2 is a subgroup of order 92160 of the group…
A quantum unitary gate is realized in this paper by perturbing a free charged particle in a one-dimensional box with a time- and position-varying electric field. The perturbed Hamiltonian is composed of a free particle Hamiltonian plus a…
We show that the quantum algebra $U_q(sl_2)$ has a presentation with generators $x,x^{-1},y,z$ and relations $x x^{-1}=1$, $x^{-1} x=1$, $\frac{qxy-q^{-1}yx}{q-q^{-1}}=1$, $\frac{qyz-q^{-1}zy}{q-q^{-1}}=1$,…
In this work, we develop a novel mathematical framework for universal digital quantum computation using algebraic probability theory. We rigorously define quantum circuits as finite sequences of elementary quantum gates and establish their…
Some two qubit interactions are singly sufficient for universal quantum computation but not without the use of an ancilla. Recent schemes for universal quantum computation have focused on hybrid physical systems using ancillae. In them, the…
For the standard Drinfeld-Jimbo quantum group ${\rm U}_q(\mathfrak{g})$ associated with a simple Lie algebra $\mathfrak{g}$, we construct explicit generators of the centre $Z({\rm U}_q(\mathfrak{g}))$, and determine the relations satisfied…
We present quantum circuits with a brick wall structure using the optimal number of parameters and two-qubit gates to parametrize $SU(2^n)$, and provide evidence that these circuits are universal for $n\leq 5$. For this, we successfully…
Matrix generators for the general and special linear groups, the symplectic groups and the general and special unitary groups over finite fields. For the most part the generators have been obtained by translating Steinberg's generators for…
The paper consists of two parts. The first part introduces the representation ring for the family of compact unitary groups U(1), U(2),.... This novel object is a commutative graded algebra R with infinite-dimensional homogeneous…
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
Quantum gates, that play a fundamental role in quantum computation and other quantum information processes, are unitary evolution operators $\hat U$ that act on a composite system changing its entanglement. In the present contribution we…
Existing quantum compilers optimize quantum circuits by applying circuit transformations designed by experts. This approach requires significant manual effort to design and implement circuit transformations for different quantum devices,…
Near-term applications of quantum information processors will rely on optimized circuit implementations to minimize gate depth and therefore mitigate the impact of gate errors in noisy intermediate-scale quantum (NISQ) computers. More…
Fernando Galve \emph{et al.} $[Phys. Rev. Lett. \textbf{110}, 010501 (2013)]$ introduced discording power for a two-qubit unitary gate to evaluate its capability to produce quantum discord, and found that a $\pi/8$ gate has maximal…