Content deleted Content added
m sorting the llist of Functional languages alphabetically |
m sorting the list of Quantum instruction sets alphabetically |
||
Line 12:
== Quantum instruction sets ==
Quantum instruction sets are used to turn higher level algorithms into physical instructions that can be executed on quantum processors. Sometimes these instructions are specific to a given hardware platform, e.g. [[ion trap]]s or [[Superconducting quantum computing|superconducting qubits]].
Blackbird<ref>{{Cite web|url=https://quantum-blackbird.readthedocs.io/en/latest/|title=Blackbird Quantum Assembly Language — Blackbird 0.2.0 documentation|website=quantum-blackbird.readthedocs.io|access-date=2019-06-24}}</ref><ref>{{Cite journal|last1=Weedbrook|first1=Christian|last2=Amy|first2=Matthew|last3=Bergholm|first3=Ville|last4=Quesada|first4=Nicolás|last5=Izaac|first5=Josh|last6=Killoran|first6=Nathan|date=2019-03-11|title=Strawberry Fields: A Software Platform for Photonic Quantum Computing|journal=Quantum|language=en-GB|volume=3|pages=129|doi=10.22331/q-2019-03-11-129|arxiv=1804.03159|bibcode=2019Quant...3..129K |s2cid=54763305}}</ref> is a quantum instruction set and intermediate representation used by [[Xanadu Quantum Technologies]] and Strawberry Fields. It is designed to represent [[Continuous-variable quantum information|continuous-variable]] quantum programs that can run on photonic quantum hardware.▼
=== cQASM ===
cQASM,<ref>{{Cite arXiv|last1=Bertels|first1=K.|last2=Almudever|first2=C. G.|last3=Hogaboam|first3=J. W.|last4=Ashraf|first4=I.|last5=Guerreschi|first5=G. G.|last6=Khammassi|first6=N.|date=2018-05-24|title=cQASM v1.0: Towards a Common Quantum Assembly Language|language=en|eprint=1805.09607v1|class=quant-ph}}</ref> also known as common QASM, is a hardware-agnostic quantum assembly language which guarantees the interoperability between all the quantum compilation and simulation tools. It was introduced by the QCA Lab at [[TUDelft]].
▲=== Quil ===
{{Main|Quil (instruction set architecture)}}▼
[[Quil (instruction set architecture)|Quil]] is an instruction set architecture for quantum computing that first introduced a shared quantum/classical memory model. It was introduced by Robert Smith, Michael Curtis, and William Zeng in ''A Practical Quantum Instruction Set Architecture''.<ref>{{cite arXiv |eprint=1608.03355 |title=A Practical Quantum Instruction Set Architecture |last1=Smith |first1=Robert S. |last2=Curtis |first2=Michael J. |last3=Zeng |first3=William J. |year=2016 |class=quant-ph }}</ref> Many quantum algorithms (including [[quantum teleportation]], [[quantum error correction]], simulation,<ref>{{Cite journal|last1=McClean|first1=Jarrod R.|last2=Romero|first2=Jonathan|last3=Babbush|first3=Ryan|last4=Aspuru-Guzik|first4=Alán|date=2016-02-04|title=The theory of variational hybrid quantum-classical algorithms|arxiv=1509.04279|journal=New Journal of Physics|volume=18|issue=2|pages=023023|doi=10.1088/1367-2630/18/2/023023|issn=1367-2630|bibcode=2016NJPh...18b3023M|s2cid=92988541}}</ref><ref>{{cite arXiv |eprint=1610.06910 |title=A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory |last1=Rubin |first1=Nicholas C. |last2=Curtis |first2=Michael J. |last3=Zeng |first3=William J. |year=2016 |class=quant-ph }}</ref> and optimization algorithms<ref>{{cite arXiv |eprint=1411.4028|title=A Quantum Approximate Optimization Algorithm|last1=Farhi|first1=Edward|last2=Goldstone|first2=Jeffrey|last3=Gutmann|first3=Sam|year=2014|class=quant-ph}}</ref>) require a shared memory architecture.▼
=== OpenQASM ===
Line 24 ⟶ 23:
[[OpenQASM]]<ref>{{Citation|title=qiskit-openqasm: OpenQASM specification|date=2017-07-04|url=https://github.com/IBM/qiskit-openqasm|publisher=International Business Machines|access-date=2017-07-06}}</ref> is the intermediate representation introduced by IBM for use with [[#Qiskit|Qiskit]] and the [[IBM Q Experience]].
===
▲{{Main|Quil (instruction set architecture)}}
▲Blackbird<ref>{{Cite web|url=https://quantum-blackbird.readthedocs.io/en/latest/|title=Blackbird Quantum Assembly Language — Blackbird 0.2.0 documentation|website=quantum-blackbird.readthedocs.io|access-date=2019-06-24}}</ref><ref>{{Cite journal|last1=Weedbrook|first1=Christian|last2=Amy|first2=Matthew|last3=Bergholm|first3=Ville|last4=Quesada|first4=Nicolás|last5=Izaac|first5=Josh|last6=Killoran|first6=Nathan|date=2019-03-11|title=Strawberry Fields: A Software Platform for Photonic Quantum Computing|journal=Quantum|language=en-GB|volume=3|pages=129|doi=10.22331/q-2019-03-11-129|arxiv=1804.03159|bibcode=2019Quant...3..129K |s2cid=54763305}}</ref> is a quantum instruction set and intermediate representation used by [[Xanadu Quantum Technologies]] and Strawberry Fields. It is designed to represent [[Continuous-variable quantum information|continuous-variable]] quantum programs that can run on photonic quantum hardware.
▲[[Quil (instruction set architecture)|Quil]] is an instruction set architecture for quantum computing that first introduced a shared quantum/classical memory model. It was introduced by Robert Smith, Michael Curtis, and William Zeng in ''A Practical Quantum Instruction Set Architecture''.<ref>{{cite arXiv |eprint=1608.03355 |title=A Practical Quantum Instruction Set Architecture |last1=Smith |first1=Robert S. |last2=Curtis |first2=Michael J. |last3=Zeng |first3=William J. |year=2016 |class=quant-ph }}</ref> Many quantum algorithms (including [[quantum teleportation]], [[quantum error correction]], simulation,<ref>{{Cite journal|last1=McClean|first1=Jarrod R.|last2=Romero|first2=Jonathan|last3=Babbush|first3=Ryan|last4=Aspuru-Guzik|first4=Alán|date=2016-02-04|title=The theory of variational hybrid quantum-classical algorithms|arxiv=1509.04279|journal=New Journal of Physics|volume=18|issue=2|pages=023023|doi=10.1088/1367-2630/18/2/023023|issn=1367-2630|bibcode=2016NJPh...18b3023M|s2cid=92988541}}</ref><ref>{{cite arXiv |eprint=1610.06910 |title=A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory |last1=Rubin |first1=Nicholas C. |last2=Curtis |first2=Michael J. |last3=Zeng |first3=William J. |year=2016 |class=quant-ph }}</ref> and optimization algorithms<ref>{{cite arXiv |eprint=1411.4028|title=A Quantum Approximate Optimization Algorithm|last1=Farhi|first1=Edward|last2=Goldstone|first2=Jeffrey|last3=Gutmann|first3=Sam|year=2014|class=quant-ph}}</ref>) require a shared memory architecture.
== Quantum software development kits ==
| |||