The CHSH rigidity theorem is machine-checked in Lean 4, confirming near-optimal strategies are locally isometric to the qubit strategy while exposing a gap in prior reasoning.
hub
Quantum cryptography based on Bell’s theorem
16 Pith papers cite this work. Polarity classification is still indexing.
16
Pith papers citing it
hub tools
citation-role summary
background 4
citation-polarity summary
roles
background 4polarities
background 4representative citing papers
A hybrid GHZ-BSM routing strategy outperforms pure BSM routing in square grid quantum networks but requires global-information adaptations to beat BSM in complex topologies such as Waxman, scale-free, and SURFnet.
Models EGS as Erlang loss system, derives blocking probability formulas for three scenarios, proves insensitivity theorem depending only on mean attempt and calibration durations.
An inverse design framework based on guided-mode expansion and automatic differentiation optimizes a non-periodic circular cavity to a quality factor of ~9000 with Gaussian-like far-field emission, an order of magnitude above periodic bullseye designs.
Q-GUARD achieves over 85% qualified success rate on 4-hop paths in 100-node simulations by allocating per-hop fidelity targets via Werner-state equal-split and selecting paths with a segment-local expected-goodput metric.
Sunlight produces polarization-entangled photons through SPDC, achieving concurrence 0.905, fidelity 0.939, and Bell violation S=2.54 exceeding the classical limit.
A state discrimination game on energy-restricted quantum states creates a hierarchy of optimal success probabilities that certifies multipartite entanglement structure.
Bayesian optimization reliably identifies optimal protocols that maximize secret-key rates for heterogeneous quantum repeater chains with arbitrary nodes.
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
Depolarizing channels suppress the correlations needed to witness both state-dependent and state-independent contextuality in sequential KCBS and Peres-Mermin implementations, leading to classicalization.
Arqon delivers reliable quantum network service via admission control and scheduling that satisfies defined reliability requirements for accepted demands in static topologies, with O(k^3) and O(N^3) complexity.
Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic uncertainty relations.
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.
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.
Simulation-based comparison of BB84, B92, E91, and SARG04 QKD protocols on power-system SCADA datasets indicates a path toward quantum-secured SCADA/PMU networks.
Describes a self-contained simulation of an entangled photon pair generator via biexciton-exciton cascade in quantum dots, supporting resonant, chirped, and dichromatic excitation strategies.
citing papers explorer
-
Formalizing CHSH Rigidity in Lean 4
The CHSH rigidity theorem is machine-checked in Lean 4, confirming near-optimal strategies are locally isometric to the qubit strategy while exposing a gap in prior reasoning.
-
Routing Entanglement in Complex Quantum Networks Using GHZ States
A hybrid GHZ-BSM routing strategy outperforms pure BSM routing in square grid quantum networks but requires global-information adaptations to beat BSM in complex topologies such as Waxman, scale-free, and SURFnet.
-
An on-demand resource allocation algorithm for a quantum network hub and its performance analysis
Models EGS as Erlang loss system, derives blocking probability formulas for three scenarios, proves insensitivity theorem depending only on mean attempt and calibration durations.
-
Optimization of circular cavities via guided-mode expansion method based inverse design
An inverse design framework based on guided-mode expansion and automatic differentiation optimizes a non-periodic circular cavity to a quality factor of ~9000 with Gaussian-like far-field emission, an order of magnitude above periodic bullseye designs.
-
Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning
Q-GUARD achieves over 85% qualified success rate on 4-hop paths in 100-node simulations by allocating per-hop fidelity targets via Werner-state equal-split and selecting paths with a segment-local expected-goodput metric.
-
Generating quantum entanglement from sunlight
Sunlight produces polarization-entangled photons through SPDC, achieving concurrence 0.905, fidelity 0.939, and Bell violation S=2.54 exceeding the classical limit.
-
Entanglement Structure Certification Based on Energy-Restricted State Discrimination
A state discrimination game on energy-restricted quantum states creates a hierarchy of optimal success probabilities that certifies multipartite entanglement structure.
-
Bayesian Optimization for Repeater Protocols
Bayesian optimization reliably identifies optimal protocols that maximize secret-key rates for heterogeneous quantum repeater chains with arbitrary nodes.
-
Quantum Anonymous Secret Sharing with Permutation Invariant Codes
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
-
How Quantum Contextuality disappears in the Classical Limit
Depolarizing channels suppress the correlations needed to witness both state-dependent and state-independent contextuality in sequential KCBS and Peres-Mermin implementations, leading to classicalization.
-
Arqon: A suite of control applications enabling a reliable quantum network
Arqon delivers reliable quantum network service via admission control and scheduling that satisfies defined reliability requirements for accepted demands in static topologies, with O(k^3) and O(N^3) complexity.
-
Security of deterministic key distribution with higher-dimensional systems
Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic uncertainty relations.
-
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.
-
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.
-
Power Network SCADA Quantum Communications: A Comparison of BB84, B92, E91, and SGS04 Quantum Key Distribution Protocols
Simulation-based comparison of BB84, B92, E91, and SARG04 QKD protocols on power-system SCADA datasets indicates a path toward quantum-secured SCADA/PMU networks.
-
Entangled Photon Pair Generator via Biexciton-Exciton Cascade in Semiconductor Quantum Dots and its Simulation
Describes a self-contained simulation of an entangled photon pair generator via biexciton-exciton cascade in quantum dots, supporting resonant, chirped, and dichromatic excitation strategies.