Programming the Kennedy Receiver for Capacity Maximization versus Minimizing One-shot Error Probability

• URL: http://arxiv.org/abs/2002.09275v3
• Date: Tue, 5 May 2020 00:34:36 GMT
• Title: Programming the Kennedy Receiver for Capacity Maximization versus Minimizing One-shot Error Probability
• Authors: Rahul Bhadani, Michael Grace, Ivan B. Djordjevic, Jonathan Sprinkle, Saikat Guha
• Abstract summary: We find the capacity attained by the Kennedy receiver for coherent-state BPSK when the symbol prior p and pre-detection displacement are optimized. The optimal displacement is different than what minimizes error probability for single-shot BPSK state discrimination.
• Score: 3.9548535445908928
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We find the capacity attained by the Kennedy receiver for coherent-state BPSK when the symbol prior p and pre-detection displacement are optimized. The optimal displacement is different than what minimizes error probability for single-shot BPSK state discrimination.

Related papers

• Inverse-Squeezing Kennedy Receiver for Near-Helstrom Discrimination of Displaced-Squeezed BPSK [18.54481311613931]
  Inverse-squeezing Kennedy (IS-Kennedy) receiver.<n>Photon-number-resolving (PNR) detector to perform maximum posteriori (MAP) decision-making.<n>In the low-photon-number regime ($N approx 0.6$), the proposed scheme surpasses the coherent-state limit, achieving an error rate below 1%.
  arXiv  Detail & Related papers  (2026-01-27T01:58:37Z)
• Generalized State Discrimination for Tunable Quantum Key Distribution: The phiQKD Protocol [0.0]
  We introduce a tunable framework for generalized quantum state discrimination (GSD) and apply it to quantum key distribution (QKD) through a protocol we call phiQKD.<n>We show that, treating quantum measurement as a tunable parameter, rather than a fixed operation, enables flexible protocol optimization and improved performance under realistic constraints.
  arXiv  Detail & Related papers  (2025-11-09T18:19:33Z)
• Experimental optimal discrimination of $N$ states of a qubit with fixed rates of inconclusive outcomes [0.5452584641316628]
  In a general optimized measurement scheme, the error rate is minimized under the constraint of a fixed rate of inconclusive outcomes (FRIO) Here, we experimentally demonstrate the optimal FRIO discrimination between $N=2,3,5,$ and $7$ equally likely symmetric states of a qubit encoded in photonic path modes.
  arXiv  Detail & Related papers  (2024-11-21T19:09:58Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration [76.40993825836222]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration. The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• Optimizing state-discrimination receivers for continuous-variable quantum key distribution over a wiretap channel [1.3108652488669736]
  We address a continuous-variable quantum key distribution protocol employing quaternary phase-shift-keying (QPSK) of coherent states. We consider a pure-loss quantum wiretap channel, in which a possible eavesdropper is limited to collect the sole channel losses.
  arXiv  Detail & Related papers  (2023-06-20T12:26:06Z)
• Variational Refinement for Importance Sampling Using the Forward Kullback-Leibler Divergence [77.06203118175335]
  Variational Inference (VI) is a popular alternative to exact sampling in Bayesian inference. Importance sampling (IS) is often used to fine-tune and de-bias the estimates of approximate Bayesian inference procedures. We propose a novel combination of optimization and sampling techniques for approximate Bayesian inference.
  arXiv  Detail & Related papers  (2021-06-30T11:00:24Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Optimally Displaced Threshold Detection for Discriminating Binary Coherent States Using Imperfect Devices [50.09039506170243]
  We analytically study the performance of the generalized Kennedy receiver having optimally displaced threshold detection (ODTD) in a realistic situation with noises and imperfect devices. We show that the proposed greedy search algorithm can obtain a lower and smoother error probability than the existing works.
  arXiv  Detail & Related papers  (2020-07-21T21:52:29Z)
• Probabilistic Autoencoder [0.0]
  We introduce the Probabilistic Autoencoder (PAE) that learns the probability distribution of the AE latent space weights using a normalizing flow (NF) The PAE is fast and easy to train and achieves small reconstruction errors, high sample quality, and good performance in downstream tasks.
  arXiv  Detail & Related papers  (2020-06-09T19:43:35Z)
• Optimizing Vessel Trajectory Compression [71.42030830910227]
  In previous work we introduced a trajectory detection module that can provide summarized representations of vessel trajectories by consuming AIS positional messages online. This methodology can provide reliable trajectory synopses with little deviations from the original course by discarding at least 70% of the raw data as redundant. However, such trajectory compression is very sensitive to parametrization. We take into account the type of each vessel in order to provide a suitable configuration that can yield improved trajectory synopses.
  arXiv  Detail & Related papers  (2020-05-11T20:38:56Z)
• SUMO: Unbiased Estimation of Log Marginal Probability for Latent Variable Models [80.22609163316459]
  We introduce an unbiased estimator of the log marginal likelihood and its gradients for latent variable models based on randomized truncation of infinite series. We show that models trained using our estimator give better test-set likelihoods than a standard importance-sampling based approach for the same average computational cost.
  arXiv  Detail & Related papers  (2020-04-01T11:49:30Z)

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.