Proposes all-photonic quantum repeaters with 9 km spacing via GKP-Steane code concatenation, new Bell-pair heuristics, and mirror-cavity memory, achieving 1000 km links with few thousand GKP qubits per station under modeled imperfections.
Minimising the number of edges in LC-equivalent graph states
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
citing papers explorer
-
High-Rate and Resource-Efficient All-Photonic Quantum Repeater Architectures with 9 km Repeater Spacing
Proposes all-photonic quantum repeaters with 9 km spacing via GKP-Steane code concatenation, new Bell-pair heuristics, and mirror-cavity memory, achieving 1000 km links with few thousand GKP qubits per station under modeled imperfections.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.