{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:09Z","timestamp":1740122529236,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T00:00:00Z","timestamp":1642118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T00:00:00Z","timestamp":1642118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1908730","1908730"],"award-info":[{"award-number":["1908730","1908730"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10623-021-01000-4","type":"journal-article","created":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T18:02:37Z","timestamp":1642183357000},"page":"2181-2204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate unitary 3-designs from transvection Markov chains"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7749-2168","authenticated-orcid":false,"given":"Xinyu","family":"Tan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2369-3159","authenticated-orcid":false,"given":"Narayanan","family":"Rengaswamy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2084-9717","authenticated-orcid":false,"given":"Robert","family":"Calderbank","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,14]]},"reference":[{"key":"1000_CR1","doi-asserted-by":"crossref","unstructured":"Brand\u00e3o F.G., Horodecki M.: Exponential quantum speed-ups are generic. Quantum Inf. Comput. 13(11\u201312), 901\u2013924 (2013) [Online]. Available: https:\/\/arxiv.org\/abs\/1010.3654.","DOI":"10.26421\/QIC13.11-12-1"},{"key":"1000_CR2","doi-asserted-by":"crossref","unstructured":"Calderbank R., Rains E., Shor P., Sloane N.: Quantum error correction via codes over GF(4). IEEE Trans. Inf. Theory 44(4), 1369\u20131387, (1998) [Online]. Available: https:\/\/arxiv.org\/abs\/quant-ph\/9608006.","DOI":"10.1109\/18.681315"},{"key":"1000_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623714","volume-title":"Designs, Graphs, Codes and their Links","author":"PJ Cameron","year":"1991","unstructured":"Cameron P.J., Van Lint J.H.: Designs, Graphs, Codes and their Links, vol. 3. Cambridge University Press, Cambridge (1991)."},{"key":"1000_CR4","doi-asserted-by":"crossref","unstructured":"Can T., Rengaswamy N., Calderbank R., Pfister H.D.: Kerdock codes determine unitary 2-designs. IEEE Trans. Inf. Theory 66(10), 6104\u20136120 (2020) [Online]. Available: http:\/\/arxiv.org\/abs\/1904.07842.","DOI":"10.1109\/TIT.2020.3015683"},{"issue":"4","key":"1000_CR5","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1109\/TIT.2005.844076","volume":"51","author":"HF Chau","year":"2005","unstructured":"Chau H.F.: Unconditionally secure key distribution in higher dimensions by depolarization. IEEE Trans. Inf. Theory 51(4), 1451\u20131468 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1000_CR6","doi-asserted-by":"crossref","unstructured":"Cleve R., Leung D., Liu L., Wang C.: Near-linear constructions of exact unitary 2-designs. Quantum Inf. Comput. 16(9\u201310), 0721\u20130756 (2016) [Online]. Available: https:\/\/arxiv.org\/pdf\/1501.04592.pdf.","DOI":"10.26421\/QIC16.9-10-1"},{"key":"1000_CR7","doi-asserted-by":"crossref","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(1), 012304 (2009) [Online]. Available: https:\/\/link.aps.org\/doi\/10.1103\/PhysRevA.80.012304.","DOI":"10.1103\/PhysRevA.80.012304"},{"issue":"3","key":"1000_CR8","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\u2013598 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1000_CR9","doi-asserted-by":"crossref","unstructured":"Emerson J., Alicki R.,\u017byczkowski K.: Scalable noise estimation with random unitary operators. J. Opt. B Quantum Semiclassical Opt. 7(10), S347\u2013S352 (2005) [Online]. Available: https:\/\/doi.org\/10.1088\/1464-4266\/7\/10\/021.","DOI":"10.1088\/1464-4266\/7\/10\/021"},{"key":"1000_CR10","unstructured":"Gottesman D.: An introduction to quantum error correction and fault-tolerant quantum computation. arXiv preprint (2009) [Online]. Available: http:\/\/arxiv.org\/abs\/0904.2557."},{"issue":"2","key":"1000_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"AR Hammons","year":"1994","unstructured":"Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J.A., Sol\u00e9 P.: The $$\\mathbb{Z}_4$$-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40(2), 301\u2013319 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1000_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00220-009-0873-6","volume":"291","author":"AW Harrow","year":"2009","unstructured":"Harrow A.W., Low R.A.: Random quantum circuits are approximate 2-designs. Commun. Math. Phys. 291(1), 257\u2013302 (2009).","journal-title":"Commun. Math. Phys."},{"key":"1000_CR13","doi-asserted-by":"crossref","unstructured":"Hayden P., Horodecki M., Winter A., Yard J.: A decoupling approach to the quantum capacity. Open Syst. Inf. Dynam. 15(1), 7\u201319 (2008) [Online]. Available: http:\/\/arxiv.org\/abs\/quant-ph\/0702005.","DOI":"10.1142\/S1230161208000043"},{"issue":"12","key":"1000_CR14","doi-asserted-by":"publisher","first-page":"122202","DOI":"10.1063\/1.4903507","volume":"55","author":"R Koenig","year":"2014","unstructured":"Koenig R., Smolin J.A.: How to efficiently select an arbitrary Clifford group element. J. Math. Phys. 55(12), 122202 (2014).","journal-title":"J. Math. Phys."},{"key":"1000_CR15","unstructured":"Kueng R., Zhu H., Gross D.: Distinguishing quantum states using Clifford orbits. arXiv preprint (2016) [Online]. Available: http:\/\/arxiv.org\/abs\/1609.08595."},{"key":"1000_CR16","unstructured":"Kueng R., Zhu H., Gross D.: Low rank matrix recovery from Clifford orbits (2016). arXiv preprint. http:\/\/arxiv.org\/abs\/1610.08070."},{"key":"1000_CR17","doi-asserted-by":"crossref","unstructured":"Linke N.M., Maslov D., Roetteler M., Debnath S., Figgatt C., Landsman K.A., Wright K., Monroe C.: Experimental comparison of two quantum computing architectures. Proc. Natl. Acad. Sci. 114(13), 3305\u20133310 (2017) [Online]. Available: https:\/\/www.pnas.org\/content\/114\/13\/3305\/.","DOI":"10.1073\/pnas.1618020114"},{"key":"1000_CR18","doi-asserted-by":"crossref","unstructured":"Magesan E., Gambetta J.M., Emerson J.: Characterizing quantum gates via randomized benchmarking. Phys. Rev. A 85(4), 042311 (2012) [Online]. Available: https:\/\/link.aps.org\/doi\/10.1103\/PhysRevA.85.042311.","DOI":"10.1103\/PhysRevA.85.042311"},{"key":"1000_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"RJ McEliece","year":"1987","unstructured":"McEliece R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic Publishers, Dordrecht (1987)."},{"key":"1000_CR20","doi-asserted-by":"crossref","unstructured":"Nakata Y., Hirche C., Morgan C., Winter A.: Unitary 2-designs from random X- and Z-diagonal unitaries. J. Math. Phys. 58(5), 052203 (2017) [Online]. Available: http:\/\/aip.scitation.org\/doi\/10.1063\/1.4983266.","DOI":"10.1063\/1.4983266"},{"key":"1000_CR21","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen M.A., Chuang I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)."},{"key":"1000_CR22","unstructured":"Rengaswamy N.: Classical coding approaches to quantum applications. Ph.D. dissertation, Duke University (2020) [Online] Available: http:\/\/arxiv.org\/abs\/2004.06834."},{"key":"1000_CR23","doi-asserted-by":"crossref","unstructured":"Rengaswamy N., Calderbank R., Kadhe S., Pfister H.D.: Synthesis of logical Clifford operators via symplectic geometry. In: Proc. IEEE Int. Symp. Inf. Theory, June, pp. 791\u2013795 (2018) [Online]. Available: http:\/\/arxiv.org\/abs\/1803.06987v1.","DOI":"10.1109\/ISIT.2018.8437652"},{"key":"1000_CR24","doi-asserted-by":"crossref","unstructured":"Rengaswamy N., Calderbank R., Kadhe S., Pfister H.D.: Logical Clifford synthesis for stabilizer codes. IEEE Trans. Quantum Eng. 1 (2020) [Online]. Available: http:\/\/arxiv.org\/abs\/1907.00310.","DOI":"10.1109\/TQE.2020.3023419"},{"key":"1000_CR25","doi-asserted-by":"crossref","unstructured":"Roy A., Scott A.J.: Unitary designs and codes. Des. Codes Cryptogr. 53(1), 13\u201331 (2009) [Online]. Available: http:\/\/link.springer.com\/10.1007\/s10623-009-9290-2.","DOI":"10.1007\/s10623-009-9290-2"},{"key":"1000_CR26","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1016\/j.laa.2008.02.029","volume":"429","author":"A Salam","year":"2008","unstructured":"Salam A., Al-Aidarous E., Farouk A.E.: Optimal symplectic householder transformations for SR decomposition. Linear Algebra Appl. 429, 1334\u20131353 (2008).","journal-title":"Linear Algebra Appl."},{"key":"1000_CR27","unstructured":"Singal T., Hsieh M.-H.: A possible improvement to the convergence analysis of the transvection Markov process. personal communication (2021)."},{"key":"1000_CR28","doi-asserted-by":"crossref","unstructured":"Szehr O., Dupuis F., Tomamichel M., Renner R.: Decoupling with unitary approximate two-designs. New J. Phys. 15(5), 053022 (2013) [Online]. Available: https:\/\/doi.org\/10.1088\/1367-2630\/15\/5\/053022.","DOI":"10.1088\/1367-2630\/15\/5\/053022"},{"key":"1000_CR29","doi-asserted-by":"crossref","unstructured":"Webb Z.: The Clifford group forms a unitary 3-design. Quantum Inf. Comput. 16(15\u201316), 1379\u20131400 (2016) [Online]. Available: https:\/\/arxiv.org\/pdf\/1510.02769.pdf.","DOI":"10.26421\/QIC16.15-16-8"},{"key":"1000_CR30","volume-title":"Quantum Information Theory","author":"MM Wilde","year":"2017","unstructured":"Wilde M.M.: Quantum Information Theory, 2nd edn Cambridge University Press, Cambridge (2017).","edition":"2"},{"key":"1000_CR31","doi-asserted-by":"crossref","unstructured":"Zhu H.: Multiqubit clifford groups are unitary 3-designs. Phys. Rev. A 96, 062336 (2017) [Online]. Available: https:\/\/link.aps.org\/doi\/10.1103\/PhysRevA.96.062336.","DOI":"10.1103\/PhysRevA.96.062336"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01000-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-01000-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01000-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T15:15:21Z","timestamp":1661613321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-01000-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,14]]},"references-count":31,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1000"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-01000-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,1,14]]},"assertion":[{"value":"30 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}