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:1812.01032

Help | Advanced Search

Quantum Physics

arXiv:1812.01032 (quant-ph)
[Submitted on 3 Dec 2018 (v1) , last revised 14 Oct 2019 (this version, v2)]

Title: Designing quantum experiments with a genetic algorithm

Title: 用遗传算法设计量子实验

Authors:Rosanna Nichols, Lana Mineh, Jesús Rubio, Jonathan C. F. Matthews, Paul A. Knott
Abstract: We introduce a genetic algorithm that designs quantum optics experiments for engineering quantum states with specific properties. Our algorithm is powerful and flexible, and can easily be modified to find methods of engineering states for a range of applications. Here we focus on quantum metrology. First, we consider the noise-free case, and use the algorithm to find quantum states with a large quantum Fisher information (QFI). We find methods, which only involve experimental elements that are available with current or near-future technology, for engineering quantum states with up to a 100-fold improvement over the best classical state, and a 20-fold improvement over the optimal Gaussian state. Such states are a superposition of the vacuum with a large number of photons (around $80$), and can hence be seen as Schr\"odinger-cat-like states. We then apply the two most dominant noise sources in our setting -- photon loss and imperfect heralding -- and use the algorithm to find quantum states that still improve over the optimal Gaussian state with realistic levels of noise. This will open up experimental and technological work in using exotic non-Gaussian states for quantum-enhanced phase measurements. Finally, we use the Bayesian mean square error to look beyond the regime of validity of the QFI, finding quantum states with precision enhancements over the alternatives even when the experiment operates in the regime of limited data.
Abstract: 我们介绍了一种遗传算法,用于设计量子光学实验,以工程化具有特定特性的量子态。 我们的算法功能强大且灵活,可以轻松修改以找到适用于各种应用的工程化状态的方法。 在这里,我们专注于量子计量学。 首先,我们考虑无噪声的情况,并使用该算法寻找具有较大量子费舍尔信息(QFI)的量子态。 我们找到了方法,这些方法仅涉及当前或近期技术可实现的实验元件,用于工程化量子态,其性能比最佳经典态提高多达100倍,比最优高斯态提高20倍。 这类态是真空与大量光子(约$80$)的叠加态,因此可以看作是薛定谔猫态。 然后,我们将设置中两种最主要的噪声源——光子损耗和不完善的探测信号——应用于算法,以找到在现实噪声水平下仍优于最优高斯态的量子态。 这将为利用奇特的非高斯态进行量子增强相位测量的实验和技术工作开辟新的方向。 最后,我们使用贝叶斯均方误差来超越QFI的有效性范围,发现即使在实验处于数据有限的范围内,这些量子态仍能实现对其他方法的精度提升。
Comments: 11 pages + Appendix, 9 figures
Subjects: Quantum Physics (quant-ph) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Neural and Evolutionary Computing (cs.NE)
Cite as: arXiv:1812.01032 [quant-ph]
  (or arXiv:1812.01032v2 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.1812.01032
arXiv-issued DOI via DataCite
Journal reference: Quantum Sci. Technol. 4 045012 (2019)
Related DOI: https://doi.org/10.1088/2058-9565/ab4d89
DOI(s) linking to related resources

Submission history

From: Paul Knott PhD MPhys BSc [view email]
[v1] Mon, 3 Dec 2018 19:06:33 UTC (2,551 KB)
[v2] Mon, 14 Oct 2019 15:54:09 UTC (885 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2018-12
Change to browse by:
cs
cs.AI
cs.LG
cs.NE

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号