{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:27:41Z","timestamp":1778905661079,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[],"published-print":{"date-parts":[[2013,6,16]]},"DOI":"10.1145\/2491956.2462177","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T12:03:50Z","timestamp":1370952230000},"page":"333-342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":188,"title":["Quipper"],"prefix":"10.1145","author":[{"given":"Alexander S.","family":"Green","sequence":"first","affiliation":[{"name":"Dalhousie University, Halifax, NS, Canada"}]},{"given":"Peter LeFanu","family":"Lumsdaine","sequence":"additional","affiliation":[{"name":"Institute of Advanced Studies, Princeton, NJ, USA"}]},{"given":"Neil J.","family":"Ross","sequence":"additional","affiliation":[{"name":"Dalhousie University, Halifax, NS, Canada"}]},{"given":"Peter","family":"Selinger","sequence":"additional","affiliation":[{"name":"Dalhousie University, Halifax, NS, Canada"}]},{"given":"Beno\u00eet","family":"Valiron","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139193313.006"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/080712167"},{"key":"e_1_3_2_2_3_1","first-page":"661","volume-title":"Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science","author":"Childs A.","year":"2011","unstructured":"A. Childs and R. Kothari . Quantum query complexity of minor-closed graph properties . In Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science , pages 661 -- 672 , 2011 . A. Childs and R. Kothari. Quantum query complexity of minor-closed graph properties. In Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science, pages 661--672, 2011."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780552"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1985.0070"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129506005378"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206035.1206039"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"e_1_3_2_2_10_1","volume-title":"April","author":"Quantum Computer Science Program ARPA","year":"2010","unstructured":"I ARPA Quantum Computer Science Program . Broad Agency Announcement IARPA-BAA-10-02. Available from https:\/\/www.fbo.gov\/notices\/637e87ac1274d030ce2ab69339ccf93c , April 2010 . IARPA Quantum Computer Science Program. Broad Agency Announcement IARPA-BAA-10-02. Available from https:\/\/www.fbo.gov\/notices\/637e87ac1274d030ce2ab69339ccf93c, April 2010."},{"key":"e_1_3_2_2_11_1","unstructured":"S. Jordan. http:\/\/math.nist.gov\/quantum\/zoo\/. Electronic resource.  S. Jordan. http:\/\/math.nist.gov\/quantum\/zoo\/. Electronic resource."},{"key":"e_1_3_2_2_12_1","volume-title":"Conventions for quantum pseudocode. LANL report LAUR-96--2724","author":"Knill E. H.","year":"1996","unstructured":"E. H. Knill . Conventions for quantum pseudocode. LANL report LAUR-96--2724 , 1996 . E. H. Knill. Conventions for quantum pseudocode. LANL report LAUR-96--2724, 1996."},{"key":"e_1_3_2_2_13_1","volume-title":"Quantum algorithms for the triangle problem. quant-ph\/0310134","author":"Magniez F.","year":"2003","unstructured":"F. Magniez , M. Santha , and M. Szegedy . Quantum algorithms for the triangle problem. quant-ph\/0310134 , 2003 . F. Magniez, M. Santha, and M. Szegedy. Quantum algorithms for the triangle problem. quant-ph\/0310134, 2003."},{"key":"e_1_3_2_2_14_1","first-page":"1109","volume-title":"Proceedings of the 16th annual ACM-SIAM symposium on Discrete algorithms","author":"Magniez F.","year":"2005","unstructured":"F. Magniez , M. Santha , and M. Szegedy . Quantum algorithms for the triangle problem . In Proceedings of the 16th annual ACM-SIAM symposium on Discrete algorithms , pages 1109 -- 1117 , 2005 . F. Magniez, M. Santha, and M. Szegedy. Quantum algorithms for the triangle problem. In Proceedings of the 16th annual ACM-SIAM symposium on Discrete algorithms, pages 1109--1117, 2005."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_2_2_16_1","volume-title":"Quantum programming in QCL. Master's thesis","author":"\u00d6mer B.","year":"2000","unstructured":"B. \u00d6mer . Quantum programming in QCL. Master's thesis , Institute of Information Systems, Technical University of Vienna , 2000 . B. \u00d6mer. Quantum programming in QCL. Master's thesis, Institute of Information Systems, Technical University of Vienna, 2000."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703440678"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129506005238"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139193313.005"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/581690.581691"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703432165"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/00268976.2011.552441"}],"event":{"name":"PLDI '13: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Seattle Washington USA","acronym":"PLDI '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491956.2462177","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491956.2462177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:41Z","timestamp":1750217321000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491956.2462177"}},"subtitle":["a scalable quantum programming language"],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":22,"alternative-id":["10.1145\/2491956.2462177","10.1145\/2491956"],"URL":"https:\/\/doi.org\/10.1145\/2491956.2462177","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2499370.2462177","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}