Related papers: A Theory for Valiant's Matchcircuits (Extended Abs…

The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…

Basic matrices are defined which provide unique building blocks for the class of normal matrices which include the classes of unitary and Hermitian matrices. Unique builders for quantum logic gates are hence derived since a quantum logic…

In this work, we study the properties of a pentadiagonal symmetric matrix with perturbed corners. More specifically, we present explicit expressions for characterizing when this matrix is non-negative and positive definite in two special…

Mutually unbiased bases that can be cyclically generated by a single unitary operator are of special interest, since they can be readily implemented in practice. We show that, for a system of qubits, finding such a generator can be cast as…

A universal entangler is quantum gate able to transform any disentangled state in an entangled state. Although universal entanglers are abundant in arbitrary high dimensional spaces, to verify if a quantum gate is a universal entangler is a…

In a previous study, the first author defines an inverse ambiguous function on a group $G$ to be a bijective function $f : G \to G$ satisfying the functional equation $f^{-1}(x) = f(x^{-1})$ for all $x \in G$. In this paper, we investigate…

We obtain two related characterizations of discrete quantum groups and discrete quantum groups of Kac type as allegorical group objects in the symmetric monoidal dagger category of quantum sets and relations, of interest to quantum…

It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…

Boolean matching is an important problem in logic synthesis and verification. Despite being well-studied for conventional Boolean circuits, its treatment for reversible logic circuits remains largely, if not completely, missing. This work…

We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425},…

We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we…

I calculate characters of certain representations of loop groups based on non simply connected Lie groups. This gives a generalization of the Kac-Weyl character formula.

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 extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…

We construct rational all-pass matrix functions with real-valued coefficients for mirroring pairs of complex-conjugated determinantal roots of a rational matrix. This problem appears, for example, when proving the spectral factorization…

Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…

We consider two group actions on $m$-tuples of $n \times n$ matrices. The first is simultaneous conjugation by $\operatorname{GL}_n$ and the second is the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$. We give…

In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…