Compare Papers
Paper 1
From Quantum Codes to Gravity: A Journey of Gravitizing Quantum Mechanics
ChunJun Cao
- Year
- 2021
- Journal
- arXiv preprint
- DOI
- arXiv:2112.00199
- arXiv
- 2112.00199
In this note, I review a recent approach to quantum gravity that "gravitizes" quantum mechanics by emerging geometry and gravity from complex quantum states. Drawing further insights from tensor network toy models in AdS/CFT, I propose that approximate quantum error correction codes, when re-adapted into the aforementioned framework, also has promise in emerging gravity in near-flat geometries.
Open paperPaper 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