Related papers: Quantum computation and real multiplication
Ordinary and gl(n,R) generalized Toda systems as well as a related hierarchy are probed with respect to certain quantization characteristics. "Quantum" canonical and Poisson transformations are used to study quantizations of transformed…
We show that braidings of the metaplectic anyons $X_\epsilon$ in $SO(3)_2=SU(2)_4$ with their total charge equal to the metaplectic mode $Y$ supplemented with measurements of the total charge of two metaplectic anyons are universal for…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
It has been recently pointed out by Caves, Fuchs, and Rungta that real quantum mechanics (that is, quantum mechanics defined over real vector spaces provides an interesting foil theory whose study may shed some light on just which…
In this note, we discuss several aspects of the functoriality of universal abelian factorizations associated to representations of quivers into abelian categories. After recalling the general construction of universal abelian…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
These lecture notes offer a pedagogical yet concise introduction to topological quantum computing. The material focuses on topological superconductors and Majorana qubits. It concludes with a discussion of more general braiding phenomena.…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
Anyons are particles obeying statistics of neither bosons nor fermions. Non-Abelian anyons, whose exchanges are described by a non-Abelian group acting on a set of wave functions, are attracting a great attention because of possible…
This paper is a review of the theory of abelian anyons in planar systems at an introductory level and with focus on the formalism of quantum field theory, but with the aim of clarify the connections between the mathematical structure and…
Schemes for topological quantum computation are usually based on the assumption that the system is initially prepared in a specific state. In practice, this state preparation is expected to be challenging as it involves non-topological…
We give a new quantum circuit approximation of quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary…
The author introduces the notion of a quantum form of an algebraic torus. In the case of diagonal algebraic torus we get the algebra of Laurent twisted polynomials. Quantum algebraic torus can be characterized in terms of exact sequences.…
Strongly correlated fractional quantum Hall liquids support fractional excitations, which can be understood in terms of adiabatic flux insertion arguments. A second route to fractionalization is through the coupling of weakly interacting…
In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors…
The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other…
We study tori attached to the fundamental groups of plane curves with arbitrary singularities. These tori provide complete information about homology of finite abelian covers of the plane branched along the curve. We calculate these tori in…
Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…
An algebraic system is introduced, which is very useful for doing scattering calculations in quantum field theory. It is the set of all real numbers greater than or equal to -m^2 with parity designation and a special rule for addition and…
We construct the Fock space representations for the quantum affine algebra of type $C_2^{(1)}$ in terms of Young walls. Using this construction, we give a generalized Lascoux-Leclerc-Thibon algorithm for computing the global bases of the…