Related papers: From reversible computation to quantum computation…
A fully optical method to perform any quantum computation with optical waveguide modes is proposed by supplying the prescriptions for a universal set of quantum gates. The proposal for quantum computation is based on implementing a quantum…
Conformal group of transformations in the momentum space, consisting of translations $p'_{\mu}=p_{\mu}+h_{\mu}$, rotations $p'_{\mu}=\Lambda^{\nu}_{\mu}p_{\nu}$, dilatation $p'_{\mu}=\lambda p_{\mu}$ and inversion $p'_{\mu}=…
The differential and variational calculus on the $SL_{q}(2,R)$ group is constructed. The spontaneous breaking symmetry in the WZNW model with $SL_{q}(2,R)$ quantum group symmetry and in the $\sigma$-models with ${SL_{q}(2,R)/U_{h}(1)}$…
Graphical calculi for representing interacting quantum systems serve a number of purposes: compositionally, intuitive graphical reasoning, and a logical underpinning for automation. The power of these calculi stems from the fact that they…
A quantum computer is a multi-particle interferometer that comprises beam splitters at both ends and arms, where the n two-level particles undergo the interactions among them. The arms are designed so that relevant functions required to…
We present an algebraic study of a kind of quantum systems belonging to a family of superintegrable Hamiltonian systems in terms of shape-invariant intertwinig operators, that span pairs of Lie algebras like $(su(n),so(2n))$ or…
We construct a 2-parameter family of unitarily equivalent irreducible representations of the triply extended group $\g$ of translations of $\mathbb{R}^{4}$ associated with a family of its 4-dimensional coadjoint orbits and show how a…
The dimensionful nature of the coupling in the Einstein-Hilbert action in four dimensions implies that the theory is non-renormalizable; explicit calculation shows that beginning at two loop order, divergences arise that cannot be removed…
We provide a new algorithm that translates a unitary matrix into a quantum circuit according to the G=KAK theorem in Lie group theory. With our algorithm, any matrix decomposition corresponding to type-AIII KAK decompositions can be derived…
In quantum circuits, qubits and the quantum gates acting on them have traditionally been analysed using matrix algebra and Dirac notation. While powerful, these can be unintuitive for conceptual understanding and rapid problem solving. In…
We describe the implications of permutation symmetry for the state space and dynamics of quantum mechanical systems of matrices of general size $N$. We solve the general 11- parameter permutation invariant quantum matrix harmonic oscillator…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
Classical random walks and Markov processes are easily described by Hopf algebras. It is also known that groups and Hopf algebras (quantum groups) lead to classical and quantum diffusions. We study here the more primitive notion of a…
This series of papers is a contribution to the program of classifying $p$-blocks of finite groups up to source algebra equivalence, starting with the case of cyclic blocks. To any $p$-block $\mathbf{B}$ of a finite group with cyclic defect…
Collective operations on a network of spatially-separated quantum systems can be carried out using local quantum (LQ) operations, classical communication (CC) and shared entanglement (SE). Such operations can also be used to communicate…
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition,…
In 2005 J.L. Waldspurger proved the following theorem: given a finite real reflection group $W$, the closed positive root cone is tiled by the images of the open weight cone under the action of the linear transformations $id-w$. Shortly…
Blind Quantum Computation lets a limited-capability client delegate its complex computation to a remote server without revealing its data or computation. Several such protocols have been proposed under varied quantum computing models.…
We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical…
We consider classical and quantum mechanics related to an additional noncommutativity, symmetric in position and momentum coordinates. We show that such mechanical system can be transformed to the corresponding one which allows employment…