File Structure

A Q# file consists of a sequence of namespace declarations. Each namespace declaration contains declarations for user-defined types, operations, and functions. A namespace declaration may contain any number of each type of declaration, and in any order. The only text that can appear outside of a namespace declaration is comments. In particular, documentation comments for a namespace precede the declaration.

Namespace Declarations

A Q# file will typically have exactly one namespace declaration, but may have none (and be empty or just contain comments) or may contain multiple namespaces. Namespace declarations may not be nested.

The same namespace may be declared in multiple Q# files that are compiled together, as long as there are no type, operation, or function declarations with the same name. In particular, it is invalid to define the same type in the same namespace in multiple files, even if the declarations are identical.

A namespace declaration consists of the keyword namespace, followed by the name of the namespace, an open brace {, the declarations contained in the namespace, and a close brace }. Namespace names follow the .NET pattern of a sequence of one or more legal symbols separated by periods .. For instance, MyQuantumStuff and Microsoft.Quantum.Canon are valid namespace names. By convention, the symbols in a namespace name are capitalized, but this is not required.

Declarations may appear in any order in a namespace declaration. References to types or callables declared further down in a file are resolved properly; there is no need for the type, operation, or function declaration to precede a reference to it.

Open Directives

Within a namespace block, the open directive may be used to import all types and callables defined in a certain namespace and refer to them by their unqualified name.

Such an open directive consists of the open keyword, followed by the namespace to be opened and a terminating semicolon.

For instance,

open Microsoft.Quantum.Canon;


Optionally, a short name for the opened namespace may be defined such that all elements from that namespace can (and need) to be qualified by the defined short name. Such a short name is defined by adding the keyword as followed by the desired short name before the semicolon in an open directive:

open Microsoft.Quantum.Math as Math;


All open directives must appear before any function, operation, or newtype declarations in the namespace block. The open directive applies to the entire namespace block within a file.

User-Defined Type Declarations

Q# provides a way for users to declare new user-defined types, as described in the Q# type model section. User-defined types are distinct even if the base types are identical. In particular, there is no automatic conversion between values of two user-defined types even if the underlying types are identical.

A user-defined type declaration consists of the keyword newtype, followed by the name of the user-defined type, an =, a valid type specification, and a terminating semicolon.

For example:

newtype PairOfInts = (Int, Int);


Each Q# source file may declare any number of user-defined types. Type names must be unique within a namespace and may not conflict with operation and function names.

It is not possible to define circular dependencies between user defined types. Recursive types are thus not possible within Q#.

Operation Declarations

Operations are the core of Q#, roughly analogous to functions in other languages. Each Q# source file may define any number of operations.

Operation names must be unique within a namespace and may not conflict with type and function names.

An operation declarations consists of the keyword operation, followed by the symbol that is the operation’s name, a typed identifier tuple that defines the arguments to the operation, a colon :, a type annotation that describes the operation’s result type, optionally an annotation with the operation characteristics, an open brace {, the body of the operation declaration, and a final closing brace }.

The body of the operation declaration either consists of the default implementation or of a list of specializations. The default implementation can be specified directly within the declaration if only the implementation of the default body specialization needs to specified explicitly. In this case, an annotation with the operation characteristics in the declaration is useful to ensure that the compiler auto-generates other specializations based on the default implementation.

For example

operation PrepareEntangledPair(here : Qubit, there : Qubit) : Unit
is Adj + Ctl { // implies the existence of an adjoint, a controlled, and a controlled adjoint specialization
H(here);
CNOT(here, there);
}


Operation characteristics define what kinds of functors can be applied to the declared operation, and what effect they have. If an operation implements a unitary transformation, then it is possible to define how the operation acts when adjointed or controlled. The existence of these specializations can be declared as part of the operation signature. The corresponding implementation for each such implicitly declared specialization is then generated by the compiler. In the example above, an adjoint, a controlled, and a controlled adjoint specialization are generated by the compiler.

