Phantom Codes: Hardness, Rate Optimal qLDPC Constructions, and Distance Limits

• URL: http://arxiv.org/abs/2609.16542v1
• Date: Tue, 15 Sep 2026 02:37:22 GMT
• Title: Phantom Codes: Hardness, Rate Optimal qLDPC Constructions, and Distance Limits
• Abstract summary: An $[[n,k,d]]$ stabilizer code is phantom if every in-block logical CNOT gate can be realized by a permutation of its physical qubits.<n>We show that recognizing phantomness of a given stabilizer code is at least as hard as Graph Isomorphism.<n>We propose the first rate optimal phantom qLDPC families.
• Score: 13.162597529553755
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An $[[n,k,d]]$ stabilizer code is phantom if every in-block logical CNOT gate can be realized by a permutation of its physical qubits. This eliminates the large and complicated physical overhead normally required for logical entangling gates. Yet this symmetry is highly restrictive: phantom codes are rare, the number of logical qubits is limited to $k=O(\log n)$, and no phantom qLDPC family with growing logical dimension was previously known. We make three contributions. 1. We prove that recognizing phantomness of a given stabilizer code is at least as hard as Graph Isomorphism, even for CSS codes encoding only $k=2$ logical qubits. 2. We propose the first rate optimal phantom qLDPC families: for every fixed $D$, our CSS families achieve the maximal logical scaling $k=Θ(\log n)$ and distance $d\geq D$. 3. We prove a distance no-go theorem: every phantom code family with $k=ω(\sqrt{\log n})$ and check weight $w=O(1)$ satisfies $d\leq w$ for sufficiently large $n$. Thus our fixed-distance qLDPC families are distance-scaling optimal at the maximal logical scaling $k=Θ(\log n)$.

Related papers

• Realizing Logical Diagonal Gates via Transversal Physical $Z$-Rotations in CSS Codes [6.416957991576607]
  We show that CSS codes can realize only logical single-qubit $Z$-rotations and multi-qubit controlled-$Z$ rotations via physical $Z$-rotations.<n>We illustrate our methodology by providing explicit constructions of CSS code families that realize addressable logical single-qubit $Z$-rotations.
  arXiv  Detail & Related papers  (2026-08-19T16:44:24Z)
• Faster quantum linear system solver beyond the condition number [50.84794327094274]
  We present two quantum algorithms that produce the normalized solution $|xrangle$ of linear system $Ax=| b rangle$ to accuracy $$ with complexity independent of the condition number $=lVert A-1rVert$.<n>Our filtering-based solver is extremely simple with a favorable runtime prefactor.
  arXiv  Detail & Related papers  (2026-07-08T17:49:40Z)
• Constraints on phantom codes from automorphism group bounds [0.0]
  Executing a logical quantum circuit fault-tolerantly incurs a large spacetime overhead.<n>Recent work has proposed and investigated phantom codes, defined by the property that every in-block logical $mathrmCNOT$ circuit can be implemented with a physical permutation.<n>Here we show that phantomness comes at the cost of low encoding rate.
  arXiv  Detail & Related papers  (2026-04-16T15:04:53Z)
• Optimal Quantum $(r,δ)$-Locally Repairable Codes via Classical Ones [52.3857155901121]
  Local repairable codes (LRCs) play a crucial role in mitigating data loss in large-scale distributed and cloud storage systems.<n>This paper establishes a unified decomposition theorem for general optimal $(r,delta)$-LRCs.<n>We construct three infinite families of optimal quantum $(r,delta)$-LRCs with flexible parameters.
  arXiv  Detail & Related papers  (2025-07-24T08:21:20Z)
• Clifford gates with logical transversality for self-dual CSS codes [0.8009842832476994]
  Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers.<n>Some logical gates of a high-rate code can be fault-tolerantly implemented using physical gates.<n>We show that certain logical Clifford gates have multiple implementations, each by logical gates at a different level of concatenation.
  arXiv  Detail & Related papers  (2025-03-25T15:55:12Z)
• A shortcut to an optimal quantum linear system solver [55.2480439325792]
  We give a conceptually simple quantum linear system solvers (QLSS) that does not use complex or difficult-to-analyze techniques. If the solution norm $lVertboldsymbolxrVert$ is known exactly, our QLSS requires only a single application of kernel. Alternatively, by reintroducing a concept from the adiabatic path-following technique, we show that $O(kappa)$ complexity can be achieved for norm estimation.
  arXiv  Detail & Related papers  (2024-06-17T20:54:11Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning [54.806166861456035]
  We study the episodic reinforcement learning (RL) problem modeled by finite-horizon Markov Decision Processes (MDPs) with constraint on the number of batches. We design a computational efficient algorithm to achieve near-optimal regret of $tildeO(sqrtSAH3Kln (1/delta))$tildeO(cdot) hides logarithmic terms of $(S,A,H,K)$ in $K$ episodes. Our technical contribution are two-fold: 1) a near-optimal design scheme to explore
  arXiv  Detail & Related papers  (2022-10-15T09:22:22Z)
• Climbing the Diagonal Clifford Hierarchy [0.6445605125467572]
  We introduce a method of synthesizing codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy. The method combines three basic operations: concatenation, removal of $Z$-stabilizers, and addition of $X$-stabilizers. For the coherent noise model, we describe how to switch between computation and storage of intermediate results in a decoherence-free subspace.
  arXiv  Detail & Related papers  (2021-10-22T17:08:18Z)
• An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
  We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
  arXiv  Detail & Related papers  (2020-08-24T06:50:57Z)
• Classical Coding Problem from Transversal $T$ Gates [10.478611957969145]
  We show that triorthogonal codes are, essentially, the only family of CSS codes that realize logical $T$ via physical $T$. We also use Ax's theorem to characterize the logical operation realized on a family of quantum Reed-Muller codes.
  arXiv  Detail & Related papers  (2020-01-14T16:45:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.