Related papers: An Introduction to Cartan's KAK Decomposition for …
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
Else from the quotient algebra partition considered in the preceding episodes, two kinds of partitions on unitary Lie algebras are created by nonabelian bi-subalgebras. It is of interest that there exists a partition duality between the two…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…
Averaging physical quantities over Lie groups appears in many contexts across the rapidly developing branches of physics like quantum information science or quantum optics. Such an averaging process can be always represented as averaging…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
Quantum computers can efficiently solve problems which are widely believed to lie beyond the reach of classical computers. In the near-term, hybrid quantum-classical algorithms, which efficiently embed quantum hardware in classical…
Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take…
In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…
We provide a method for compiling approximate multi-controlled single qubit gates into quantum circuits without ancilla qubits. The total number of elementary gates to decompose an n-qubit multi-controlled gate is proportional to 32n, and…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
We define Cartan subgroups in connected locally compact groups, which extends the classical notion of Cartan subgroups in Lie groups. We prove their existence and justify our choice of the definition which differs from the one given by…
Recently it has been shown that time-optimal quantum computation is attained by using the Cartan decomposition of a unitary matrix. We extend this approach by noting that the unitary group is compact. This allows us to reduce the execution…
Using methods coming from non-formal equivariant quantization, we construct in this short note a unitary dual 2-cocycle on a discrete family of quotient groups of subgroups of the affine group of a local field (which is not of…
We introduce the flag decomposition as a central tool for unitary synthesis. It lets us carve out a diagonal unitary with $2^n$ degrees of freedom in such a way that the remaining flag circuit is parametrized by the optimal number of…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
Using the natural irreducible 8-dimensional representation and the two spin representations of the quantum group $U_q$(D$_4$) of D$_4$, we construct a quantum analogue of the split octonions and study its properties. We prove that the…
A generalization of the differential geometry of forms and vector fields to the case of quantum Lie algebras is given. In an abstract formulation that incorporates many existing examples of differential geometry on quantum spaces we combine…
We present a simple and fast numerical procedure to search for good quantum codes for storing logical qubits in the presence of independent per-qubit noise. In a key departure from past work, we use the worst-case fidelity as the figure of…
We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…
Decoupling theorems have proven useful in various applications in the area of quantum information theory. This thesis builds upon preceding work by Fr\'{e}d\'{e}ric Dupuis [arXiv:1012.6044v1], where a general decoupling theorem is obtained…