Related papers: Group Representations, Error Bases and Quantum Cod…
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…
The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in…
Quantum-mechanical concepts can be formulated in constructive finite terms without loss of their empirical content if we replace a general unitary group by a unitary representation of a finite group. Any linear representation of a finite…
A quantum error correcting code is a subspace $\mathcal{C}$ such that allowed errors acting on any state in $\mathcal{C}$ can be corrected. A quantum code for which state recovery is only required up to a logical rotation within…
Quantum error correction allows for faulty quantum systems to behave in an effectively error free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to…
We use the theory of the quantum group $U_q(gl(2,\RR))$ in order to develop a quantum theory of invariants and show a decomposition of invariants into a Gordan-Capelli series. Higher binary forms are introduced on the basis of braided…
In this paper we provide a basic introduction of the core ideas and theories surrounding fault-tolerant quantum computation. These concepts underly the theoretical framework of large-scale quantum computation and communications and are the…
This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard quantum groups in GCT4 and GCT7, and canonical bases of the…
In Part I of this series we presented the general ideas of applying group-algebraic methods for describing quantum systems. The treatment was there very "ascetic" in that only the structure of a locally compact topological group was used.…
These notes introduce quantum computation and quantum error correction, emphasising the importance of stabilisers and the mathematical foundations in basic Lie theory. We begin by using the double cover map $\mathrm{SU}_2 \rightarrow…
The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most…
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search…
The particle algebras generated by the creation/annihilation operators for bosons and for fermions are shown to possess quantum invariance groups. These structures and their sub(quantum)groups are investigated.
Certain quantum topological invariants of three manifolds can be written in the form of the Gaussian sum. It is shown that such topological invariants can be approximated efficiently by a quantum computer. The invariants discussed here are…
We present a new model of quantum computation rooted in the representation theory of the mass less sector of unitary irreducible representations of the extended Poincare group developed in [1].
We show that a subset of the basis for the irreducible representations of a tensor-product SU(2) rotation forms a covariant approximate quantum error-correcting code with transversal U(1) logical gates. Generalizing previous work on…
A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that…
We construct a general family of quantum codes that protect against all emission, absorption, dephasing, and raising/lowering errors up to an arbitrary fixed order. Such codes are known in the literature as absorption-emission (AE) codes.…
We define and investigate a notion of entropy for quantum error correcting codes. The entropy of a code for a given quantum channel has a number of equivalent realisations, such as through the coefficients associated with the Knill-Laflamme…
This is the fourth in a series of papers on developing a formulation of quantum mechanics in non-inertial reference frames. This formulation is grounded in a class of unitary cocycle representations of what we have called the Galilean line…