Related papers: Generators and Relations for Un(Z[1/2,i])
In the standard circuit model, elementary gates are defined relative to a chosen tensor factorization and are therefore extrinsic to the ambient group $U(2^n)$. Writing $N=2^n$, we introduce an \emph{intrinsic descriptor layer} in $U(N)$ by…
Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary…
We propose the generalized controlled X (GCX) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and…
The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
Our work addresses the problem of generating maximally entangled two spin-1/2 (qubit) symmetric states using NMR, NQR, Lipkin-Meshkov-Glick Hamiltonians. Time evolution of such Hamiltonians provides various logic gates which can be used for…
Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only…
Two different algorithms are presented for generating a quantum circuit realization of a matrix representing a permutation on $2^n$ letters. All circuits involve $n$ qubits and only use multi--controlled Toffoli gates. The first algorithm…
Universal gate sets for quantum computing have been known for decades, yet no universal gate set has been proposed for particle-conserving unitaries, which are the operations of interest in quantum chemistry. In this work, we show that…
Associated to any closed subgroup $G\subset U_N^+$ is a family of toral subgroups $T_Q\subset G$, indexed by the unitary matrices $Q\in U_N$. The family $\{T_Q|Q\in U_N\}$ is expected to encode the main properties of $G$, and there are…
To approximate arbitrary unitary transformations on one or more qubits, one must perform transformations which are outside of the Clifford group. The gate most commonly considered for this purpose is the T = diag(1, exp(i \pi/4)) gate. As T…
Among the many proposals for the realization of a quantum computer, holonomic quantum computation (HQC) is distinguished from the rest in that it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose…
In recent papers of the author, a method was developed for constructing quasitriangular Hopf algebras (quantum groups) of the quantum-double type. As a by-product, a novel non-standard example of the quantum double has been found. In the…
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly…
We obtain a presentation of Schur algebras (and q-Schur algebras) by generators and relations which is compatible with the usual presentation of the enveloping algebra (quantized enveloping algebra) corresponding to the Lie algebra gl(n) of…
For a positive integer $N$ divisible by $4,5,6,7$ or $9$, let $\mathcal{O}_{1,N}(\mathbb{Q})$ be the ring of weakly holomorphic modular functions for the congruence subgroup $\Gamma_1(N)$ with rational Fourier coefficients. We present…
Errors in quantum logic gates are usually modeled by quantum process matrices (CPTP maps). But process matrices can be opaque, and unwieldy. We show how to transform a gate's process matrix into an error generator that represents the same…
We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in…