Related papers: Quantum double aspects of surface code models
I give analytical estimates and numerical simulation results for the performance of Kitaev's 2d topological error-correcting codes. By providing methods for the execution of an encoded three-qubit Toffoli gate, I complete a universal gate…
In this paper we suggest that in the framework of the Category Theory it is possible to demonstrate the mathematical and logical \textit{dual equivalence} between the category of the $q$-deformed Hopf Coalgebras and the category of the…
Let $D(H)$ be the quantum double associated to a finite dimensional quasi-Hopf algebra $H$. In this note, we first generalize a result of Majid, stating that a finite dimensional Hopf algebra $H$ is quasitriangular if and only if there is a…
We identify the quantum isometry groups of spectral triples built on the symmetric groups with length functions arising from the nearest-neighbor transpositions as generators. It turns out that they are isomorphic to certain "doubling" of…
The surface code is a powerful quantum error correcting code that can be defined on a 2-D square lattice of qubits with only nearest neighbor interactions. Syndrome and data qubits form a checkerboard pattern. Information about errors is…
Given a finite dimensional C^*-Hopf algebra H and its dual H^ we construct the infinite crossed product A=... x H x H^ x H ... and study its superselection sectors in the framework of algebraic quantum field theory. A is the observable…
Quantum computing platforms are evolving to a point where placing high numbers of qubits into a single core comes with certain difficulties such as fidelity, crosstalk, and high power consumption of dense classical electronics. Utilizing…
We discuss the construction of finite noncommutative geometries on Hopf algebras and finite groups in the `quantum groups approach'. We apply the author's previous classification theorem, implying that calculi in the factorisable case…
We give a new factorisable ribbon quasi-Hopf algebra U, whose underlying algebra is that of the restricted quantum group for sl(2) at a 2p'th root of unity. The representation category of U is conjecturally ribbon-equivalent to that of the…
We propose a scheme for scalable and universal quantum computation using diatomic bits with conditional dipole-dipole interaction, trapped within an optical lattice. The qubit states are encoded by the scattering state and the bound…
We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both…
We investigate feasible holography with the Kitaev model using dilatonic gravity in AdS$_2$. We propose a generic dual theory of gravity in the AdS$_2$ and suggest that this bulk action is a suitable toy model in studying quantum mechanics…
We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes, and topological color codes for error correction. Color codes have a set of transversal…
We present a blueprint for building a fault-tolerant universal quantum computer with Rydberg atoms. Our scheme, which is based on the surface code, uses individually-addressable optically-trapped atoms as qubits and exploits…
We study the algebra of invariant representative functions over the N-fold Cartesian product of copies of a compact Lie group G modulo the action of conjugation by the diagonal subgroup. We construct a basis of invariant representative…
We investigate how quantum coherence scales and is redistributed in quantum communication protocols, using superdense coding and quantum teleportation as paradigmatic case studies. Employing the relative entropy of coherence as a…
Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum…
Mitigating errors in computing and communication systems has seen a great deal of research since the beginning of the widespread use of these technologies. However, as we develop new methods to do computation or communication, we also need…
This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer, using two qubits, and extend this concept to…
Duality quantum computing (DQC) offers the use of linear combination of unitaries (LCU), or generalized quantum gates, in designing quantum algorithms. DQC contains wave divider and wave combiner operations. The wave function of a quantum…