Related papers: An Introduction to Cartan's KAK Decomposition for …
A model of 3-dimensional topological quantum field theory is rigorously constructed. The results are applied to an explicit formula for deformation quantization of any finite-dimensional Lie bialgebra over the field of complex numbers. This…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
This paper considers the use of Robust PCA in a CUR decomposition framework and applications thereof. Our main algorithms produce a robust version of column-row factorizations of matrices $\mathbf{D}=\mathbf{L}+\mathbf{S}$ where…
We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations admitting exact decompositions and describe a process for…
Fault-tolerant quantum computing requires classical hardware to perform the decoding necessary for error correction. The Union-Find decoder is one of the best candidates for this. It has remarkably organic characteristics, involving the…
Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many…
The process of complexification is used to classify a Lie algebra and identify its Cartan subalgebra. However, this method does not distinguish between real forms of a complex Lie algebra, which can differ in signature. In this paper, we…
An approach to study a generalization of the classical-quantum transition for general systems is proposed. In order to develop the idea, a deformation of the ladder operators algebra is proposed that contains a realization of the quantum…
Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…
The decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science, quantum control, and linear optics. We establish a 1D Quantum Field…
We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…
The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…
Quantum error correction (QEC) is believed to be essential for the realization of large-scale quantum computers. However, due to the complexity of operating on the encoded `logical' qubits, understanding the physical principles for building…
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential…
A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from \fun\ to \uqg\ , given by elements of the pure braid group. These operators --- the `reflection matrix' $Y \equiv…
This is an outline of Erlangen Program at Large. Study of objects and properties, which are invariant under a group action, is very fruitful far beyond the traditional geometry. In this paper we demonstrate this on the example of the group…
We present an algorithm which computes a cylindrical algebraic decomposition of a semialgebraic set using projection sets computed for each cell separately. Such local projection sets can be significantly smaller than the global projection…
This is the lecture 4 of a mini-course of 4 lectures. Our purpose of this mini-curse is to explain some ideas of E. Cartan and S. Lie when we study differential geometry, particularly we will to explain the Cartan reduction method. The…
This is the lecture 2 of a mini-course of 4 lectures. Our purpose of this mini-curse is to explain some ideas of E. Cartan and S. Lie when we study differential geometry, particularly we will to explain the Cartan reduction method. The…
We propose a type-theoretic framework for describing and proving properties of quantum computations, in particular those presented as quantum circuits. Our proposal is based on an observation that, in the polymorphic type system of Coq,…