Related papers: Quantum computing, Seifert surfaces and singular f…
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…
In a recent paper the quantum 2-sphere $S^2_q$ was described as a quantum complex manifold. Here we consider several copies of $S^2_q$ and derive their braiding commutation relations. The braiding is extended to the differential and to the…
The coefficients of twisted Alexander polynomials of a knot induce regular functions of the $SL_2(\mathbb{C})$-character variety. We prove that the function of the highest degree has a finite value at an ideal point which gives a minimal…
One approach to quantum information processing is to use photons as quantum bits and rely on linear optical elements for most operations. However, some optical nonlinearity is necessary to enable universal quantum computing. Here, we…
We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the…
Rickard complexes in the context of categorified quantum groups can be used to construct braid group actions. We define and study certain natural deformations of these complexes which we call curved Rickard complexes. One application is to…
Majorana fermions and their generalizations to $\mathbb{Z}_n$ parafermions are considered promising building blocks of fault-tolerant quantum computers for their ability to encode quantum information nonlocally. In such topological quantum…
An electron inside liquid helium forms a bubble of 17 \AA in radius. In an external magnetic field, the two-level system of a spin 1/2 electron is ideal for the implementation of a qubit for quantum computing. The electron spin is well…
We provide a systematic treatment of boundaries based on subgroups $K\subseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk. The boundary sites are representations of a $*$-subalgebra $\Xi\subseteq D(G)$ and we explicate its…
Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: There is a basic conflict between nanometre separation desired for qubit-qubit interactions, and…
Motivated by the recently demonstrated ability to attach quantum dots to polymers at well defined locations, we propose a condensed phase analog of the ion trap quantum computer: a scheme for quantum computation using chemically assembled…
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…
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…
Conformal field theories have been extremely useful in our quest to understand physical phenomena in many different branches of physics, starting from condensed matter all the way up to high energy. Here we discuss applications of…
The past few years have seen a revived interest in quantum geometrical characterizations of band structures due to the rapid development of topological insulators and semi-metals. Although the metric tensor has been connected to many…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
Quantum algorithms operate on quantum states through unitary transformations in high dimensional complex Hilbert space. In this work, we propose a machine learning approach to create the quantum circuit using a single-layer complex-valued…
We build representations of the elliptic braid group from the data of a quantum D-module M over a ribbon Hopf algebra U. The construction is modelled on, and generalizes, similar constructions by Lyubashenko and Majid, and also certain…
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
We introduce a recoupling theory for virtual braided trees. This recoupling theory can be utilized to incorporate swap gates into anyonic models of quantum computation.