Counting stabiliser codes for arbitrary dimension

Abstract

In this work, we compute the number of $[[n,k]{]}_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross (Ref. [23]) the number of $[[n,k]{]}_d$ stabilizer codes was computed for the case when $d$ is a prime (or the power of a prime, i.e., $d=p^m$, but when the qudits are Galois-qudits). The proof in Ref. Ref. [23] is inapplicable to the non-prime case. For our proof, we introduce a group structure to $[[n,k]{]}_d$ codes, and use this in conjunction with the Chinese remainder theorem to count the number of $[[n,k]{]}_d$ codes. Our work overlaps with Ref. Ref. [23] when $d$ is a prime and in this case our results match exactly, but the results differ for the more generic case. Despite that, the overall order of magnitude of the number of stabilizer codes scales agnostic of whether the dimension is prime or non-prime. This is surprising since the method employed to count the number of stabilizer states (or more generally stabilizer codes) depends on whether $d$ is prime or not. The cardinality of stabilizer states, which was so far known only for the prime-dimensional case (and the Galois qudit prime-power dimensional case) plays an important role as a quantifier in many topics in quantum computing. Salient among these are the resource theory of magic, design theory, de Finetti theorem for stabilizer states, the study and optimisation of the classical simulability of Clifford circuits, the study of quantum contextuality of small-dimensional systems and the study of Wigner-functions. Our work makes available this quantifier for the generic case, and thus is an important step needed to place results for quantum computing with non-prime dimensional quantum systems on the same pedestal as prime-dimensional systems.

arXiv comment14 pages + 10 pages of appendices, v2: additional comments on related work added, appendix F derives Eq.(57) from CRT

References in corpus (38)

• Mixed State Entanglement and Quantum Error Correction
• Improved Simulation of Stabilizer Circuits
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• The Resource Theory of Stabilizer Computation
• Instantaneous non-local computation of low T-depth quantum circuits
• The Heisenberg Representation of Quantum Computers
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Stim: a fast stabilizer circuit simulator
• Negative Quasi-Probability as a Resource for Quantum Computation
• Quantum Data Hiding
• Hudson's Theorem for finite-dimensional quantum systems
• SIC-POVMs and the Extended Clifford Group
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• One-and-a-half quantum de Finetti theorems
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Quantum computation with realistic magic state factories
• Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Homological Error Correction: Classical and Quantum Codes
• Efficient Decoders for Qudit Topological Codes
• Qudit surface codes and gauge theory with finite cyclic groups
• Standard Form of Qudit Stabilizer Groups
• Towards low overhead magic state distillation
• Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
• Kitaev's Z_d-Codes Threshold Estimates
• Optimal verification of stabilizer states
• Enumerating all bilocal Clifford distillation protocols through symmetry reduction
• Quantum Contextuality with Stabilizer States
• The monomial representations of the Clifford group
• Wigner distributions for finite state systems without redundant phase point operators
• A quantum compiler for qudits of prime dimension greater than 3
• New techniques for bounding stabilizer rank
• Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits
• Classical codes in quantum state space

Cited by in corpus (4)

• Near-term $n$ to $k$ distillation protocols using graph codes
• Long-range nonstabilizerness and phases of matter
• Simulating quantum computation: how many "bits" for "it"?
• Enhancing Quantum Key Distribution with Entanglement Distillation and Classical Advantage Distillation