Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2405.02278

Help | Advanced Search

Quantum Physics

arXiv:2405.02278 (quant-ph)
[Submitted on 3 May 2024 (v1) , last revised 13 May 2024 (this version, v2)]

Title: Mitigating photon loss in linear optical quantum circuits: classical postprocessing methods outperforming postselection

Title: 减轻线性光学量子电路中的光子损耗:经典后处理方法优于后选择

Authors:James Mills, Rawad Mezher
Abstract: Photon loss rates set an effective upper limit on the size of computations that can be run on current linear optical quantum devices. We present a family of techniques to mitigate the effects of photon loss on both output probabilities and expectation values derived from noisy linear optical circuits composed of an input of $n$ photons, an $m$-mode interferometer, and $m$ single photon detectors. Central to these techniques is the construction of objects called recycled probabilities. Recycled probabilities are constructed from output statistics affected by loss, and are designed to amplify the signal of the ideal (lossless) probabilities. Classical postprocessing techniques then take recycled probabilities as input and output a set of loss-mitigated probabilities, or expectation values. We provide analytical and numerical evidence that these methods can be applied, up to large sample sizes, to produce more accurate outputs than those obtained from postselection - which is currently the standard method of coping with photon loss when sampling from discrete variable linear optical quantum circuits. In contrast, we provide strong evidence that the popular zero noise extrapolation technique cannot improve on on the performance of postselection for any photon loss rate.
Abstract: 光子损耗率对当前线性光学量子设备上可以运行的计算规模设定了有效的上限。 我们提出了一类技术,以减轻由包含输入$n$光子、$m$模式干涉仪和$m$单光子探测器组成的噪声线性光学电路对输出概率和期望值的影响。 这些技术的核心是构建称为回收概率的对象。 回收概率是从受损耗影响的输出统计中构建的,并旨在增强理想(无损耗)概率的信号。 然后,经典后处理技术将回收概率作为输入,并输出一组减轻损耗的概率或期望值。 我们提供了分析和数值证据,表明这些方法可以应用于大样本量,以产生比从后选择(目前在从离散变量线性光学量子电路采样时的标准方法)获得的结果更准确的输出。 相反,我们提供了强有力的证据,表明流行的零噪声外推技术无法在任何光子损耗率下优于后选择的性能。
Comments: 27 + 31 pages, small typos corrected, refs updated, comments welcome!
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2405.02278 [quant-ph]
  (or arXiv:2405.02278v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2405.02278
arXiv-issued DOI via DataCite

Submission history

From: James Mills [view email]
[v1] Fri, 3 May 2024 17:53:15 UTC (990 KB)
[v2] Mon, 13 May 2024 14:16:30 UTC (992 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2024-05

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号