Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Quantum Physics

arXiv:2109.12586 (quant-ph)
[Submitted on 26 Sep 2021 (v1), last revised 4 Mar 2024 (this version, v3)]

Title:Optimal Simulation of Quantum Measurements via the Likelihood POVMs

Authors:Arun Padakandla
View PDF
Abstract:By developing a new framework of likelihood POVMs, analysis techniques and a new proof of the quantum covering lemma, we address the simulation of separable quantum measurement over bipartite states. In addition to a new one shot inner bound that naturally generalizes to the asymptotic case, we demonstrate the power, generality and universality of the developed techniques in the most general distributed measurement scenario by recovering all current known inner bounds. In addition to the above results, this framework is appealing in being the most natural and simple POVM simulation protocol.
Subjects: Quantum Physics (quant-ph); Information Theory (cs.IT)
Cite as: arXiv:2109.12586 [quant-ph]
  (or arXiv:2109.12586v3 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2109.12586

Submission history

From: Arun Padakandla [view email]
[v1] Sun, 26 Sep 2021 12:44:15 UTC (470 KB)
[v2] Tue, 28 Sep 2021 12:30:55 UTC (470 KB)
[v3] Mon, 4 Mar 2024 18:30:52 UTC (679 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2021-09
Change to browse by:
cs
cs.IT
math
math.IT

References & Citations

export BibTeX citation

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?)

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?)