{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:54:20Z","timestamp":1765608860872,"version":"3.48.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032137135","type":"print"},{"value":"9783032137142","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-13714-2_14","type":"book-chapter","created":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:43:23Z","timestamp":1765608203000},"page":"208-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Randomness Efficient Algorithms for\u00a0Estimating Average Gate Fidelity via\u00a0k-Wise Classical and\u00a0Quantum Independence"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6056-3038","authenticated-orcid":false,"given":"Aditya","family":"Nema","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranab","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,14]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"S347","DOI":"10.1088\/1464-4266\/7\/10\/021","volume":"7","author":"C Emerson","year":"2005","unstructured":"Emerson, C., Alicki, R., \u017byczkowski, K.: Scalable noise estimation with random unitary operators. J. Opt. B: Quantum Semiclassical Opt. 7, S347\u2013S352 (2005)","journal-title":"J. Opt. B: Quantum Semiclassical Opt."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"012304","DOI":"10.1103\/PhysRevA.80.012304","volume":"80","author":"C Dankert","year":"2009","unstructured":"Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. A 80, 012304 (2009)","journal-title":"Phys. Rev. A"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1126\/science.1145699","volume":"317","author":"J Emerson","year":"2007","unstructured":"Emerson, J., et al.: Symmetrized characterization of noisy quantum processes. Science 317, 1893\u20131896 (2007)","journal-title":"Science"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 276\u2013287 (1994)","DOI":"10.1109\/SFCS.1994.365687"},{"issue":"2111","key":"14_CR5","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1098\/rspa.2009.0232","volume":"465","author":"R Low","year":"2009","unstructured":"Low, R.: Large deviation bounds for $$k$$-designs. Proc. Roy. Soc. A 465(2111), 3289\u20133308 (2009)","journal-title":"Proc. Roy. Soc. A"},{"key":"14_CR6","unstructured":"Sen, P. Efficient quantum tensor product expanders and unitary $$t$$-designs via the zigzag product. Arxiv:1808.10521 (2018)"},{"key":"14_CR7","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 4th edn. Wiley (2016)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"130502","DOI":"10.1103\/PhysRevLett.119.130502","volume":"119","author":"T Proctor","year":"2017","unstructured":"Proctor, T., Rudinger, K., Young, K., Sarovar, M., Blume-Kohout, R.: What randomized benchmarking actually measures. Phys. Rev. Lett. 119, 130502 (2017)","journal-title":"Phys. Rev. Lett."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"180504","DOI":"10.1103\/PhysRevLett.106.180504","volume":"106","author":"E Magesan","year":"2011","unstructured":"Magesan, E., Gambetta, J., Emerson, J.: Scalable and robust randomized benchmarking of quantum processes. Phys. Rev. Lett. 106, 180504 (2011)","journal-title":"Phys. Rev. Lett."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"042311","DOI":"10.1103\/PhysRevA.85.042311","volume":"85","author":"E Magesan","year":"2012","unstructured":"Magesan, E., Gambetta, J., Emerson, J.: Characterizing quantum gates via randomized benchmarking. Phys. Rev. A 85, 042311 (2012)","journal-title":"Phys. Rev. A"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"012309","DOI":"10.1103\/PhysRevA.84.012309","volume":"84","author":"E Magesan","year":"2011","unstructured":"Magesan, E., Blume-Kohout, R., Emerson, J.: Gate fidelity fluctuations and quantum process invariants. Phys. Rev. A 84, 012309 (2011)","journal-title":"Phys. Rev. A"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"032303","DOI":"10.1103\/PhysRevA.94.032303","volume":"94","author":"R Alexander","year":"2016","unstructured":"Alexander, R., Turner, P., Bartlett, S.: Randomized benchmarking in measurement-based quantum computing. Phys. Rev. A 94, 032303 (2016)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/18.985948","volume":"48","author":"D DiVincenzo","year":"2002","unstructured":"DiVincenzo, D., Leung, D., Terhal, B.: Quantum data hiding. IEEE Trans. Inf. Theory 48(3), 580\u2013599 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9 &10","key":"14_CR14","first-page":"0721","volume":"16","author":"R Cleve","year":"2016","unstructured":"Cleve, R., Leung, D., Liu, L., Wang, C.: Near-linear constructions of exact unitary $$2$$-designs. Quant. Inf. Comp. 16(9 &10), 0721\u20130756 (2016)","journal-title":"Quant. Inf. Comp."},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Rand. Struct. Alg. 3(3), 289\u2013304 (1992)","journal-title":"Rand. Struct. Alg."},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/S089548019223872X","volume":"8","author":"J Schmidt","year":"1995","unstructured":"Schmidt, J., Siegel, A., Srinivasan, A.: Chernoff-\u2013Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math. 8(2), 223\u2013250 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Fawzi, O., Hayden, P., Sen, P.: From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking. J. ACM. 60(6), 44:1\u201344:60 (2013)","DOI":"10.1145\/2518131"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Kitaev, A., Watrous, J.: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 608\u2013617 (2000)","DOI":"10.1145\/335305.335387"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Harrow, A., Hastings, J.: Classical and quantum tensor product expanders. Quant. Inf. and Comp. 9, 336:1\u2013336:18 (2009)","DOI":"10.26421\/QIC9.3-4-9"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Pseudorandom Generators: A Primer. University Lecture Serie, vol. 55. American Mathematical Society (2010)","DOI":"10.1090\/ulect\/055"},{"key":"14_CR21","volume-title":"High Dimensional Probability","author":"R Vershynin","year":"2018","unstructured":"Vershynin, R.: High Dimensional Probability. Cambridge University Press, Cambridge (2018)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Roth, I., et al.: Recovering quantum gates from few average gate fidelities. Phys. Rev. Lett. 121(17), 170502:1\u2013170502:8 (2018)","DOI":"10.1103\/PhysRevLett.121.170502"},{"issue":"5","key":"14_CR23","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P.: Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Mannalath, V., Mishra, S., Pathak, A.: A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness. Quantum Inf. Process. 22, 439:1\u2013439:44 (2023)","DOI":"10.1007\/s11128-023-04175-y"},{"key":"14_CR25","unstructured":"Knuth, D.: The Art of Computer Programming Vol 2: Seminumerical Algorithms. Addison-Wesley (1968)"}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13714-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:43:26Z","timestamp":1765608206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13714-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,14]]},"ISBN":["9783032137135","9783032137142"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13714-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,14]]},"assertion":[{"value":"14 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Systems Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iciss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iciss.isrdc.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}