Related papers: An explicit family of unitaries with exponentially…
Classical methods of differential geometry are used to construct equations of motion for particles in quantum, electrodynamic and gravitational fields. For a five dimensional geometrical system, the equivalence principle can be extended.…
We introduce a family of exactly-solvable two-dimensional Hamiltonians whose wave functions are given in terms of Laguerre and exceptional Jacobi polynomials. The Hamiltonians contain purely quantum terms which vanish in the classical limit…
Valiant's famous VP vs. VNP conjecture states that the symbolic permanent polynomial does not have polynomial-size algebraic circuits. However, the best upper bound on the size of the circuits computing the permanent is exponential.…
We introduce grading on certain finite dimensional simple Lie superalgebras of type $P(t)$ by elementary abelian 2-group. This grading gives rise to Pauli matrices and is a far generalization of $(\mathbb Z_2\times \mathbb Z_2)$-grading on…
The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary $t$-design is designed to tackle this challenge in an efficient way, yet constructions to date rely…
The family of quaternionic quasi-unitary (or quaternionic unitary Cayley--Klein algebras) is described in a unified setting. This family includes the simple algebras sp(N+1) and sp(p,q) in the Cartan series C_{N+1}, as well as many…
The commutation relations between the generalized Pauli operators of N-qudits (i. e., N p-level quantum systems), and the structure of their maximal sets of commuting bases, follow a nice graph theoretical/geometrical pattern. One may…
We give bounds on geodesic distances on the Stiefel manifold, derived from new geometric insights. The considered geodesic distances are induced by the one-parameter family of Riemannian metrics introduced by H\"uper et al. (2021), which…
The parentage between Weyl pairs, generalized Pauli group and unitary group is investigated in detail. We start from an abstract definition of the Heisenberg-Weyl group on the field R and then switch to the discrete Heisenberg-Weyl group or…
We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regardless of the characteristic. This extends a recent result of…
In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…
We construct two new families of basis for finite field extensions. Basis in the first family, the so-called elliptic basis, are not quite normal basis, but they allow very fast Frobenius exponentiation while preserving sparse…
Yao (1993) proved that quantum Turing machines and uniformly generated quantum circuits are polynomially equivalent computational models: $t \geq n$ steps of a quantum Turing machine running on an input of length $n$ can be simulated by a…
In a recent article, the coordinate ring of the nodal cubic was given the structure of a quantum homogeneous space. Here the corresponding coalgebra Galois extension is expressed in terms of quantum groups at roots of unity, and is shown to…
We show that any quantum circuit of treewidth $t$, built from $r$-qubit gates, requires at least $\Omega(\frac{n^{2}}{2^{O(r\cdot t)}\cdot \log^4 n})$ gates to compute the element distinctness function. Our result generalizes a…
We prove a family of 3-term relations in the Grothendieck ring of the category of finite-dimensional modules over the affine quantum algebra of type $G_2$ extending the celebrated $T$-system relations of type $G_2$. We show that these…
Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…
We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central classes of quantum circuits and can be used to capture the computational…
Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…
To each of the symmetry groups of the Platonic solids we adjoin a carefully designed involution yielding topological generators of PU(2) which have optimal covering properties as well as efficient navigation. These are a consequence of…