pith. sign in

An implementation and analysis of a practical quantum link architecture utilizing entangled photon sources

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

citation-role summary

background 2

citation-polarity summary

fields

quant-ph 3

years

2026 3

verdicts

UNVERDICTED 3

roles

background 2

polarities

background 2

clear filters

representative citing papers

Resource Management in Heterogeneous Quantum Repeater Networks

quant-ph · 2026-05-24 · unverdicted · novelty 5.0 · 2 refs

Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.

A Distributed Switching Protocol for Quantum Networks

quant-ph · 2026-05-08 · unverdicted · novelty 4.0

A distributed switching protocol for unbuffered quantum networks uses cooperative BSA selection and bi-path reservations to achieve high link success rates under load in simulations.

citing papers explorer

Showing 3 of 3 citing papers after filters.

  • Resource Management in Heterogeneous Quantum Repeater Networks quant-ph · 2026-05-24 · unverdicted · none · ref 145 · 2 links

    Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.

  • A Distributed Switching Protocol for Quantum Networks quant-ph · 2026-05-08 · unverdicted · none · ref 11

    A distributed switching protocol for unbuffered quantum networks uses cooperative BSA selection and bi-path reservations to achieve high link success rates under load in simulations.

  • Accelerating Quantum State Encoding with SIMD: Design, Implementation, and Benchmarking quant-ph · 2026-04-07 · unverdicted · none · ref 4

    Hybriqu Encoder delivers 5.4% faster pure angle encoding at 64 qubits on Apple Silicon by using AVX SIMD and cache-friendly precalculations, with gains increasing beyond L1 cache size while full-state updates remain memory-bound.