In the case where the implementation cannot be generated by the compiler, it can be explicitly specified. Such explicit specialization declarations can either consist of a suitable generation directive that clarify how a certain specialization is to be built, or a user defined implementation. The code in PrepareEntangledPair above for example is equivalent to the code below containing explicit specialization declarations:

operation PrepareEntangledPair(here : Qubit, there : Qubit) : Unit {
body (...) { // default body specialization
H(here);
CNOT(here, there);
}

controlled auto; // auto-generate controlled specialization
}


The keyword auto indicates that the compiler should determine how to generate the specialization implementation. If the compiler cannot generate the implementation for a certain specialization without further instructions - like a more precise generation directive -, or if a more efficient implementation can be given, then the implementation may also be manually defined.

operation PrepareEntangledPair(here : Qubit, there : Qubit) : Unit
body (...) { // default body specialization
H(here);
CNOT(here, there);
}

controlled (cs, ...) { // user defined implementation for the controlled specialization
Controlled H(cs, here);
Controlled X(cs + [here], there);
}

}


In the example above, adjoint invert; indicates that the adjoint specialization is to be generated by inverting the body implementation, and controlled adjoint invert; indicates that the controlled adjoint specialization is to be generated by inverting the given implementation of the controlled specialization.

For an operation to support application of the Adjoint and/or Controlled functor, its return type necessarily needs to be Unit.

Explicit Specialization Declarations

Q# operations may contain the following explicit specialization declarations:

• The body specialization specifies the implementation of the operation with no functors applied.
• The adjoint specialization specifies the implementation of the operation with the Adjoint functor applied.
• The controlled specialization specifies the implementation of the operation with the Controlled functor applied.
• The controlled adjoint specialization specifies the implementation of the operation with both the Adjoint and Controlled functors applied. This specialization can also be named adjoint controlled, since the two functors commute.

An operation specialization consists of the specialization tag (like e.g. body, or adjoint, etc.) followed by one of:

• An explicit declaration as described below.
• A directive that tells the compiler how to generate the specialization, one of:
• intrinsic, which indicates that the specialization is provided by the target machine.
• distribute, which may be used with the controlled and controlled adjoint specializations. When used with controlled, it indicates that the compiler should compute the specialization by applying Controlled to all of the operations in the body. When used with controlled adjoint, it indicates that the compiler should compute the specialization by applying Controlled to all of the operations in the adjoint specialization.
• invert, which indicates that the compiler should compute the adjoint specialization by inverting the body, i.e. reversing the order of operations and applying the adjoint to each one. When used with adjoint controlled, this indicates that the compiler should compute the specialization by inverting the controlled specialization.
• self, to indicate that the adjoint specialization is the the same as the body specialization. This is legal for the adjoint and adjoint controlled specializations. For adjoint controlled, self implies that the adjoint controlled specialization is the same as the controlled specialization.
• auto, to indicate that the compiler should select an appropriate directive to apply. auto may not be used for the body specialization.

The directives and auto all require a closing semi-colon ;. The auto directive resolves to the following generation directive if an explicit declaration of the body is provided:

• The adjoint specialization is generated according to the directive invert.
• The controlled specialization is generated according to the directive distribute.
• The adjoint controlled specialization is generated according to the directive invert if an explicit declaration for controlled is given but not one for adjoint, and distribute otherwise.

Tip

If an operation is self-adjoint, explicitly specify either the adjoint or the controlled adjoint specialization via the generation directive self to allow the compiler to make use of that information for optimization purposes.

A specialization declaration containing a user defined implementation consists of an argument tuple followed by a statement block with the Q# code that implements the specialization. In the argument list, ... is used to represent the arguments declared for the operation as a whole. For body and adjoint, the argument list should always be (...); for controlled and adjoint controlled, the argument list should be a symbol that represents the array of control qubits, followed by ..., enclosed in parentheses; for example, (controls,...).

