Learning Distributions over Quantum Measurement Outcomes
Weiyuan Gong, Scott Aaronson

TL;DR
This paper introduces an efficient method for learning the probability distributions of quantum measurement outcomes with multiple outcomes, improving over previous shadow tomography techniques especially when measurements have more than two outcomes.
Contribution
We develop an online shadow tomography method for estimating distributions over unknown quantum measurements with multiple outcomes, achieving near-optimal sample complexity.
Findings
Sample complexity scales logarithmically with the number of measurements and system dimension.
The method is optimal in its dependence on the number of measurement outcomes.
A matching lower bound confirms the efficiency of our approach.
Abstract
Shadow tomography for quantum states provides a sample efficient approach for predicting the properties of quantum systems when the properties are restricted to expectation values of -outcome POVMs. However, these shadow tomography procedures yield poor bounds if there are more than 2 outcomes per measurement. In this paper, we consider a general problem of learning properties from unknown quantum states: given an unknown -dimensional quantum state and unknown quantum measurements with outcomes, estimating the probability distribution for applying on to within total variation distance . Compared to the special case when , we need to learn unknown distributions instead of values. We develop an online shadow tomography procedure that solves this problem with high success probability…
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
TopicsMachine Learning and Algorithms · Sparse and Compressive Sensing Techniques · Distributed Sensor Networks and Detection Algorithms
