Performance advantage of quantum hypothesis testing for partially coherent optical sources

• URL: http://arxiv.org/abs/2404.18120v1
• Date: Sun, 28 Apr 2024 08:58:56 GMT
• Title: Performance advantage of quantum hypothesis testing for partially coherent optical sources
• Authors: Jian-Dong Zhang, Kexin Zhang, Lili Hou, Shuai Wang,
• Abstract summary: Previous studies assume that the potential source is completely incoherent. We compare the error probability limit given by the quantum Helstrom bound with the error probability given by direct decision. We propose a specific detection strategy using binary spatial-mode demultiplexing, which can be used in the scenarios without any prior information.
• Score: 5.944839595970818
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Determining the presence of a potential optical source in the interest region is important for an imaging system and can be achieved by using hypothesis testing. The previous studies assume that the potential source is completely incoherent. In this paper, this problem is generalized to the scenario with partially coherent sources and any prior probabilities. We compare the error probability limit given by the quantum Helstrom bound with the error probability given by direct decision based on the prior probability. On this basis, the quantum-optimal detection advantage and detection-useless region are analyzed. For practical purposes, we propose a specific detection strategy using binary spatial-mode demultiplexing, which can be used in the scenarios without any prior information. This strategy shows superior detection performance and the results hold prospects for achieving super-resolved microscopic and astronomical imaging.

Related papers

• Relative-belief inference in quantum information theory [0.0]
  We show that the relative belief procedure chooses Hilbert spaces that are never smaller in dimension than those selected from optimizing a broad class of information criteria. We apply the relative belief procedure to an important application: state reconstruction of imperfect quantum sources.
  arXiv  Detail & Related papers  (2024-06-05T14:59:58Z)
• To Believe or Not to Believe Your LLM [51.2579827761899]
  We explore uncertainty quantification in large language models (LLMs) We derive an information-theoretic metric that allows to reliably detect when only epistemic uncertainty is large. We conduct a series of experiments which demonstrate the advantage of our formulation.
  arXiv  Detail & Related papers  (2024-06-04T17:58:18Z)
• Waiting time statistics for a double quantum dot coupled with an optical cavity [0.0]
  A double quantum dot coupled to an optical cavity is a prototypical example of a non-trivial open quantum system. Recent experimental and theoretical studies show that this system is a candidate for single-photon detection in the microwave domain. We provide a detailed analysis of the waiting time statistics of this system within the quantum jump unravelling.
  arXiv  Detail & Related papers  (2024-04-21T21:08:36Z)
• Gaussian boson sampling validation via detector binning [0.0]
  We propose binned-detector probability distributions as a suitable quantity to statistically validate GBS experiments. We show how to compute such distributions by leveraging their connection with their respective characteristic function. We also illustrate how binned-detector probability distributions behave when Haar-averaged over all possible interferometric networks.
  arXiv  Detail & Related papers  (2023-10-27T12:55:52Z)
• Calibrating Neural Simulation-Based Inference with Differentiable Coverage Probability [50.44439018155837]
  We propose to include a calibration term directly into the training objective of the neural model. By introducing a relaxation of the classical formulation of calibration error we enable end-to-end backpropagation. It is directly applicable to existing computational pipelines allowing reliable black-box posterior inference.
  arXiv  Detail & Related papers  (2023-10-20T10:20:45Z)
• Approximating Counterfactual Bounds while Fusing Observational, Biased and Randomised Data Sources [64.96984404868411]
  We address the problem of integrating data from multiple, possibly biased, observational and interventional studies. We show that the likelihood of the available data has no local maxima. We then show how the same approach can address the general case of multiple datasets.
  arXiv  Detail & Related papers  (2023-07-31T11:28:24Z)
• Bounding Counterfactuals under Selection Bias [60.55840896782637]
  We propose a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal.
  arXiv  Detail & Related papers  (2022-07-26T10:33:10Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Violation of Bell's inequality with quantum-dot single-photon sources [0.0]
  We investigate the possibility of realizing a loophole-free violation of Bell's inequality using deterministic single-photon sources. We benchmark the performance requirements to state-of-the-art deterministic single-photon sources based on quantum dots in photonic nanostructures.
  arXiv  Detail & Related papers  (2021-09-29T20:47:56Z)
• Exploring the Intrinsic Probability Distribution for Hyperspectral Anomaly Detection [9.653976364051564]
  We propose a novel probability distribution representation detector (PDRD) that explores the intrinsic distribution of both the background and the anomalies in original data for hyperspectral anomaly detection. We conduct the experiments on four real data sets to evaluate the performance of our proposed method.
  arXiv  Detail & Related papers  (2021-05-14T11:42:09Z)
• Distributionally Robust Bayesian Quadrature Optimization [60.383252534861136]
  We study BQO under distributional uncertainty in which the underlying probability distribution is unknown except for a limited set of its i.i.d. samples. A standard BQO approach maximizes the Monte Carlo estimate of the true expected objective given the fixed sample set. We propose a novel posterior sampling based algorithm, namely distributionally robust BQO (DRBQO) for this purpose.
  arXiv  Detail & Related papers  (2020-01-19T12:00:33Z)

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.