@inproceedings{Green2013,
  title         = {Quipper: {{A Scalable Quantum Programming Language}}},
  shorttitle    = {Quipper},
  author        = {Green, Alexander S. and Lumsdaine, Peter LeFanu and Ross, Neil J. and Selinger, Peter and Valiron, Beno{\^i}t},
  year          = {2013},
  month         = jun,
  booktitle     = {Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation},
  publisher     = acm,
  address       = {{New York, NY, USA}},
  series        = {{{PLDI}} '13},
  pages         = {333--342},
  doi           = {10.1145/2491956.2462177},
  archiveprefix = {arXiv},
  eprint        = {1304.3390},
  abstract      = {The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.},
  keywords      = {quipper, quantum programming languages},
  bibsource     = qplbib
}

{"_id":"jioMyCk3dcwe3e4C9","bibbaseid":"green-lumsdaine-ross-selinger-valiron-quipperascalablequantumprogramminglanguage-2013","authorIDs":[],"author_short":["Green, A. S.","Lumsdaine, P. L.","Ross, N. J.","Selinger, P.","Valiron, B."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Quipper: A Scalable Quantum Programming Language","shorttitle":"Quipper","author":[{"propositions":[],"lastnames":["Green"],"firstnames":["Alexander","S."],"suffixes":[]},{"propositions":[],"lastnames":["Lumsdaine"],"firstnames":["Peter","LeFanu"],"suffixes":[]},{"propositions":[],"lastnames":["Ross"],"firstnames":["Neil","J."],"suffixes":[]},{"propositions":[],"lastnames":["Selinger"],"firstnames":["Peter"],"suffixes":[]},{"propositions":[],"lastnames":["Valiron"],"firstnames":["Benoît"],"suffixes":[]}],"year":"2013","month":"June","booktitle":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","publisher":"Association for Computing Machinery","address":"New York, NY, USA","series":"PLDI '13","pages":"333–342","doi":"10.1145/2491956.2462177","archiveprefix":"arXiv","eprint":"1304.3390","abstract":"The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.","keywords":"quipper, quantum programming languages","bibsource":"Quantum Programming Languages & Verification Bibliography, https://git.io/qpl-bib","bibtex":"@inproceedings{Green2013,\n title = {Quipper: {{A Scalable Quantum Programming Language}}},\n shorttitle = {Quipper},\n author = {Green, Alexander S. and Lumsdaine, Peter LeFanu and Ross, Neil J. and Selinger, Peter and Valiron, Beno{\\^i}t},\n year = {2013},\n month = jun,\n booktitle = {Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation},\n publisher = acm,\n address = {{New York, NY, USA}},\n series = {{{PLDI}} '13},\n pages = {333--342},\n doi = {10.1145/2491956.2462177},\n archiveprefix = {arXiv},\n eprint = {1304.3390},\n abstract = {The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.},\n keywords = {quipper, quantum programming languages},\n bibsource = qplbib\n}\n\n","author_short":["Green, A. S.","Lumsdaine, P. L.","Ross, N. J.","Selinger, P.","Valiron, B."],"key":"Green2013","id":"Green2013","bibbaseid":"green-lumsdaine-ross-selinger-valiron-quipperascalablequantumprogramminglanguage-2013","role":"author","urls":{},"keyword":["quipper","quantum programming languages"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/QuantumPL/bib/main/bbt.bib","creationDate":"2020-05-31T17:07:22.808Z","downloads":0,"keywords":["quipper","quantum programming languages"],"search_terms":["quipper","scalable","quantum","programming","language","green","lumsdaine","ross","selinger","valiron"],"title":"Quipper: A Scalable Quantum Programming Language","year":2013,"dataSources":["Z5Dp3qAJiMzxtvKMq","JG9W34HAXfSxsC6ML","MbqeeC74KZhwBpe8j"]}