REVIEW 2 cited by
Improved Decoy-state and Flag-state Squashing Methods
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this work, we present an improved analysis for decoy-state methods, enhancing both achievable key rates and recovering analytical results for the single intensity scenario. Our primary focus is improving the shortcomings observed in current decoy-state methods, particularly recovering results when employing no decoy intensities. Our methods enable the continuous interpolation across varying numbers of intensity settings. Additionally, we extend decoy-state techniques to encompass scenarios where intensities vary depending on the signal state, thereby relaxing the constraints on experimental implementations. Our findings demonstrate that a minimum of two intensities are sufficient for high asymptotic secret key rates, thereby further softening experimental requirements. Additionally, we address inherent imperfections within detection setups like imperfect beamsplitters. We derive provable secure lower bounds on the subspace population estimation, which is required for certain squashing methods such as the flag-state squasher. These analytical bounds allow us to encompass arbitrary passive linear optical setups, and together with intensities varying with each signal state, lets us include a broad class of experimental setups.
Forward citations
Cited by 2 Pith papers
-
Improved finite-size effects in QKD protocols with applications to decoy-state QKD
A finite-size QKD proof with per-observation statistical constraints and sifted-round-scaled correction terms yields improved key rates for decoy-state and coherent-attack protocols.
-
Tighter Asymptotic Key Rates for Intensity-Correlated Decoy-State QKD via Nonlinear Programming
Using IPOPT solutions of the full nonlinear CS-constrained problems as linearization points yields tighter, still-valid asymptotic key-rate bounds for decoy-state QKD with intensity correlations.
Discussion (0). Continue with ORCID to comment.