Quil (instruction set architecture)

In the paper presented by Smith, Curtis and Zeng, Quil specifies the instruction set for a Quantum Abstract Machine (QAM,) akin to a Turing machine, yet more practical for accomplishing "real-world" tasks.[1] The state of the QAM can be represented as a 6-tuple ${\displaystyle (|\Psi \rangle ,C,G,G',P,\kappa )}$ where:

• ${\displaystyle |\Psi \rangle }$ is the (quantum) state of a fixed but arbitrary number of qubits ${\displaystyle N_{q}}$ indexed using a 0-based indexing.
• ${\displaystyle C}$ is a classical memory of a number ${\displaystyle N_{c}}$ of classical bits indexed using a 0-based indexing.
• ${\displaystyle G}$ a fixed but arbitrary list of static gates (quantum gates that do not depend on parameters like the Hadamard gate.)
• ${\displaystyle G'}$ a fixed but arbitrary list of parametric gates (gates that depend on a number of complex parameters like the phase shift gate that requires an angle parameter to be completely defined.)
• ${\displaystyle P}$ a sequence of Quil instructions to be executed, representing the program. The length of ${\displaystyle P}$ is denoted by ${\displaystyle |P|}$.
• ${\displaystyle \kappa }$ an integer program counter pointing to the next instruction to be executed. ${\displaystyle \kappa }$ always starts at 0 (pointing to the ${\displaystyle 0^{th}}$ instruction) and ends at ${\displaystyle |P|}$ indicating program halting (note that the last instruction has the index ${\displaystyle |P|-1}$.) The program counter is incremented after every instruction, except for special control flow instructions (conditional and unconditional jumps, and the special HALT instruction that halts the program by setting ${\displaystyle \kappa }$ to ${\displaystyle |P|}$.

The semantics of the QAM are defined using tensor products of Hilbert spaces and the linear maps between them.[1]

Quil has support for defining possibly parametrized gates in matrix form (the language does not include a way to verify that the matrices are unitary, which is a necessary condition for the physical realizability of the defined gate) and their application on qubits. The language also supports macro-like definitions of possibly parametrized quantum circuits and their expansion, qubit measurement and recording of the outcome in classical memory, synchronization with classical computers with the WAIT instruction which pauses the execution of a Quil program until a classical program has ended its execution, conditional and unconditional branching, pragma support, as well as inclusion of files for use as libraries (a standard set of gates is provided as one of the libraries.)

Rigetti Computing developed a Quantum Virtual Machine in Common Lisp that simulates the defined Quantum Abstract Machine on a classical computer and is capable of the parsing and execution of Quil programs with possibly remote execution via HTTP.[9]

The following example demonstrates the classical control flow needed to do quantum teleportation of the qubit in register 2 to register 1:[10][11]

# Declare classical memory
DECLARE ro BIT[2]
# Create Bell Pair
H 0
CNOT 0 1
# Teleport
CNOT 2 0
H 2
MEASURE 2 ro[0]
MEASURE 0 ro[1]
# Classically communicate measurements
JUMP-UNLESS @SKIP ro[1]
X 1
LABEL @SKIP
JUMP-UNLESS @END ro[0]
Z 1
LABEL @END

Examples of the implementations of the quantum fourier transform and the variational quantum Eigensolver are given in the paper.