Related papers: Kerdock Codes Determine Unitary 2-Designs
Qudits with local dimension $d>2$ can have unique structure and uses that qubits ($d=2$) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group…
Storing quantum information in a quantum error correction code can protect it from errors, but the ability to transform the stored quantum information in a fault tolerant way is equally important. Logical Pauli group operators can be…
The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of…
One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer.…
We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code.…
Divisible codes are defined by the property that codeword weights share a common divisor greater than one. They are used to design signals for communications and sensing, and this paper explores how they can be used to protect quantum…
Quantum error correction is the art of protecting fragile quantum information through suitable encoding and active interventions. After encoding $k$ logical qubits into $n>k$ physical qubits using a stabilizer code, this amounts to…
The Clifford group is the quotient of the normalizer of the Weyl-Heisenberg group in dimension $d$ by its centre. We prove that when $d$ is not prime the Clifford group is not a group unitary $2$-design. Furthermore, we prove that the…
This paper introduces a novel abstraction for programming quantum operations, specifically projective Cliffords, as functions over the qudit Pauli group. Generalizing the idea behind Pauli tableaux, we introduce a type system and lambda…
The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of…
We propose two types, namely Type-I and Type-II, quantum stabilizer codes using quadratic residue sets of prime modulus given by the form $p=4n\pm1$. The proposed Type-I stabilizer codes are of cyclic structure and code length $N=p$. They…
Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be…
We investigate stabilizer codes with carrier qudits of equal dimension $D$, an arbitrary integer greater than 1. We prove that there is a direct relation between the dimension of a qudit stabilizer code and the size of its corresponding…
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named…
In this work we establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. Our bounds depend on the interplay between a pair of graphs: the Tanner graph of the set of measured Pauli…
We provide a streamlined elaboration on existing ideas that link Ising anyon (or equivalently, Majorana) stabilizer codes to certain classes of binary classical codes. The groundwork for such Majorana-based quantum codes can be found in…
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…
We investigate how non-stabilizer resources enable the emergence of quantum state designs within the projected ensemble. Starting from initial states with finite magic and applying resource-free Clifford circuits to scramble them, we…
Sarnak's conjecture in quantum computing concerns when the groups $\operatorname{PU}_2$ and $\operatorname{PSU}_2$ over cyclotomic rings $\mathbb{Z}[\zeta_n, 1/2]$ with $\zeta_n=e^{2\pi i/n}$, $4|n$, are generated by the Clifford-cyclotomic…
We discuss a method to adapt the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. We focus on the corresponding Pauli error models for amplitude damping noise and phase damping noise. In…