For regular uniform LOSR networks whose incident hyperedges form information sets, local decoders from linear codes convert multipartite source states into GHZ states with fidelity d^{m-M} (optimal at 1/d for complete hypergraphs) without classical communication.
hub
Quantum internet: A vision for the road ahead
19 Pith papers cite this work, alongside 2,372 external citations. Polarity classification is still indexing.
19
Pith papers citing it
2,372
external citations · OpenAlex
hub tools
citation-role summary
background 3
citation-polarity summary
roles
background 3polarities
background 3representative citing papers
Bidirectional quantum frequency conversion distributes atom-photon entanglement over 24 km of deployed fiber at 1.7% transfer efficiency with fidelity drop under 1%.
A single NiV- defect in diamond functions as an all-optically controlled spin qubit with T2 up to 1.27 ms via dynamical decoupling.
Self-assembled telecom color centers in silicon form during ultra-low-temperature MBE growth, with lower chamber pressure suppressing unwanted luminescence background as shown by PL and positron spectroscopy.
BURY heuristic partitions graph states across QPUs by minimizing maximum matching sizes between partitions, requiring fewer Bell pairs than standard k-partition methods and lowering cut-rank.
Double selection distillation statistics alone suffice to estimate Bell-diagonal parameters of undistilled and post-processed states, outperforming prior distillation-based estimators in resource use.
A threshold-pruned distributed inverse QFT reduces per-node entanglement to a constant and global communication from O(P²) to O(P) while claiming to preserve correctness.
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.
QRQT protects quantum teleportation's classical channel with PQC, showing quantum memory coherence as the central bottleneck that caps secure distance at 191-199 km and produces a non-monotonic joint attack probability.
A modified Jaynes-Cummings-Hubbard chain with resonator-TLS sites and TLS-TLS links enables coherent single-excitation transport and type conversion along the lattice.
Spectator qubits with real-time decision making and feedforward mitigate dephasing in an NV-center quantum network node, improving memory fidelity during remote entanglement generation.
The paper introduces a modular, hardware-agnostic architecture using entanglement packets for scheduling network operations in quantum networks to enable end-to-end entanglement generation integrated with local program execution, demonstrated via simulation on a 6-node star topology.
A protocol is presented that grows large entangled multi-qubit states, including generalized GHZ states, from smaller entangled pairs via graph-basis-assisted measurements that truncate Hilbert space and concentrate entanglement.
A quantum-inspired framework using effective Hamiltonians, Metropolis annealing and stochastic tensor-network compression is proposed for adaptive multi-demand routing in large-scale QKD networks.
Polarization-dependent loss maps to a known distribution of singlet-conversion probabilities, so realistic photonic networks can be modeled by random entanglement percolation with PDL-induced edge randomness.
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.
The authors introduce the LHD protocol for entanglement distribution under imperfect conditions and report via simulation that it outperforms some prior protocols against a blind entanglement baseline.
Monte Carlo simulations map fidelity gains up to 0.07 and yield losses up to 0.55 for one round of DEJMPS purification across a grid of amplitude-damping and dephasing noise strengths in entangled photon systems.
citing papers explorer
-
Optimal GHZ-State Distribution in LOSR Quantum Networks via Local Decoding from Information Sets
For regular uniform LOSR networks whose incident hyperedges form information sets, local decoders from linear codes convert multipartite source states into GHZ states with fidelity d^{m-M} (optimal at 1/d for complete hypergraphs) without classical communication.
-
Metropolitan entanglement distribution between an atom and a near-visible photon
Bidirectional quantum frequency conversion distributes atom-photon entanglement over 24 km of deployed fiber at 1.7% transfer efficiency with fidelity drop under 1%.
-
A transition-metal qubit in diamond with all-optical control and millisecond quantum memory
A single NiV- defect in diamond functions as an all-optically controlled spin qubit with T2 up to 1.27 ms via dynamical decoupling.
-
Self-Assembled Telecom Color Centers in Silicon and Their Growth Environment
Self-assembled telecom color centers in silicon form during ultra-low-temperature MBE growth, with lower chamber pressure suppressing unwanted luminescence background as shown by PL and positron spectroscopy.
-
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States
BURY heuristic partitions graph states across QPUs by minimizing maximum matching sizes between partitions, requiring fewer Bell pairs than standard k-partition methods and lowering cut-rank.
-
A double selection entanglement distillation-based state estimator
Double selection distillation statistics alone suffice to estimate Bell-diagonal parameters of undistilled and post-processed states, outperforming prior distillation-based estimators in resource use.
-
Communication-Efficient Distributed Inverse Quantum Fourier Transform
A threshold-pruned distributed inverse QFT reduces per-node entanglement to a constant and global communication from O(P²) to O(P) while claiming to preserve correctness.
-
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.
-
Quantum-Resistant Quantum Teleportation
QRQT protects quantum teleportation's classical channel with PQC, showing quantum memory coherence as the central bottleneck that caps secure distance at 191-199 km and produces a non-monotonic joint attack probability.
-
Single excitation swap in a modified Jaynes-Cummings-Hubbard lattice
A modified Jaynes-Cummings-Hubbard chain with resonator-TLS sites and TLS-TLS links enables coherent single-excitation transport and type conversion along the lattice.
-
Quantum-network nodes with real-time noise mitigation using spectator qubits
Spectator qubits with real-time decision making and feedforward mitigate dephasing in an NV-center quantum network node, improving memory fidelity during remote entanglement generation.
-
A Modular Quantum Network Architecture for Integrating Network Scheduling with Local Program Execution
The paper introduces a modular, hardware-agnostic architecture using entanglement packets for scheduling network operations in quantum networks to enable end-to-end entanglement generation integrated with local program execution, demonstrated via simulation on a 6-node star topology.
-
Scalable and deterministic Greenberger-Horne-Zeilinger state generation via graph states-assisted measurements
A protocol is presented that grows large entangled multi-qubit states, including generalized GHZ states, from smaller entangled pairs via graph-basis-assisted measurements that truncate Hilbert space and concentrate entanglement.
-
Quantum-Inspired Hamiltonian Optimization, Stochastic Tensor Networks and Adaptive Congestion Routing for Large-Scale QKD Networks
A quantum-inspired framework using effective Hamiltonians, Metropolis annealing and stochastic tensor-network compression is proposed for adaptive multi-demand routing in large-scale QKD networks.
-
Random entanglement percolation on realistic quantum networks
Polarization-dependent loss maps to a known distribution of singlet-conversion probabilities, so realistic photonic networks can be modeled by random entanglement percolation with PDL-induced edge randomness.
-
Architecture and protocols for all-photonic quantum repeaters
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.
-
Entanglement distribution protocols under imperfect fidelity and quantum memory conditions
The authors introduce the LHD protocol for entanglement distribution under imperfect conditions and report via simulation that it outperforms some prior protocols against a blind entanglement baseline.
-
Effectiveness of the DEJMPS purification protocol in noisy entangled photon systems, a Monte Carlo simulation
Monte Carlo simulations map fidelity gains up to 0.07 and yield losses up to 0.55 for one round of DEJMPS purification across a grid of amplitude-damping and dephasing noise strengths in entangled photon systems.
- Integrated Dual-Resonator Architecture for Telecom Photon-Memory Entanglement