Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata
bibkey: galvaobrod2020overlaps
authors: Ernesto F. Galvão; Daniel J. Brod
year: 2020
title: "Quantum and classical bounds for two-state overlaps"
doi: 10.1103/PhysRevA.101.062110
url: https://arxiv.org/abs/1902.11039v3
claim: "For three pure states with known overlaps r_AB and r_AC, the unknown overlap r_BC lies between explicit tight bounds r_- (or 0) and r_+; for a connected graph of known overlaps the paper propagates these three-state intervals by intersecting over common neighbours, and leaves open whether this procedure is optimal."
strata_touched:
  - D5/S3/Quantum/PureState/OverlapIntervalPropagationRefutation
license: citation-only
triage: anchor

Galvão and Brod, Quantum and classical bounds for two-state overlaps

E. F. Galvão and D. J. Brod, Phys. Rev. A 101, 062110 (2020); arXiv:1902.11039v3. Quotations are from the v3 TeX source.

For pure states the overlap is . For the chain with known , put . Then , and if , otherwise ; the bounds hold for pure states of arbitrary dimension and are attained by suitable triples. For a connected graph of known overlaps, the procedure cycles over all common neighbours of , intersects the inferred ranges for , adds the edge and repeats until the graph is complete. Section II.B continues:

We leave it as an open question whether this procedure is optimal, but emphasize that even the initial iteration that produces a complete graph already provides bounds for every pair of vertices, which may be useful even if not tight.

Verified locator

Source: https://arxiv.org/abs/1902.11039v3

  • DOI: https://doi.org/10.1103/PhysRevA.101.062110 (Physical Review A 101(6), article 062110; title, authors, journal, volume, issue and article number from Crossref).
  • URL: https://arxiv.org/abs/1902.11039v3. The e-print member overlap_pra_v3.tex has 674 lines and md5 52c4a57f4ae9ae3536a2134c036dc28d. Locations:
    • overlaps and , l. 96–119; the three-state bounds, l. 121–131;
    • the propagation procedure, l. 150–156; the open question, l. 165.