Improved Decoy-state and Flag-state Squashing Methods

• URL: http://arxiv.org/abs/2405.05069v2
• Date: Wed, 12 Jun 2024 17:36:53 GMT
• Title: Improved Decoy-state and Flag-state Squashing Methods
• Authors: Lars Kamin, Norbert Lütkenhaus,
• Abstract summary: We present an improved analysis for decoy-state methods. Our primary focus is improving the shortcomings observed in current decoy-state methods. We extend decoy-state techniques to encompass scenarios where intensities vary depending on the signal state.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• 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.

Related papers

• Intensity Confusion Matters: An Intensity-Distance Guided Loss for Bronchus Segmentation [68.50007997260464]
  Intensity values of certain background voxels approach those of the foreground voxels within bronchi. We introduce a novel Intensity-Distance Guided loss function, which assigns adaptive weights to different image voxels for mining hard samples that cause the intensity confusion.
  arXiv  Detail & Related papers  (2024-06-23T16:09:21Z)
• Digging into contrastive learning for robust depth estimation with diffusion models [55.62276027922499]
  We propose a novel robust depth estimation method called D4RD. It features a custom contrastive learning mode tailored for diffusion models to mitigate performance degradation in complex environments. In experiments, D4RD surpasses existing state-of-the-art solutions on synthetic corruption datasets and real-world weather conditions.
  arXiv  Detail & Related papers  (2024-04-15T14:29:47Z)
• Security of decoy-state quantum key distribution with correlated intensity fluctuations [0.0]
  Current decoy-state QKD setups operate at GHz repetition rates. memory effects in the modulators and electronics that control them create correlations between the intensities of the emitted pulses. This translates into information leakage about the selected intensities.
  arXiv  Detail & Related papers  (2022-06-14T09:05:41Z)
• Reliable Causal Discovery with Improved Exact Search and Weaker Assumptions [17.097192646470372]
  We introduce several strategies to improve the scalability of exact score-based methods in the linear Gaussian setting. We develop a super-structure estimation method based on the support of inverse covariance matrix which requires assumptions that are strictly weaker than faithfulness. We also propose a local search strategy that performs exact search on the local clusters formed by each variable and its neighbors within two hops in the super-structure.
  arXiv  Detail & Related papers  (2022-01-14T20:52:30Z)
• Surveillance Evasion Through Bayesian Reinforcement Learning [78.79938727251594]
  We consider a 2D continuous path planning problem with a completely unknown intensity of random termination. Those Observers' surveillance intensity is a priori unknown and has to be learned through repetitive path planning.
  arXiv  Detail & Related papers  (2021-09-30T02:29:21Z)
• Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updates [67.19481956584465]
  It has been experimentally observed that the efficiency of distributed training with saturation (SGD) depends decisively on the batch size and -- in implementations -- on the staleness. We show that our results are tight and illustrate key findings in numerical experiments.
  arXiv  Detail & Related papers  (2021-03-03T12:08:23Z)
• Reconstruction of Sparse Signals under Gaussian Noise and Saturation [1.9873949136858349]
  Most compressed sensing algorithms do not account for the effect of saturation in noisy compressed measurements. We propose a new data fidelity function which is based on ensuring a certain form of consistency between the signal and the saturated measurements.
  arXiv  Detail & Related papers  (2021-02-08T03:01:46Z)
• Intensity Scan Context: Coding Intensity and Geometry Relations for Loop Closure Detection [26.209412893744094]
  Loop closure detection is an essential and challenging problem in simultaneous localization and mapping (SLAM) Existing works on 3D loop closure detection often leverage the matching of local or global geometrical-only descriptors. We propose a novel global descriptor, intensity scan context (ISC), that explores both geometry and intensity characteristics.
  arXiv  Detail & Related papers  (2020-03-12T08:11:09Z)
• Disentangling Adaptive Gradient Methods from Learning Rates [65.0397050979662]
  We take a deeper look at how adaptive gradient methods interact with the learning rate schedule. We introduce a "grafting" experiment which decouples an update's magnitude from its direction. We present some empirical and theoretical retrospectives on the generalization of adaptive gradient methods.
  arXiv  Detail & Related papers  (2020-02-26T21:42:49Z)
• The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime [52.38455827779212]
  We propose a novel technique for analyzing adaptive sampling called the em Simulator. We prove the first instance-based lower bounds the top-k problem which incorporate the appropriate log-factors. Our new analysis inspires a simple and near-optimal for the best-arm and top-k identification, the first em practical of its kind for the latter problem.
  arXiv  Detail & Related papers  (2017-02-16T23:42:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.