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:2212.07987v4

Help | Advanced Search

Quantum Physics

arXiv:2212.07987v4 (quant-ph)
[Submitted on 15 Dec 2022 (v1) , last revised 26 Oct 2023 (this version, v4)]

Title: Inferring Quantum Network Topology using Local Measurements

Title: 使用局部测量推断量子网络拓扑

Authors:Daniel T. Chen, Brian Doolittle, Jeffrey M. Larson, Zain H. Saleem, Eric Chitambar
Abstract: Statistical correlations that can be generated across the nodes in a quantum network depend crucially on its topology. However, this topological information might not be known a priori, or it may need to be verified. In this paper, we propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We leverage entropic quantities -- namely, the von Neumann entropy and the measured mutual information -- as well as measurement covariance to uniquely characterize the topology. We show that the entropic quantities are sufficient to distinguish two networks that prepare GHZ states. Moreover, if qubit measurements are available, both entropic quantities and covariance can be used to infer the network topology without state-preparation assumptions. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization. Numerical experiments on both classical simulators and quantum hardware show that covariance is generally more reliable for accurately and efficiently inferring the topology, whereas entropy-based methods are often better at identifying the absence of entanglement in the low-shot regime.
Abstract: 量子网络中节点之间可以生成的统计相关性在很大程度上取决于其拓扑结构。 然而,这种拓扑信息可能事先并不知道,或者可能需要进行验证。 在本文中,我们提出了一种高效的协议,用于区分和推断量子网络的拓扑结构。 我们利用熵量——即冯·诺依曼熵和测量互信息——以及测量协方差来唯一地表征拓扑结构。 我们证明,熵量足以区分两个制备GHZ态的网络。 此外,如果可以获得量子比特测量结果,那么熵量和协方差都可以用来推断网络拓扑结构,而无需假设状态制备。 我们表明,该协议对噪声具有完全的鲁棒性,并可以通过量子变分优化实现。 在经典模拟器和量子硬件上的数值实验表明,协方差通常在准确且高效地推断拓扑结构方面更可靠,而基于熵的方法在低样本情况下通常更擅长识别纠缠的缺失。
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2212.07987 [quant-ph]
  (or arXiv:2212.07987v4 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2212.07987
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1103/prxquantum.4.040347
DOI(s) linking to related resources

Submission history

From: Jeffrey Larson [view email]
[v1] Thu, 15 Dec 2022 17:36:12 UTC (241 KB)
[v2] Sun, 18 Dec 2022 01:44:42 UTC (232 KB)
[v3] Fri, 28 Jul 2023 13:39:05 UTC (1,660 KB)
[v4] Thu, 26 Oct 2023 01:53:05 UTC (1,661 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2022-12

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号