Content deleted Content added
m →Further reading: opened the abbreviation. |
Rescuing 2 sources and tagging 0 as dead.) #IABot (v2.0.9.5) (Eastmain - 19231 |
||
Line 157:
His lambda-q calculus is powerful enough to express any quantum computation. However, this language can efficiently solve [[NP-complete]] problems, and therefore appears to be strictly stronger than the standard quantum computational models (such as the [[quantum Turing machine]] or the [[quantum circuit]] model). Therefore, Maymin's lambda-q calculus is probably not implementable on a physical device {{Citation needed|date=February 2019}}.
In 2003, André van Tonder defined an extension of the [[lambda calculus]] suitable for proving correctness of quantum programs. He also provided an implementation in the [[Scheme (programming language)|Scheme]] programming language.<ref>{{cite web |author=André van Tonder |title=A lambda calculus for quantum computation (website) |url=http://www.het.brown.edu/people/andre/qlambda |access-date=October 2, 2007 |archive-date=March 5, 2016 |archive-url=https://web.archive.org/web/20160305100936/http://www.het.brown.edu/people/andre/qlambda/ |url-status=dead }}</ref>
In 2004, Selinger and Valiron defined a [[strongly typed]] lambda calculus for quantum computation with a type system based on [[linear logic]].<ref>Peter Selinger, Benoˆıt Valiron, [https://www.mscs.dal.ca/~selinger/papers/qlambdabook.pdf "Quantum Lambda Calculus"]</ref>
Line 187:
* [https://quantiki.org/wiki/quantum-programming-language Quantum programming language] in [http://www.quantiki.org/ Quantiki]
* [https://github.com/lanl/qmasm/wiki QMASM documentation]
*[https://pyquil.readthedocs.io/en/stable/index.html pyQuil documentation] including [https://pyquil.readthedocs.io/en/stable/intro.html Introduction to Quantum Computing] {{Webarchive|url=https://web.archive.org/web/20180718165337/https://pyquil.readthedocs.io/en/stable/intro.html |date=July 18, 2018 }}
* [https://github.com/epiqc/ScaffCC Scaffold Source]
| |||