Related papers: A Theory for Valiant's Matchcircuits (Extended Abs…
A mock Seifert matrix is an integral square matrix representing the Gordon-Litherland form of a pair $(K,F)$, where $K$ is a knot in a thickened surface and $F$ is an unoriented spanning surface for $K$. Using these matrices, we introduce a…
Consider the special linear group of degree $2$ over an arbitrary finite field, acting on the full space of $2 \times 2$-matrices by transpose. We explicitly construct a generating set for the corresponding modular matrix invariant ring,…
We show that every linear algebraic group over an algebraically closed field of characteristic zero is the differential Galois group of a regular singular linear differential equation with rational function coefficients.
We consider a model of quantum computation using qubits where it is possible to measure whether a given pair are in a singlet (total spin $0$) or triplet (total spin $1$) state. The physical motivation is that we can do these measurements…
We investigate the relationship between mapping cones and matrix ordered *-vector spaces (i.e., abstract operator systems). We show that to every mapping cone there is an associated operator system on the space of n-by-n complex matrices,…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
Consider an integer associated with every subset of the set of columns of an $n\times k$ matrix. The collection of those matrices for which the rank of a union of columns is the predescribed integer for every subset, will be denoted by…
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…
The Hodge series of a finite matrix group is the generating function for invariant exterior forms of specified order and degree. Lauret, Miatello, and Rossetti gave examples of pairs of non-conjugate cyclic groups having the same Hodge…
The integral formulae pertaining to the unitary group $\mathsf{U}(d)$ have been comprehensively reviewed, yielding fresh results and innovative proofs. Central to the derivation of these formulae lies the employment of Schur-Weyl duality, a…
The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose…
We prove the existence of common hypercyclic entire functions for uncountable families of translation type operators. Contrary to our previous work [34], here the parameter which reflects the uncountable family lies on the unit circle. On…
In this paper a storage method and a context-aware circuit simulation idea are presented for the sum of block diagonal matrices. Using the design technique for a generalized circuit for the Hamiltonian dynamics through the truncated series,…
We determine invariants like the Smith normal form and the determinant for certain integral matrices which arise from the character tables of the symmetric groups S_n and their double covers. In particular, we give a simple computation,…
Quantum circuit complexity-a measure of the minimum number of gates needed to implement a given unitary transformation-is a fundamental concept in quantum computation, with widespread applications ranging from determining the running time…
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…
A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it…
We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{g_1,\ldots,g_n\}\subset G$ is universal, i.e if the closure $\overline{<\mathcal{S}>}$ is equal to $G$, where $G$ is either the special unitary or the…
The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two…
Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…