Search arXiv⌕ Search

arXiv · 2610.00469

Factor Code Networks

Abstract

For a quantum code defined by an isometry $T:H_{\rm code} \to H_{\rm phys}$, an operator map is a *-homomorphism $φ: B(H_{\rm code}) \to B(H_{\rm phys})$ from the space of operators on the logical Hilbert space to the space of operators on the physical Hilbert space satisfying $φ({\cal O}) T = T {\cal O}$ for every operator ${\cal O}$ on $H_{\rm code}$. This can additionally be taken to be unital $φ(I_{code}) = I_{phys}$ if and only if $\dim H_{\rm code}$ divides $\dim H_{\rm phys}$. In this case, $φ(B(H_{\rm code})$ is a von Neumann factor subalgebra of $B(H_{\rm phys})$ and we call the pair $(T,φ)$ a {\it factor code}. A code network is a family of Hilbert spaces $\{{\cal H}_i\}$ indexed by a partially ordered set with isometries $T_{ji}:{\cal H}_i \to {\cal H}_j$ for $i < j$ satisfying $T_{kj} T_{ji} = T_{ki}$ for $i < j < k$. In this paper, we ask when this can be promoted to a {\it factor code network} by defining unital operator maps $φ_{ji}$ so that $(T_{ji}, φ_{ji})$ is a factor code and $φ_{kj} φ_{ji} = φ_{ki}$. We show that the divisibility conditions on Hilbert space dimensions are sufficient for any code network with a tree structure but not in general. For a diamond-shaped network, we show that promotion is possible if and only if the principle angles between $T_{42} H_2$ and $T_{43} H_3$ all have multiplicity divisible by $H_1$. For incomparable $i_1,i_2 < j$, we characterize when $φ_{j i_1} (B(H_{i_1}))$ and $φ_{j i_2} (B(H_{i_2}))$ commute, when they generate all of $B(H_j)$, and when they intersect only on multiples of the identity. For $i < j_1,j_2 < k$, we characterize when $φ_{k j_1} (B(H_{j_1})) \cap φ_{k j_2} (B(H_{j_2})) = φ_{k i} (B(H_{i}))$ and when these algebras together with $B(H_k)$ form a nondegenerate commuting square.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abhisek Sahu, Jeremy van der Heijden, Mark Van Raamsdonk, Rana Zibakhsh. 2026-09-30. Factor Code Networks. https://arxiv.org/abs/2610.00469

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Phase-space representation of classical simulability for arbitrary bosonic encodings

Phase-space representations can be used to reveal resources for quantum computational advantage. In odd-dimensional qudit systems, states and operations admitting non-negative quasi-probability representations are efficiently classically simulable, and analogous conclusions hold for bosonic systems, usually represented in quadrature phase space. However, when quantum information is encoded in bosonic systems, the link between physical phase-space representations and computational resources becomes nontrivial: large negativities may arise in the physical space even when the encoded model remains efficiently simulable. We establish a general framework connecting physical phase spaces of bosonic systems to the effective computational phase spaces associated with arbitrary encodings. We show that bosonic Hilbert spaces with finitely many modes can always be exactly encoded on a quantum computer, without truncation or approximations, and that for any encoding there exists an adapted physical phase-space representation in which all provably classically simulable states and protocols are non-negative. Conversely, negativity can always persist in physical representations for arbitrary encodings. Our results formalize the operational meaning of phase-space negativity in bosonic quantum information and its relation with computational resources.

quant-ph↗

Helical Dirac Current with Local Coupling to a Chiral Potential

We show that a propagating electron wave in the lowest cylindrical channel carries a spin-resolved helical conserved current, and connect this current texture to its local chiral coupling. In a weakly relativistic positive-energy Dirac projection, the two sectors have the same azimuthally symmetric charge density and opposite circulation superposed on longitudinal flow, even though their nonrelativistic orbital harmonic is $l=0$. The current is radially distributed and extends into the evanescent tail. A scalar screw potential couples these modes through a derived vertex expressed by the \emph{chiral current overlap}, $\mathcal J_χ$. Both spatial textures determine the coupling: the environmental radial profile weights the electronic circulation, while the screw harmonic selects correlated changes of spin sector and longitudinal momentum. For a uniform static harmonic, elastic energy conservation makes the first-order spin-flip amplitude vanish within the same transverse mode. Environmental energy exchange is therefore required to activate these selected channels. The same current overlap supplies the spatial kernel for heliciton-assisted inelastic scattering in a companion study and for a subsequent transport treatment of chirality-induced spin selectivity (CISS).

quant-ph↗

Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward

Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of magic gate teleportation (MGT), a form of quantum gate teleportation that uses non-stabilizer resource states to implement non-Clifford unitary gates on arbitrary input states without revealing information about those states. This setting is motivated by the canonical approach to implementing logical non-Clifford gates in fault-tolerant quantum computation. We uncover a hidden structure within MGT---after backpropagating the Pauli measurements, MGT protocols can be viewed as encoding the input state into a stabilizer code heralded by the measurement outcomes, followed by a logical non-Clifford gate. Using this structure, we construct MGT protocols for any resource state obtained by applying commuting Pauli rotations to a stabilizer state, and provide an efficient algorithm for synthesizing their circuit implementations. Conversely, we prove that directly useful single-qubit resource states are necessarily Clifford-equivalent to diagonal states, and establish the same constraint for multi-qubit resource states used in a broad class of MGT protocols. In particular, the output state distilled from the $[\![5, 1, 3]\!]$ protocol is not directly useful for any MGT protocols, though it can be probabilistically converted into directly useful states. Finally, we identify conditions under which the feedforward operators can be implemented by Pauli operators, shedding light on the paradigm of algorithmic fault tolerance and simplifying the feedforward operations needed for quantum computing.

quant-ph↗