{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:29Z","timestamp":1780711409562,"version":"3.54.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030524814","type":"print"},{"value":"9783030524821","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52482-1_11","type":"book-chapter","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T16:03:46Z","timestamp":1594224226000},"page":"189-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Quantum CNOT Circuits Synthesis for NISQ Architectures Using the Syndrome Decoding Problem"],"prefix":"10.1007","author":[{"given":"Timoth\u00e9e Goubault","family":"de Brugi\u00e8re","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Baboulin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Beno\u00eet","family":"Valiron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Martiel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cyril","family":"Allouche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"issue":"10","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10), 1476\u20131489 (2014)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"015002","DOI":"10.1088\/2058-9565\/aad8ca","volume":"4","author":"M Amy","year":"2018","unstructured":"Amy, M., Azimzadeh, P., Mosca, M.: On the controlled-NOT complexity of controlled-NOT-phase circuits. Quantum Sci. Technol. 4(1), 015002 (2018)","journal-title":"Quantum Sci. Technol."},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S Arora","year":"1997","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54(2), 317\u2013331 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., Van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-12929-2_6","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2010","unstructured":"Bernstein, D.J.: Grover vs.\u00a0McEliece. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 73\u201380. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12929-2_6"},{"issue":"4","key":"11_CR6","first-page":"041021","volume":"2","author":"ET Campbell","year":"2012","unstructured":"Campbell, E.T., Anwar, H., Browne, D.E.: Magic-state distillation in all prime dimensions using quantum Reed-Muller codes. Phys. Rev. X 2(4), 041021 (2012)","journal-title":"Phys. Rev. X"},{"issue":"7671","key":"11_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1038\/nature23460","volume":"549","author":"ET Campbell","year":"2017","unstructured":"Campbell, E.T., Terhal, B.M., Vuillot, C.: Roads towards fault-tolerant universal quantum computation. Nature 549(7671), 172\u2013179 (2017)","journal-title":"Nature"},{"key":"11_CR8","unstructured":"Childs, A.M., Schoute, E., Unsal, C.M.: Circuit transformations for quantum architectures. In: 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019). LIPIcs, vol. 135, pp. 3:1\u20133:24 (2019)"},{"key":"11_CR9","unstructured":"Cowtan, A., Dilkes, S., Duncan, R., Krajenbrink, A., Simmons, W., Sivarajah, S.: On the qubit routing problem. In: 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019). LIPIcs, vol. 135, pp. 5:1\u20135:32 (2019)"},{"key":"11_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co (1979)"},{"key":"11_CR11","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)"},{"key":"11_CR12","unstructured":"Gottesman, D.: Stabilizer Codes and Quantum Error Correction. Ph.D. thesis, Caltech (1997)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"015004","DOI":"10.1088\/2058-9565\/aad604","volume":"4","author":"LE Heyfron","year":"2019","unstructured":"Heyfron, L.E., Campbell, E.T.: An efficient quantum compiler that reduces T count. Quantum Sci. Technol. 4(1), 015004 (2019)","journal-title":"Quantum Sci. Technol."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-59879-6_5","volume-title":"Post-Quantum Cryptography","author":"G Kachigar","year":"2017","unstructured":"Kachigar, G., Tillich, J.-P.: Quantum information set decoding algorithms. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 69\u201389. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59879-6_5"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-319-79063-3_24","volume-title":"Post-Quantum Cryptography","author":"E Kirshanova","year":"2018","unstructured":"Kirshanova, E.: Improved quantum information set decoding. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 507\u2013527. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-79063-3_24"},{"key":"11_CR16","unstructured":"Kissinger, A.: PyZX. \nhttps:\/\/github.com\/Quantomatic\/pyzx"},{"key":"11_CR17","unstructured":"Kissinger, A., van de Griend, A.M.: CNOT circuit extraction for topologically-constrained quantum memories (2019). \narXiv:1904.00633"},{"key":"11_CR18","unstructured":"Kissinger, A., van de Wetering, J.: Reducing T-count with the ZX-calculus (2019), draft available as \narXiv:1903.10477"},{"issue":"2\u20133","key":"11_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"RE Korf","year":"1990","unstructured":"Korf, R.E.: Real-time heuristic search. Artif. Intell. 42(2\u20133), 189\u2013211 (1990)","journal-title":"Artif. Intell."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Li, G., Ding, Y., Xie, Y.: Tackling the qubit mapping problem for NISQ-era quantum devices. In: International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 1001\u20131014 (2019)","DOI":"10.1145\/3297858.3304023"},{"issue":"13\u201314","key":"11_CR21","first-page":"1096","volume":"16","author":"D Maslov","year":"2016","unstructured":"Maslov, D.: Optimal and asymptotically optimal NCT reversible circuits by the gate types. Quantum Inf. Comput. 16(13\u201314), 1096\u20131112 (2016)","journal-title":"Quantum Inf. Comput."},{"key":"11_CR22","unstructured":"Nash, B., Gheorghiu, V., Mosca, M.: Quantum circuit optimizations for NISQ architectures (2019). \narXiv:1904.01972"},{"issue":"3","key":"11_CR23","first-page":"282","volume":"8","author":"KN Patel","year":"2008","unstructured":"Patel, K.N., Markov, I.L., Hayes, J.P.: Optimal synthesis of linear reversible circuits. Quantum Inf. Comput. 8(3), 282\u2013294 (2008)","journal-title":"Quantum Inf. Comput."},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MCAS.2016.2549950","volume":"16","author":"M Pedram","year":"2016","unstructured":"Pedram, M., Shafaei, A.: Layout optimization for quantum circuits with linear nearest neighbor architectures. IEEE Circuits Syst. Mag. 16(2), 62\u201374 (2016)","journal-title":"IEEE Circuits Syst. Mag."},{"issue":"5","key":"11_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theor. 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theor."},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Vardy, A.: Algorithmic complexity in coding theory and the minimum distance problem. In: Symposium on Theory of Computing, pp. 92\u2013109. ACM (1997)","DOI":"10.1145\/258533.258559"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Wille, R., Keszocze, O., Walter, M., Rohrs, P., Chattopadhyay, A., Drechsler, R.: Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In: Asia and South Pacific Design Automation Conference, pp. 292\u2013297. IEEE (2016)","DOI":"10.1109\/ASPDAC.2016.7428026"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52482-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T17:07:04Z","timestamp":1594228024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52482-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030524814","9783030524821"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52482-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.revcomp.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}