If one or more specializations besides the default body need to be explicitly declared, then the implementation for the default body needs to be wrapped into a suitable specialization declaration as well:

operation CountOnes(qs: Qubit[]) : Int {

body (...) // default body specialization
{
mutable n = 0;
for (q in qs) {
set n += M(q) == One ? 1 | 0;
}
return n;
}

...


The adjoint of an operation specifies how the complex conjugate transpose of the operation is implemented, i.e. how the operation acts when "run in reverse". It is legal to specify an operation with no adjoint; for instance, measurement operations have no adjoint because they are not invertible. An operation supports the Adjoint functor if its declaration contains an implicit or explicit declaration of an adjoint specialization. An explicitly declared controlled adjoint specialization implies the existence of an adjoint specialization.

For operation whose body contains repeat-until-success loops, set statements, measurements, return statements, or calls to other operations that do not support the Adjoint functor, auto-generating an adjoint specialization following the invert or auto directive is not possible.

Controlled

The controlled version of an operation specifies how a quantum-controlled version of the operation is implemented, i.e. how an operation acts when applied conditioned on the state of a quantum register. A more complete description is provided in the Controlled section.

It is legal to specify an operation with no controlled version; for instance, measurement operations have no controlled version because they are not controllable. An operation supports the Controlled functor if and only if its declaration contains an implicit or explicit declaration of a controlled specialization. An explicitly declared controlled adjoint specialization implies the existence of a controlled specialization.

For an operation whose body contains calls to other operations that does not support the Controlled functor, auto-generating a controlled specialization following the distribute or auto directive is not possible.

The controlled adjoint version of an operation specifies how a quantum-controlled version of the adjoint of the operation is implemented. It is legal to specify an operation with no controlled adjoint version; for instance, measurement operations have no controlled adjoint version because they are neither controllable nor invertible.

A controlled adjoint specialization for an operation needs to exist if and only if both an adjoint and a controlled specialization exist. In that case, the existence of the controlled adjoint specialization is inferred and an appropriate specialization is generated by the compiler if no implementation has been defined explicitly.

For an operation whose body contains calls to other operations that do not have a controlled adjoint version, auto-generating an adjoint specialization following the invert, distribute or auto directive is not possible.

Examples

An operation declaration might be as simple as the following, which defines the primitive Pauli X operation:

operation X (q : Qubit) : Unit
body intrinsic;
}


The following defines the teleport operation.

// Entangle two qubits.
// Assumes that both qubits are in the |0> state.
operation EPR (q1 : Qubit, q2 : Qubit) : Unit
H(q2);
CNOT(q2, q1);
}

// Teleport the quantum state of the source to the target.
// Assumes that the target is in the |0> state.
operation Teleport (source : Qubit, target : Qubit) : Unit {

// Get a temporary for the Bell pair
using (ancilla = Qubit())
{
// Create a Bell pair between the temporary and the target
EPR(target, ancilla);

// Do the teleportation

if (MResetZ(source) == One) {
X(target);
}
if (MResetZ(ancilla) == One) {
Z(target);
}
}
}


Function Declarations

Functions are purely classical routines in Q#. Each Q# source file may define any number of functions.

A function declaration consists of the keyword function, followed by the symbol that is the function’s name, a typed identifier tuple, a type annotation that describes the function's return type, and a statement block that describes the implementation of the function.

The statement block defining a function must be enclosed in { and } like any other statement block.

Function names must be unique within a namespace and may not conflict with operation and type names. Functions may not allocate or borrow qubits, or call operations. Partial application of operations or passing around operation typed values is fine.

For example,

function DotProduct(a : Double[], b : Double[]) : Double {
if (Length(a) != Length(b)) {
fail "Arrays are not compatible";
}

mutable accum = 0.0;
for (i in 0..Length(a)-1) {
set accum += a[i] * b[i];
}
return accum;
}