{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,30]],"date-time":"2026-10-30T10:01:57Z","timestamp":1793354517337,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316378","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"322-333","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":83,"title":["Gentle measurement of quantum states and differential privacy"],"prefix":"10.1145","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guy N.","family":"Rothblum","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"S. Aaronson. 2005.  S. Aaronson. 2005.","DOI":"10.1126\/stke.2722005tr6"},{"key":"e_1_3_2_1_2_1","volume-title":"Theory of Computing 1","year":"2005","unstructured":"Limitations of quantum advice and one-way communication. Theory of Computing 1 ( 2005 ), 1\u201328. Earlier version in CCC\u2019 2004. quantph\/0402095. Limitations of quantum advice and one-way communication. Theory of Computing 1 (2005), 1\u201328. Earlier version in CCC\u20192004. quantph\/0402095."},{"key":"e_1_3_2_1_3_1","unstructured":"S. Aaronson. 2006.  S. Aaronson. 2006."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. Conference on Computational Complexity. 261\u2013273","unstructured":"QMA\/qpoly is contained in PSPACE\/poly: de-Merlinizing quantum protocols . In Proc. Conference on Computational Complexity. 261\u2013273 . quant-ph\/0510230. QMA\/qpoly is contained in PSPACE\/poly: de-Merlinizing quantum protocols. In Proc. Conference on Computational Complexity. 261\u2013273. quant-ph\/0510230."},{"key":"e_1_3_2_1_5_1","unstructured":"S. Aaronson. 2009.  S. Aaronson. 2009."},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. Conference on Computational Complexity. 229\u2013242","unstructured":"Quantum copy-protection and quantum money . In Proc. Conference on Computational Complexity. 229\u2013242 . arXiv:1110.5353. Quantum copy-protection and quantum money. In Proc. Conference on Computational Complexity. 229\u2013242. arXiv:1110.5353."},{"key":"e_1_3_2_1_7_1","unstructured":"S. Aaronson. 2016.  S. Aaronson. 2016."},{"key":"e_1_3_2_1_8_1","volume-title":"Lecture Notes for the 28th McGill Invitational Workshop on Computational Complexity, Holetown, Barbados. With guest lectures by A. Bouland and L. Schaeffer. www.scottaaronson.com\/barbados-","year":"2016","unstructured":"The Complexity of Quantum States and Transformations : From Quantum Money to Black Holes . Lecture Notes for the 28th McGill Invitational Workshop on Computational Complexity, Holetown, Barbados. With guest lectures by A. Bouland and L. Schaeffer. www.scottaaronson.com\/barbados- 2016 .pdf. The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes. Lecture Notes for the 28th McGill Invitational Workshop on Computational Complexity, Holetown, Barbados. With guest lectures by A. Bouland and L. Schaeffer. www.scottaaronson.com\/barbados- 2016.pdf."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188802"},{"key":"e_1_3_2_1_10_1","unstructured":"S. Aaronson X. Chen E. Hazan S. Kale and A. Nayak. 2018.  S. Aaronson X. Chen E. Hazan S. Kale and A. Nayak. 2018."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. of Neural Information Processing Systems (NIPS). arXiv:1802","unstructured":"Online learning of quantum states . In Proc. of Neural Information Processing Systems (NIPS). arXiv:1802 .09025. Online learning of quantum states. In Proc. of Neural Information Processing Systems (NIPS). arXiv:1802.09025."},{"key":"e_1_3_2_1_12_1","unstructured":"D. Aharonov and A. Ta-Shma. 2003.  D. Aharonov and A. Ta-Shma. 2003."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. ACM STOC. 20\u201329","unstructured":"Adiabatic quantum state generation and statistical zero knowledge . In Proc. ACM STOC. 20\u201329 . quant-ph\/0301023. Adiabatic quantum state generation and statistical zero knowledge. In Proc. ACM STOC. 20\u201329. quant-ph\/0301023."},{"key":"e_1_3_2_1_14_1","unstructured":"R. Bassily K. Nissim A. D. Smith T. Steinke U. Stemmer and J. Ullman. 2016.  R. Bassily K. Nissim A. D. Smith T. Steinke U. Stemmer and J. Ullman. 2016."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897566"},{"key":"e_1_3_2_1_16_1","unstructured":"C. Bennett E. Bernstein G. Brassard and U. Vazirani. 1997.  C. Bennett E. Bernstein G. Brassard and U. Vazirani. 1997."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_3_2_1_18_1","unstructured":"quant-ph\/9701001.  quant-ph\/9701001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.73.032336"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"F. Brand\u00e3o A. Kalev T. Li C. Lin K. Svore and X. Wu. 2017. Exponential quantum speed-ups for semidefinite programming with applications to quantum learning. (2017).  F. Brand\u00e3o A. Kalev T. Li C. Lin K. Svore and X. Wu. 2017. Exponential quantum speed-ups for semidefinite programming with applications to quantum learning. (2017).","DOI":"10.1109\/FOCS.2017.45"},{"key":"e_1_3_2_1_21_1","unstructured":"arXiv:1710.02581.  arXiv:1710.02581."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591877"},{"key":"e_1_3_2_1_23_1","unstructured":"C. Dwork V. Feldman M. Hardt T. Pitassi O. Reingold and A. L. Roth. 2015.  C. Dwork V. Feldman M. Hardt T. Pitassi O. Reingold and A. L. Roth. 2015."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of Neural Information Processing Systems (NIPS). 2350\u20132358","unstructured":"Generalization in adaptive data analysis and holdout reuse . In Proc. of Neural Information Processing Systems (NIPS). 2350\u20132358 . Generalization in adaptive data analysis and holdout reuse. In Proc. of Neural Information Processing Systems (NIPS). 2350\u20132358."},{"key":"e_1_3_2_1_25_1","unstructured":"C. Dwork V. Feldman M. Hardt T. Pitassi O. Reingold and A. L. Roth. 2015.  C. Dwork V. Feldman M. Hardt T. Pitassi O. Reingold and A. L. Roth. 2015."},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. ACM STOC. 117\u2013 126","unstructured":"Preserving statistical validity in adaptive data analysis . In Proc. ACM STOC. 117\u2013 126 . Preserving statistical validity in adaptive data analysis. In Proc. ACM STOC. 117\u2013 126."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"e_1_3_2_1_29_1","unstructured":"C. Dwork G. N. Rothblum and S. P. Vadhan. 2010.  C. Dwork G. N. Rothblum and S. P. Vadhan. 2010."},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. IEEE FOCS. 51\u201360","unstructured":"Boosting and differential privacy . In Proc. IEEE FOCS. 51\u201360 . Boosting and differential privacy. In Proc. IEEE FOCS. 51\u201360."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.01.024"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.042312"},{"key":"e_1_3_2_1_33_1","unstructured":"arXiv:quantph\/0302102.  arXiv:quantph\/0302102."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897585"},{"key":"e_1_3_2_1_35_1","unstructured":"M. Hardt and G. N. Rothblum. 2010.  M. Hardt and G. N. Rothblum. 2010."},{"key":"e_1_3_2_1_36_1","volume-title":"Proc. IEEE FOCS. 61\u201370","author":"A","unstructured":"A multiplicative weights mechanism for privacy-preserving data analysis . In Proc. IEEE FOCS. 61\u201370 . A multiplicative weights mechanism for privacy-preserving data analysis. In Proc. IEEE FOCS. 61\u201370."},{"key":"e_1_3_2_1_37_1","unstructured":"M. Hardt and J. Ullman. 2014.  M. Hardt and J. Ullman. 2014."},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. IEEE FOCS. 454\u2013463","unstructured":"Preventing false discovery in interactive data analysis is hard . In Proc. IEEE FOCS. 454\u2013463 . Preventing false discovery in interactive data analysis is hard. In Proc. IEEE FOCS. 454\u2013463."},{"key":"e_1_3_2_1_39_1","volume-title":"Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA). 1598\u20131611","author":"Harrow A.","unstructured":"A. Harrow , C. Lin , and A. Montanaro . 2017. Sequential measurements, disturbance and property testing . In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA). 1598\u20131611 . A. Harrow, C. Lin, and A. Montanaro. 2017. Sequential measurements, disturbance and property testing. In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA). 1598\u20131611."},{"key":"e_1_3_2_1_40_1","unstructured":"arXiv:1607.03236.  arXiv:1607.03236."},{"key":"e_1_3_2_1_41_1","volume-title":"Proc. of Neural Information Processing Systems (NIPS). arXiv:1806","author":"Nissim K.","unstructured":"K. Nissim , A. D. Smith , T. Steinke , U. Stemmer , and J. Ullman . 2018. The limits of post-selection generalization . In Proc. of Neural Information Processing Systems (NIPS). arXiv:1806 .06100. K. Nissim, A. D. Smith, T. Steinke, U. Stemmer, and J. Ullman. 2018. The limits of post-selection generalization. In Proc. of Neural Information Processing Systems (NIPS). arXiv:1806.06100."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897544"},{"key":"e_1_3_2_1_43_1","unstructured":"R. M. Rogers A. Roth A. D. Smith and O. Thakkar. 2016.  R. M. Rogers A. Roth A. D. Smith and O. Thakkar. 2016."},{"key":"e_1_3_2_1_44_1","volume-title":"Proc. IEEE FOCS. 487\u2013494","unstructured":"Max-information, differential privacy , and post-selection hypothesis testing . In Proc. IEEE FOCS. 487\u2013494 . Max-information, differential privacy, and post-selection hypothesis testing. In Proc. IEEE FOCS. 487\u2013494."},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of IEEE Africon. 1432\u20131435","author":"Senekane M.","unstructured":"M. Senekane , M. Mafu , and B. Taele . 2017. Privacy-preserving quantum machine learning using differential privacy . In Proceedings of IEEE Africon. 1432\u20131435 . M. Senekane, M. Mafu, and B. Taele. 2017. Privacy-preserving quantum machine learning using differential privacy. In Proceedings of IEEE Africon. 1432\u20131435."},{"key":"e_1_3_2_1_46_1","volume-title":"Proc. Info. Theory and Applications (ITA). 1\u201341","author":"Steinke T.","unstructured":"T. Steinke and J. Ullman . 2016. Interactive fingerprinting codes and the hardness of preventing false discovery . In Proc. Info. Theory and Applications (ITA). 1\u201341 . T. Steinke and J. Ullman. 2016. Interactive fingerprinting codes and the hardness of preventing false discovery. In Proc. Info. Theory and Applications (ITA). 1\u201341."},{"key":"e_1_3_2_1_47_1","unstructured":"J. Tang A. Korolova X. Bai X. Wang and X. Wang. 2017. Privacy loss in Apple\u2019s implementation of differential privacy on MacOS 10.12. (2017). arXiv:1709.02753.  J. Tang A. Korolova X. Bai X. Wang and X. Wang. 2017. Privacy loss in Apple\u2019s implementation of differential privacy on MacOS 10.12. (2017). arXiv:1709.02753."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/130928121"},{"key":"e_1_3_2_1_49_1","unstructured":"S. Vadhan. 2017.  S. Vadhan. 2017."},{"key":"e_1_3_2_1_50_1","volume-title":"Tutorials on the Foundations of Cryptography","unstructured":"The Complexity of Differential Privacy. In Tutorials on the Foundations of Cryptography , Y. Lindell (Ed.). Springer . The Complexity of Differential Privacy. In Tutorials on the Foundations of Cryptography, Y. Lindell (Ed.). Springer."},{"key":"e_1_3_2_1_51_1","unstructured":"privacytools.seas.harvard.edu\/files\/privacytools\/files\/complexityprivacy_1.pdf.  privacytools.seas.harvard.edu\/files\/privacytools\/files\/complexityprivacy_1.pdf."}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316378","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":51,"alternative-id":["10.1145\/3313276.3316378","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316378","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}