Sample optimal tomography of quantum Markov chains
Li Gao, and Nengkun Yu

TL;DR
This paper establishes dimension-independent robustness of the Petz map for quantum Markov chains and derives optimal sample complexities for their tomography and certification, extending results to multipartite systems.
Contribution
It provides the first dimension-independent robustness analysis of the Petz map and derives optimal sample complexities for quantum Markov chain tomography and certification.
Findings
Robustness results are dimension-independent for infidelity and trace distance.
Sample complexity for quantum Markov chain tomography is near-optimal and explicitly characterized.
Extended tomography results to multipartite quantum systems with scalable sample complexity.
Abstract
A state on a tripartite quantum system forms a Markov chain, i.e., quantum conditional independence, if it can be reconstructed from its marginal on by a quantum operation from to via the famous Petz map: a quantum Markov chain satisfies . In this paper, we study the robustness of the Petz map for different metrics, i.e., the closeness of marginals implies the closeness of the Petz map outcomes. The robustness results are dimension-independent for infidelity and trace distance . The applications of robustness results are The sample complexity of quantum Markov chain tomography, i.e., how many copies…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Markov Chains and Monte Carlo Methods
