Related papers: Quantum computation with Turaev-Viro codes
In this work, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, building off the algebraic framework developed in our prior work. We build our graphical calculus out of a fixed set of graphical…
The recent article [arXiv:2307.12552] gave local topological order (LTO) axioms for a quantum spin system, showed they held in Kitaev's Toric Code and in Levin-Wen string net models, and gave a bulk boundary correspondence to describe bulk…
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…
In this paper we construct a topological model for the Witten-Reshetikhin-Turaev invariants for $3$-manifolds coming from the quantum group $U_q(sl(2))$, as graded intersection pairings of homology classes in configuration spaces. More…
We construct a universal Vassiliev invariant for braid groups of the sphere and the mapping class groups of the sphere with $n$ punctures. The case of a sphere is different from the classical braid groups or braids of oriented surfaces of…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
A Group category is a spherical category whose simple objects are invertible. The invariant of Turaev-Viro with this particular category is in fact the invariant of Dijkgraaf-Witten whose the group and the 3-cocycle is given by the simple…
A modular tensor category $\mathcal{C}$ gives rise to a Reshetikhin-Turaev type topological quantum field theory which is defined on 3-dimensional bordisms with embedded $\mathcal{C}$-coloured ribbon graphs. We extend this construction to…
The ability to efficiently simulate random quantum circuits using a classical computer is increasingly important for developing Noisy Intermediate-Scale Quantum devices. Here we present a tensor network states based algorithm specifically…
For every stabiliser $N$-qudit absolutely maximally entangled state, we present a method for determining the stabiliser generators and logical operators of a corresponding quantum error correction code. These codes encode $k$ qudits into…
Typical stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system. By incorporating a broader representation-theoretic perspective, we provide a generalized framework that…
3D Loop Quantum Gravity with a vanishing cosmological constant can be related to the quantization of the $\textrm{SU}(2)$ BF theory discretized on a lattice. At the classical level, this discrete model characterizes discrete flat geometries…
Variational Quantum algorithms, especially Quantum Approximate Optimization and Variational Quantum Eigensolver (VQE) have established their potential to provide computational advantage in the realm of combinatorial optimization. However,…
In this paper, we study 2-representations of 2-quantum groups (in the sense of Rouquier and Khovanov-Lauda) categorifying tensor products of irreducible representations. Our aim is to construct knot homologies categorifying…
The Hamiltonian model of quantum error correction code in the literature is often constructed with the help of its stabilizer formalism. But there have been many known examples of nonadditive codes which are beyond the standard quantum…
Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid…
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…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
Motivated by suggestions of Paolo Cotta-Ramusino's work at the physical level of rigor relating BF theory to the Donaldson polynomials, we provide a construction applicable to the Turaev/Viro and Crane/Yetter invariants of *a priori* finer…
This paper presents a way to estimate the Heegaard genus of a $3$-manifold using the Turaev-Viro state sum TQFT. The Turaev-Viro state sum TQFT is derived from the modular category associated to the quantum group $U_q(\mathfrak{sl}_2)$,…