Compare Papers

Paper 1

Quantum Universality in Composite Systems: A Trichotomy of Clifford Resources

Alejandro Borda, Julian Rincon, César Galindo

Year

2025

Journal

arXiv preprint

DOI

arXiv:2512.20787

arXiv

2512.20787

The Clifford group is efficiently classically simulable, and universality is obtained by supplementing it with non-Clifford resources. We determine which single-qudit gates suffice to achieve universality. We show that the structure of such resources is governed by the prime factorization of the qudit dimension $d$. Using the adjoint action on the space of complex trace-zero matrices, we relate density to irreducibility together with an infiniteness criterion, yielding a trichotomy based on the factorization of $d$. When $d$ is prime, any non-Clifford gate generates a dense subgroup of the determinant-one unitaries. If $d$ is a prime power, the adjoint action is reducible, and universality requires gates that couple the resulting invariant subspaces. For composite $d$ with pairwise coprime factors, generalized intra-qudit controlled-NOT gates connecting the factors already suffice. These findings suggest that ``composite architectures'' -- hybrid registers combining incommensurate dimensions -- offer a route to bypass the standard overhead associated with magic-state injection.

Open paper

Paper 2

Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning

Anthony Gatti, Anoosha Fayyaz, Prashant Krishnamurthy, Kaushik P. Seshadreesan, Amy Babay

Year

2026

Journal

arXiv preprint

DOI

arXiv:2605.00246

arXiv

2605.00246

Many quantum-network applications require end-to-end Bell pairs whose fidelity exceeds a request-specific threshold, but existing entanglement routing algorithms either optimize only throughput without regard for fidelity or enforce fidelity guarantees using centralized controllers with global link-state knowledge. We present Q-GUARD, an online entanglement routing algorithm that enforces per-request fidelity thresholds within a distributed protocol model in which nodes exchange link-state information only with their $k$-hop neighbors. After link outcomes are realized in each slot, Q-GUARD builds per-link purification cost tables from realized Bell pairs, allocates per-hop fidelity targets using a Werner-state equal-split rule, and selects between candidate path segments using a segment-local expected-goodput (EXG) metric that jointly accounts for swap success, purification overhead, and resource availability. We also introduce Q-GUARD-WS, an extension that exploits per-link hardware quality estimates to allocate purification effort non-uniformly across hops. On synthetic 100-node topologies with heterogeneous link fidelity and stochastic BBPSSW purification, Q-GUARD raises the qualified success rate from under 20\% to over 85\% on 4-hop paths and nearly doubles the qualified service radius in Euclidean distance relative to throughput-only and naive-purification baselines, while Q-GUARD-WS provides additional throughput gains under high hardware heterogeneity.

Open paper