Related papers: Primitive Quantum Gates for an $SU(2)$ Discrete Su…
We connect explicitly the classical $O(2)$ model in 1+1 dimensions, a model sharing important features with $U(1)$ lattice gauge theory, to physical models potentially implementable on optical lattices and evolving at physical time. Using…
A new link between tetrahedra and the group SU(2) is pointed out: by associating to each face of a tetrahedron an irreducible unitary SU(2) representation and by imposing that the faces close, the concept of quantum tetrahedron is seen 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…
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design.…
Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We…
All quantum gates with one and two qubits may be described by elements of $Spin$ groups due to isomorphisms $Spin(3) \simeq SU(2)$ and $Spin(6) \simeq SU(4)$. However, the group of $n$-qubit gates $SU(2^n)$ for $n > 2$ has bigger dimension…
In the near-future noisy intermediate-scale quantum (NISQ) era of quantum computing technology, applications of quantum computing will be limited to calculations of very modest scales in terms of the number of qubits used. The need to…
We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…
We study lattice gauge theory with discrete, non-Abelian gauge groups. We extend the formalism of previous studies on D-Wave's quantum annealer as a computing platform to finite, simply reducible gauge groups. As an example, we use the…
Transversal gates play a crucial role in suppressing error propagation in fault-tolerant quantum computation, yet they are intrinsically constrained: any nontrivial code encoding a single logical qubit admits only a finite subgroup of…
High-precision, robust quantum gates are essential components in quantum computation and information processing. In this study, we present an alternative perspective, exploring the potential applicability of quantum gates that exhibit…
Quantum simulations of lattice gauge theories for the foreseeable future will be hampered by limited resources. The historical success of improved lattice actions in classical simulations strongly suggests that Hamiltonians with improved…
Using ultracold alkaline-earth atoms in optical lattices, we construct a quantum simulator for U(N) and SU(N) lattice gauge theories with fermionic matter based on quantum link models. These systems share qualitative features with QCD,…
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and discrete log as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete…
Absract It is proposed that there exist, within a new $SU(2)^{'}$, a gauged discrete group $Q_6$ (the order 12 double dihedral group) acting as a family symmetry. This nonabelian finite group can explain hierarchical features of families,…
We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are…
In this article, we review some of the recent developments towards the future goal of quantum computing or quantum simulating lattice QCD. This includes a novel theoretical framework developed for non-Abelian gauge theories that is the…
Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden…