The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Shadow Tomography of Quantum States
Open accessAbstract
We introduce the problem of shadow tomography: given an unknown $D$-dimensional quantum mixed state $\rho$, as well as known two-outcome measurements $E_{1},\ldots,E_{M}$, estimate the probability that $E_{i}$ accepts $\rho$, to within additive error $\varepsilon$, for each of the $M$ measurements. How many copies of $\rho$ are needed to achieve this, with high probability? Surprisingly, we give a procedure that solves the problem by measuring only $\widetilde{O}\left(\varepsilon^{-4}\cdot\log^{4}M\cdot\log D\right)$ copies. This means, for example, that we can learn the behavior of an arbitrary $n$-qubit state, on all accepting/rejecting circuits of some fixed polynomial size, by measuring only $n^{O(1)}$ copies of the state. This resolves an open problem of the author, which arose from his work on private-key quantum money schemes, but which also has applications to quantum copy-protected software, quantum advice, and quantum one-way communication. Recently, building on this work, Branda͂o et al. have given a different approach to shadow tomography using semidefinite programming, which achieves a savings in computation time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Scalable multiparticle entanglement of trapped ions
Häffner, H., Hänsel, W., Roos, C. F., Benhelm, J., Chek-al-kar, D., Chwalla, M., Körber, T., Rapol, U. D., Riebe, M., Schmidt, P. O., et al. (2005) · Nature · doi:10.1038/nature04279 · Cited by 1,253
Quantum State Tomography via Compressed Sensing
Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., & Eisert, J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.150401 · Cited by 1,093
Coding theorem and strong converse for quantum channels
Winter, A. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796385 · Cited by 451
10-Qubit Entanglement and Parallel Logic Operations with a Superconducting Circuit
Song, C., Xu, K., Liu, W., Yang, C.-P., Zheng, S.-B., Deng, H., Xie, Q., Huang, K., Guo, Q., Zhang, L., et al. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180511 · Cited by 449
Strong converse for identification via quantum channels
Ahlswede, R., & Winter, A. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.985947 · Cited by 423
Aspects of Generic Entanglement
Hayden, P., Leung, D. W., & Winter, A. (2006) · Communications in Mathematical Physics · doi:10.1007/s00220-006-1535-6 · Cited by 359
Quantum computing, postselection, and probabilistic polynomial-time
Aaronson, S. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2005.1546 · Cited by 311
Self-citationThe Complexity of Quantum States and Transformations: From Quantum Money to Black HolesPreprint
Aaronson, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.05256 · Cited by 304
Self-citationDense quantum coding and quantum finite automata
Ambainis, A., Nayak, A., Ta-Shma, A., & Vazirani, U. (2002) · Journal of the ACM · doi:10.1145/581771.581773 · Cited by 258
Marriott, C., & Watrous, J. (2005) · computational complexity · doi:10.1007/s00037-005-0194-x · Cited by 241
Sample-optimal tomography of quantum states
Haah, J., Harrow, A. W., Ji, Z., Wu, X., & Yu, N. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897585 · Cited by 238
Aspects of generic entanglement
Hayden, P. M., Leung, D., & Winter, A. (2004) · Explore Bristol Research · Cited by 236
The learnability of quantum states
Aaronson, S. (2007) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2007.0113 · Cited by 227
Self-citationQuantum Cryptography, or Unforgeable Subway Tokens
Bennett, C. H., Brassard, G., Breidbart, S., & Wiesner, S. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_26 · Cited by 192
O'Donnell, R., & Wright, J. (2016) · Proceedings of the forty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/2897518.2897544 · Cited by 181
Quantum Copy-Protection and Quantum Money
Aaronson, S. (2009) · 2009 24th Annual IEEE Conference on Computational Complexity · doi:10.1109/ccc.2009.42 · Cited by 177
Self-citationSample-optimal tomography of quantum states
Haah, J., Harrow, A. W., Ji, Z., Wu, X., & Yu, N. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2719044 · Cited by 171
Limitations of Quantum Advice and One-Way Communication
Aaronson, S. (2005) · Theory of Computing · doi:10.4086/toc.2005.v001a001 · Cited by 157
Self-citationQuantum Speed-Ups for Solving Semidefinite Programs
Brandao, F. G. S. L., & Svore, K. M. (2017) · 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2017.45 · Cited by 142
The quantum query complexity of the hidden subgroup problem is polynomial
Ettinger, M., Høyer, P., & Knill, E. H. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.01.024 · Cited by 142
On Learning Linear Functions from Subset and Its Applications in Quantum ComputingPreprint
Brandão, F. G. S. L., Kalev, A., Li, T., Lin, C. Y.-Y., Svore, K. M., & Wu, X. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.esa.2018.66 · Cited by 140
Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., & de Wolf, R. (2008) · SIAM Journal on Computing · doi:10.1137/070706550 · Cited by 90
Efficient quantum tomography II
O’Donnell, R., & Wright, J. (2017) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055454 · Cited by 81
Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money
Molina, A., Vidick, T., & Watrous, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35656-8_4 · Cited by 80
On Learning Distributions from their Samples
Kamath, S., Orlitsky, A., Pichapati, D., & Suresh, A. T. (2015) · Conference on Learning Theory · Cited by 67
Polynomial time quantum computation with advice
Nishimura, H., & Yamakami, T. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.02.005 · Cited by 60
Sequential decoding of a general classical-quantum channel
Wilde, M. M. (2013) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2013.0259 · Cited by 45
Learning stabilizer states by Bell samplingPreprint
Montanaro, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.04012 · Cited by 21
Exponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum LearningPreprint
Brandão, F. G. S. L., Kalev, A., Li, T., Lin, C. Y.-Y., Svore, K. M., & Wu, X. (2017) · arXiv (Cornell University) · Cited by 15
A Full Characterization of Quantum Advice
Aaronson, S., & Drucker, A. (2014) · SIAM Journal on Computing · doi:10.1137/110856939 · Cited by 11
Self-citationGrowth Factor and Receptor Tyrosine Kinases
Aaronson, S. A. (2005) · Science s STKE · doi:10.1126/stke.2722005tr6 · Cited by 7
Self-citationValiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
Machine learning and the physical sciences
Carleo, G., Cirac, I., Cranmer, K., Daudet, L., Schuld, M., Tishby, N., Vogt-Maranto, L., & Zdeborová, L. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045002 · Cited by 2,417
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Predicting many properties of a quantum system from very few measurements
Huang, H.-Y., Kueng, R., & Preskill, J. (2020) · Nature Physics · doi:10.1038/s41567-020-0932-7 · Cited by 1,240
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Power of data in quantum machine learning
Huang, H.-Y., Broughton, M., Mohseni, M., Babbush, R., Boixo, S., Neven, H., & McClean, J. R. (2021) · Nature Communications · doi:10.1038/s41467-021-22539-9 · Cited by 896
Metadata
- Authors
- Aaronson, S.
- Venue
- SIAM Journal on Computing
- Published
- 2020-01
- Volume
- 49
- Issue
- 5
- Pages
- STOC18-368-STOC18-394
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2767713609
- Cited by
- 315
- References
- 34
- FWCI
- 8.77
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.