{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T01:47:58Z","timestamp":1790041678045,"version":"4.0.1"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2015,7,23]],"date-time":"2015-07-23T00:00:00Z","timestamp":1437609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2015,7,23]]},"abstract":"<jats:p>The Quipper language offers a unified general-purpose programming framework for quantum computation.<\/jats:p>","DOI":"10.1145\/2699415","type":"journal-article","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T13:33:00Z","timestamp":1438003980000},"page":"52-61","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Programming the quantum future"],"prefix":"10.1145","volume":"58","author":[{"given":"Beno\u00eet","family":"Valiron","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris Sud, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neil J.","family":"Ross","sequence":"additional","affiliation":[{"name":"Dalhousie University, Halifax, Nova Scotia, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Selinger","sequence":"additional","affiliation":[{"name":"Dalhousie University, Halifax, Nova Scotia, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D. Scott","family":"Alexander","sequence":"additional","affiliation":[{"name":"Applied Communication Science, Basking Ridge, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan M.","family":"Smith","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,7,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/080712167"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjd\/e2003-00242-2"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 16th Annual IEEE Conference on Computational Complexity","author":"Burham H.","year":"2001","unstructured":"Burham , H. , Durr , C. , Heiligman , M. , Hoyer , P. , Magniez , F. , Santha , M. , and de Wolf , R. Quantum algorithms for element distinctness . In Proceedings of the 16th Annual IEEE Conference on Computational Complexity ( Chicago, June 18--21). IEEE Computer Society Press , 2001 , 131--137. Burham, H., Durr, C., Heiligman, M., Hoyer, P., Magniez, F., Santha, M., and de Wolf, R. Quantum algorithms for element distinctness. In Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, June 18--21). IEEE Computer Society Press, 2001, 131--137."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780552"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129506005378"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2605205"},{"key":"e_1_2_1_7_1","volume-title":"Semantic Techniques in Quantum Computation","author":"Green A.","year":"2009","unstructured":"Green , A. and Altenkirch , T . The quantum IO monad . In Semantic Techniques in Quantum Computation , S. Gay and I. Mackie, Eds. Cambridge University Press , Cambridge, U.K. , 2009 , 173--205. Green, A. and Altenkirch, T. The quantum IO monad. In Semantic Techniques in Quantum Computation, S. Gay and I. Mackie, Eds. Cambridge University Press, Cambridge, U.K., 2009, 173--205."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206035.1206039"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"e_1_2_1_10_1","unstructured":"IARPA Quantum Computer Science Program. Broad Agency Announcement IARPA-BAA-10-02 Apr. 2010; https:\/\/www.fbo.gov\/notices\/637e87ac1274d030ce2ab69339ccf93c  IARPA Quantum Computer Science Program. Broad Agency Announcement IARPA-BAA-10-02 Apr. 2010; https:\/\/www.fbo.gov\/notices\/637e87ac1274d030ce2ab69339ccf93c"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/050643684"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2494568"},{"key":"e_1_2_1_14_1","volume-title":"Quantum Programming in QCL. Master's Thesis","author":"\u00d6mer B.","year":"2000","unstructured":"\u00d6mer , B. Quantum Programming in QCL. Master's Thesis . Institute of Information Systems, Technical University of Vienna , Vienna, Austria , 2000 ; tph.tuwien.ac.at\/~oemer\/qcl.html \u00d6mer, B. Quantum Programming in QCL. Master's Thesis. Institute of Information Systems, Technical University of Vienna, Vienna, Austria, 2000; tph.tuwien.ac.at\/~oemer\/qcl.html"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703440678"},{"key":"e_1_2_1_16_1","series-title":"Lecture Notes in Computer Science (Ponte de Lima","volume-title":"Proceedings of the Fifth International Conference on Mathematics of Program Construction","author":"Sanders J.W.","year":"2000","unstructured":"Sanders , J.W. and Zuliani , P . Quantum programming . In Proceedings of the Fifth International Conference on Mathematics of Program Construction , Vol. 1837 of Lecture Notes in Computer Science (Ponte de Lima , Portugal, July 3--5). Springer-Verlag , Berlin Heidelberg, 2000 , 80--99. Sanders, J.W. and Zuliani, P. Quantum programming. In Proceedings of the Fifth International Conference on Mathematics of Program Construction, Vol. 1837 of Lecture Notes in Computer Science (Ponte de Lima, Portugal, July 3--5). Springer-Verlag, Berlin Heidelberg, 2000, 80--99."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129506005238"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703432165"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/00268976.2011.552441"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2699415","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2699415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:58Z","timestamp":1750227418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2699415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,23]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,7,23]]}},"alternative-id":["10.1145\/2699415"],"URL":"https:\/\/doi.org\/10.1145\/2699415","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,23]]},"assertion":[{"value":"2015-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}