Related papers: Quantum computation and real multiplication
A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with…
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse…
This note studies the quantized corner structure of four-dimensional $BF$ theory, classifies the associated free and physical corner algebras and constructs possible representations. In the abelian case, for arbitrary closed oriented…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
The theory of anyon systems, as modular functors topologically and unitary modular tensor categories algebraically, is mature. To go beyond anyons, our first step is the interplay of anyons with conventional group symmetry due to the…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with…
Fibonacci anyons provide the simplest possible model of non-Abelian fusion rules: [1] x [1] = [0] + [1]. We propose a conformal field theory construction of topological quantum registers based on Fibonacci anyons realized as quasiparticle…
The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some…
A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific…
Results obtained by us are overviewed from a general set up. The universal $R$-matrix is exploited to obtain various important relations and structures involved in quantum group algebra, which are used subsequently for generating different…
Non-Abelian topological order (TO) enables topologically protected quantum computation with its anyonic quasiparticles. Recently, TO with $S_3$ gauge symmetry was identified as a sweet spot -- simple enough to emerge from finite-depth…
We suggest to compactify the universal covering of the moduli space of complex structures by non-commutative spaces. The latter are described by certain categories of sheaves with connections which are flat along foliations. In the case of…
An explicit lattice realization of a non-Abelian topological memory is presented. The correspondence between logical and physical states is seen directly by use of the stabilizer formalism. The resilience of the encoded states against…
We study the homogeneous coordinate rings of real multiplication noncommutative tori as defined by A. Polishchuk. Our aim is to understand how these rings give rise to an arithmetic structure on the noncommutative torus. We start by giving…
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…
Complex numbers play a crucial role in quantum mechanics. However, their necessity remains debated: whether they are fundamental or merely convenient. Recently, it was claimed that quantum mechanics based on real numbers can be…
Non-Abelian topological orders offer an intriguing path towards fault-tolerant quantum computation, where information can be encoded and manipulated in a topologically protected manner immune to arbitrary local noises and perturbations.…