AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Learning Distributions over Quantum Measurement Outcomes

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Learning halfspaces under noise · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use distribution threshold search and online learning instead of estimating each outcome event through separate two-outcome shadow tomographyK-outcome shadow tomography · K-outcome shadow tomographycopies of ρ: \tilde{O}(K^4) -> \tilde{O}(K)Helped
Extend the proposed algorithm to multiple outcomes while retaining the two-outcome sample-complexity dependence on M, d, and εShadow tomography · K-outcome shadow tomographycopies of ρ: \tilde{O}\left(\frac{\log(1/\delta)}{\epsilon^4}\cdot K\cdot\log^2M\cdot\log d\right)Mixed
Use the proposed procedure rather than unrestricted estimation for the K dependenceK-outcome shadow tomography · K-outcome shadow tomographycopies of ρ: \tilde{O}(K) upper bound; \Omega(K) dependence lower boundNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy