{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:27:32Z","timestamp":1783610852517,"version":"3.55.0"},"reference-count":91,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"QICS - Quantum Information Center Sorbonne"},{"DOI":"10.13039\/100018703","name":"HORIZON EUROPE European Innovation Council","doi-asserted-by":"publisher","award":["899544"],"award-info":[{"award-number":["899544"]}],"id":[{"id":"10.13039\/100018703","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Sandoz Family Foundation-Monique de Meuron program for Academic Promotion"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tit.2025.3552671","type":"journal-article","created":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T17:33:20Z","timestamp":1742319200000},"page":"3675-3692","source":"Crossref","is-referenced-by-count":5,"title":["Quantum Differential Privacy in the Local Model"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-7643-2892","authenticated-orcid":false,"given":"Armando","family":"Angrisani","sequence":"first","affiliation":[{"name":"Institute of Physics, Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-6280-9604","authenticated-orcid":false,"given":"Elham","family":"Kashefi","sequence":"additional","affiliation":[{"name":"LIP6, CNRS, Sorbonne Université, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/18m120275x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316378"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585234"},{"key":"ref4","article-title":"Differential privacy amplification in quantum and quantum-inspired algorithms","author":"Angrisani","year":"2022","journal-title":"arXiv:2203.03604"},{"key":"ref5","article-title":"A unifying framework for differentially private quantum algorithms","author":"Angrisani","year":"2023","journal-title":"arXiv:2307.04733"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-023-00662-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2952146"},{"key":"ref8","first-page":"1","article-title":"Optimal algorithms for learning quantum phase states","volume-title":"Proc. 18th Conf. Theory Quantum Comput., Commun. Cryptogr. (TQC)","author":"Arunachalam"},{"key":"ref9","article-title":"Quantum statistical query learning","author":"Arunachalam","year":"2020","journal-title":"arXiv:2002.08240"},{"key":"ref10","first-page":"55064","article-title":"On the role of entanglement and statistics in learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Arunachalam"},{"key":"ref11","first-page":"20503","article-title":"Private learning implies quantum stability","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Arunachalam"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517999"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649619"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554816"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022316"},{"key":"ref16","article-title":"Scrambling speed of random quantum circuits","author":"Brown","year":"2012","journal-title":"arXiv:1210.6644"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-015-2470-1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/225298.225312"},{"key":"ref19","first-page":"1","article-title":"Classical verification of quantum learning","volume-title":"Proc. 15th Innov. Theor. Comput. Sci. Conf. (ITCS)","author":"Matthias"},{"issue":"3","key":"ref20","first-page":"1069","article-title":"Differentially private empirical risk minimization","volume":"12","author":"Chaudhuri","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","article-title":"An efficient and exact noncommutative quantum Gibbs sampler","author":"Chen","year":"2023","journal-title":"arXiv:2311.09207"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619433"},{"key":"ref23","first-page":"1310","article-title":"Certified adversarial robustness via randomized smoothing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cohen"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510000"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1162\/99608f92.d3197524"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-04940-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018325"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.4.010309"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.3.023153"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.53"},{"key":"ref31","article-title":"Local privacy, data processing inequalities, and statistical minimax rates","author":"Duchi","year":"2013","journal-title":"arXiv:1302.3203"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45727-3_25"},{"key":"ref33","first-page":"1693","article-title":"Privacy-preserving prediction","volume-title":"Proc. Conf. Learn. Theory","author":"Dwork"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988195"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-060116-054123"},{"key":"ref37","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014","journal-title":"arXiv:1411.4028"},{"key":"ref38","first-page":"1","article-title":"How to solve any protocol problem","volume-title":"Proc. STOC","author":"Goldreich"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-02-02-640"},{"key":"ref40","article-title":"Pauli path simulations of noisy quantum circuits beyond average case","author":"Gonz\u00e1lez-Garc\u00eda","year":"2024","journal-title":"arXiv:2407.16068"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-11-10-855"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00020"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-023-04675-z"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-0980-2"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF02100287"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1063\/1.4936215"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.130.240602"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-11-28-862"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3272904"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-024-05087-3"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-020-0932-7"},{"key":"ref52","first-page":"2879","article-title":"Extremal mechanisms for local differential privacy","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Kairouz"},{"key":"ref53","first-page":"2008","article-title":"Secure multi-party differential privacy","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Kairouz"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293351"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00044"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.110.L040403"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1063\/1.533053"},{"key":"ref59","article-title":"Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation","author":"Martinez","year":"2025","journal-title":"arXiv:2501.13050"},{"key":"ref60","article-title":"Noise-induced shallow circuits and absence of barren plateaus","author":"Mele","year":"2024","journal-title":"arXiv:2403.13927"},{"key":"ref61","first-page":"956","article-title":"Differential privacy without sensitivity","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Minami"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref63","article-title":"How to break anonymity of the Netflix prize dataset","author":"Narayanan","year":"2007","journal-title":"arXiv:cs\/0610105"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"},{"key":"ref66","article-title":"On the average-case complexity of learning output distributions of quantum circuits","author":"Nietner","year":"2023","journal-title":"arXiv:2305.05765"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3527859"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/18.887855"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-022-00666-5"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.220502"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-024-02536-7"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.22331\/q-2024-04-30-1319"},{"key":"ref75","article-title":"Efficient thermalization and universal quantum computing with quantum Gibbs samplers","author":"Rouz\u00e9","year":"2024","journal-title":"arXiv:2403.12691"},{"key":"ref76","article-title":"A polynomial-time classical algorithm for noisy quantum circuits","author":"Schuster","year":"2024","journal-title":"arXiv:2407.12768"},{"key":"ref77","article-title":"On the strong converses for the quantum channel capacity theorems","author":"Sharma","year":"2012","journal-title":"arXiv:1205.1712"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-021-01356-3"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21891-5"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-27045-6"},{"key":"ref82","first-page":"2493","article-title":"Privacy for free: Posterior sampling and stochastic gradient Monte Carlo","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"37","author":"Wang"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.2307\/2283137"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1017\/9781316848142"},{"key":"ref85","article-title":"From classical to quantum Shannon theory","author":"Wilde","year":"2011","journal-title":"arXiv:1106.1445"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139525343"},{"key":"ref87","first-page":"162","article-title":"How to generate and exchange secrets (extended abstract)","volume-title":"Proc. IEEE Symp. Found. Comput. Sci. (FOCS)","author":"Yao"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ada0f9"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174484"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.23"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx8\/18\/10975818\/10931036.pdf?arnumber=10931036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T05:26:52Z","timestamp":1745558812000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/10931036\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":91,"journal-issue":{"issue":"5"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tit.2025.3552671","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}