{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:10:24Z","timestamp":1765667424280,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031308284"},{"type":"electronic","value":"9783031308291"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T00:00:00Z","timestamp":1682035200000},"content-version":"vor","delay-in-days":110,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a first-order quantum programming language, named <jats:sc>foq<\/jats:sc>, whose terminating programs are reversible. We restrict <jats:sc>foq<\/jats:sc> to a strict and tractable subset, named <jats:sc>pfoq<\/jats:sc>, of terminating programs with bounded width, that provides a first programming language-based characterization of the quantum complexity class <jats:sc>fbqp<\/jats:sc>. We finally present a tractable semantics-preserving algorithm compiling a <jats:sc>pfoq<\/jats:sc> program to a quantum circuit of size polynomial in the number of input qubits.<\/jats:p>","DOI":"10.1007\/978-3-031-30829-1_8","type":"book-chapter","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T19:56:19Z","timestamp":1682020579000},"page":"156-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Programming Language Characterizing Quantum Polynomial Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9750-0460","authenticated-orcid":false,"given":"Emmanuel","family":"Hainry","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0601-5425","authenticated-orcid":false,"given":"Romain","family":"P\u00e9choux","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9886-8400","authenticated-orcid":false,"given":"M\u00e1rio","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,21]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. computational complexity 2(2), 97\u2013110 (Jun 1992). https:\/\/doi.org\/10.1007\/BF01201998.","DOI":"10.1007\/BF01201998."},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing 26(5), 1411\u20131473 (1997). https:\/\/doi.org\/10.1137\/S0097539796300921","DOI":"10.1137\/S0097539796300921"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Boykin, P.O., Mor, T., Pulver, M., Roychowdhury, V., Vatan, F.: On universal and fault-tolerant quantum computing (1999). https:\/\/doi.org\/10.48550\/ARXIV.QUANT-PH\/9906054","DOI":"10.48550\/ARXIV.QUANT-PH\/9906054"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Briegel, H.J., Browne, D.E., D\u00fcr, W., Raussendorf, R., Van\u00a0den Nest, M.: Measurement-based quantum computation. Nature Physics 5(1), 19\u201326 (2009). https:\/\/doi.org\/10.1038\/nphys1157","DOI":"10.1038\/nphys1157"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Dal Lago, U.: A short introduction to implicit computational complexity. In: ESSLLI 2010. pp. 89\u2013109 (2011). https:\/\/doi.org\/10.1007\/978-3-642-31485-8_3","DOI":"10.1007\/978-3-642-31485-8_3"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Dal Lago, U., Masini, A., Zorzi, M.: Quantum implicit computational complexity. Theoretical Computer Science 411(2), 377\u2013409 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2009.07.045","DOI":"10.1016\/j.tcs.2009.07.045"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Danos, V., Kashefi, E.: Determinism in the one-way model. Physical Review A 74(5), 052310 (2006). https:\/\/doi.org\/10.1103\/PhysRevA.74.052310","DOI":"10.1103\/PhysRevA.74.052310"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Deutsch, D.E.: Quantum computational networks. Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences 425(1868), 73\u201390 (1989)","DOI":"10.1098\/rspa.1989.0099"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Feynman, R.P.: Simulating physics with computers. International Journal of Theoretical Physics 21(6), 467\u2013488 (Jun 1982). https:\/\/doi.org\/10.1007\/BF02650179","DOI":"10.1007\/BF02650179"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"MacLane, S.: Categorical algebra. Bulletin of the American Mathematical Society 71(1), 40\u2013106 (1965). https:\/\/doi.org\/10.1090\/S0002-9904-1965-11234-4","DOI":"10.1090\/S0002-9904-1965-11234-4"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511976667"},{"key":"8_CR12","unstructured":"P\u00e9choux, R.: Implicit computational complexity: past and future. M\u00e9moire d\u2019habilitation \u00e1 diriger des recherches (2020), https:\/\/tel.archives-ouvertes.fr\/tel-02978986, universit\u00e9 de Lorraine"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Ross, N.J.: Algebraic and logical methods in quantum computation. PhD thesis (2015). https:\/\/doi.org\/10.48550\/ARXIV.1510.02198","DOI":"10.48550\/ARXIV.1510.02198"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Selinger, P.: Towards a quantum programming language. Mathematical Structures in Computer Science 14(4), 527\u2013586 (2004). https:\/\/doi.org\/10.1017\/S0960129504004256","DOI":"10.1017\/S0960129504004256"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science. pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Yamakami, T.: A schematic definition of quantum polynomial time computability. J. Symb. Log. 85(4), 1546\u20131587 (2020). https:\/\/doi.org\/10.1017\/jsl.2020.45","DOI":"10.1017\/jsl.2020.45"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Quantum circuit complexity. In: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science. pp. 352\u2013361 (1993). https:\/\/doi.org\/10.1109\/SFCS.1993.366852","DOI":"10.1109\/SFCS.1993.366852"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30829-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T19:57:11Z","timestamp":1682020631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30829-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031308284","9783031308291"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30829-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2023\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"85","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":"26","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":"31% - 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.1","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":"10","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)"}}]}}