# Variational circuits¶

A variational circuit consists of three ingredients:

1. Preparation of a fixed initial state (e.g., the vacuum state or the zero state).
2. A quantum circuit $$U(x; \bm{\theta})$$, parameterized by both the input $$x$$ and the free parameters $$\bm{\theta}$$.
3. Measurement of an observable $$\hat{B}$$ at the output. This observable may be made up from local observables for each wire in the circuit, or just a subset of wires.

The expectation values $$f(x;\bm{\theta})=\langle 0 | U^\dagger(x; \bm{\theta}) \hat{B} U(x; \bm{\theta}) | 0 \rangle$$ of one or more such circuits — possibly with some classical post-processing — define a scalar cost for a given task. The free parameters $$\bm{\theta}$$ of the circuit are tuned to optimize this cost function.

Typically, variational circuits are trained by a classical optimization algorithm that makes queries to the quantum device. The optimization is an iterative scheme that searches out better candidates for the parameters $$\theta$$ with every step. Variational circuits have been proposed for various near-term applications, such as optimization, quantum chemistry, machine learning, data compression, linear algebra, and feature embeddings.

Variational circuits have become popular as a way to think about quantum algorithms for near-term quantum devices. Such devices can only run short gate sequences, and have a high error. Usually, a quantum algorithm is decomposed into a set of standard elementary operations, which are in turn implemented by the quantum hardware. The intriguing idea of variational circuit for near-term devices is to merge this two-step procedure into a single step by “learning” the circuit on the noisy device for a given task. This way, the “natural” tunable gates of a device can be used to formulate the algorithm, without the detour via a fixed elementary gate set. Furthermore, systematic errors can automatically be corrected during optmization.

## Building the circuit¶ Example circuit showing how the argument $$x$$ and the variational parameters $$\bm{\theta}$$ enter the quantum circuit. Circuits can also contain gates which have no free parameters (e.g., a CNOT).

Both the input $$x$$ and the variational parameters $$\bm{\theta}$$ enter the quantum circuit in the same way: as arguments for the circuit’s gates. This allows us to convert classical information (the values of $$x$$ and $$\bm{\theta}$$) into quantum information (the quantum state $$U(x;\bm{\theta})|0\rangle$$).

Quantum information is turned back into classical information by evaluating the expectation value of the observable $$\hat{B}$$,

$f(x; \bm{\theta}) = \langle \hat{B} \rangle = \langle 0 | U^\dagger(x;\bm{\theta})\hat{B}U(x;\bm{\theta}) | 0 \rangle.$

Beyond the basic rule that the inputs and parameters $$(x;\bm{\theta})$$ are used as the arguments of gates, exactly how the gates are arranged, the circuit architecture, is essentially arbitrary.

Note

As shown in the figure above, the circuit can also include additional gates which have no free parameter associated with them.

## Examples¶

### Data-embedding¶

One straightforward embedding strategy is for the first few gates in the circuit to be responsible for embedding the input $$x$$ into a quantum state (which functions as a feature map [R4]), while the subsequent gates have the parameters $$\bm{\theta}$$ as arguments.

As an example, consider a photonic quantum computer (similar examples can be constructed for qubits). For simplicity, we temporarily omit the parameters $$\bm{\theta}$$. We take the initial state to be the vacuum state and the measured observable $$\hat{B}$$ to be the position operator $$x$$. The vacuum state has expectation value $$\langle\hat{x}\rangle = \langle 0 | \hat{x} | 0 \rangle = 0$$.

Suppose we have an input $$x$$, which has $$N$$ dimensions. We can embed this into a quantum circuit with $$N$$ wires using the displacement operator. For every component $$x_i$$ of $$x$$, we apply $$D(x_i)$$ to wire $$i$$.

Measurement of the expectation value of the $$\hat{x}$$ operator on each wire will then give the result

$(\langle \hat{x}_1 \rangle, \cdots, \langle \hat{x}_N \rangle ) = (x_1, \dots, x_N).$

Thus, the displacement gate — combined with vacuum input and position measurements — can be used to directly encode data into a photonic quantum computer.

### Data processing¶

Having embedded our data into a quantum state, we would now like to perform some processing. As it stands, our example circuit currently represents the identity $$f(x)=x$$, which has no free parameters. By introducing additional gates, with parameters $$\bm{\theta}$$, we can start building up more complex functions.

For clarity, we restrict to a one-dimensional input $$x$$ and add in a single rotation operator, with free parameter $$\theta$$. After applying this gate, the quantum node evaluated by our circuit becomes

$f(x;\theta) = x\cos(\theta).$

In summary, with only two quantum gates (displacement and rotation), we can evaluate functions of the above form using quantum circuits.

The above examples were kept very simple to illustrate the principles behind embedding data and parameters into quantum circuits. Indeed, the function evaluated in the example is tractable classically. However, by increasing the number of subsystems and the circuit depth, the corresponding functions can become progressively harder to evaluate classically, and a quantum device must be used.

## Architectures¶

Many variational circuit architectures have been proposed by the quantum computing community . The strength of an architecture varies depending on the desired use-case, and it is not always clear what makes a good ansatz. Investigations of the expressive power of different approaches are also ongoing [R9]. One goal of PennyLane is to facilitate such studies across various architectures and hardware platforms.

To give a rough summary, we distinguish three different types of architectures, namely layered gate architectures, alternating operator architectures and tensor network architectures.

### Layered gate architectures¶

A layer is a sequence of gates that is repeated in the variational circuit. The number of repetitions of a layer forms a hyperparameter of the variational circuit.

We can often decompose a layer further into two overall unitaries $$A$$ and $$B$$.

Block $$A$$ contains single-system gates applied to every subsystem. Block $$B$$ consists of both single-subsystem gates as well as entangling gates.

Layered gate architectures can differ in three regards:

• Whether only $$A$$, only $$B$$, or both $$A$$ and $$B$$ are parametrized
• Which types of gates are used in $$A$$ and $$B$$
• Whether the gates in Block $$B$$ are arranged randomly, fixed, or determined by a hyperparameter

Such layered architectures appear in both discrete and continuous-variable quantum computing models.

#### A parametrized, B fixed¶

In the simplest case of qubit-based devices, we can use general SU(2) gates (i.e., rotations) $$R$$ in Block $$A$$ and let $$B$$ be fixed.

#### A parametrized, B parametrized¶

We can also have both $$A$$ and $$B$$ parametrized and the arrangements of the two-qubit gates depends on a hyperparameter defining the range of two-qubit gates (see also [R10], [R2]).

A fully parametrized architecture specific to continuous-variable systems has been proposed in [R4].

The entangling layer $$B$$ contains an interferometer, a passive optical circuit made up of individual beamsplitters and phase shifters. Block $$A$$ consists of single-mode gates with consecutively higher order for the quadrature operator $$\hat{x}$$ which generates the gate: the displacement gate $$D$$ is order-1, the quadratic phase gate $$Q$$ is order-2, and the cubic phase gate $$V$$ is order-3.

#### A fixed, B parametrized¶

An example where the single-qubit gates are fixed is a so-called Instantaneous Quantum Polynomial (IQP) circuit, where $$A$$ consists of Hadamard gates and $$B$$ is made up of parametrized diagonal one- and two-qubit gates [R11][R12].

Analogous circuits can also be considered for continuous-variable systems [R13].

IQP circuits are structured so that all gates in the $$B$$ block are diagonal in the computational basis.

#### Other structures¶

Generalizing the simple two-block structure allows to build more complex layers, such as this layer of a photonic neural network which emulates how information is processed in classical neural nets [R3] [R14].

### Alternating operator architectures¶

The alternating operator architecture was first introduced in Farhi and Goldstone’s Quantum Approximate Optimization Algorithm (QAOA) [R15] and later used for machine learning [R16] and other domain-specific applications [R17].

Again, we use layers of two blocks. The difference is that this time the unitaries representing these blocks are defined via Hamiltonians $$A$$ and $$B$$ which are evolved for a short time $$\Delta t$$.

The idea of this ansatz is based on analogies to adiabatic quantum computing, in which the system starts in the ground state of $$A$$ and adiabatically evolves to the ground state of $$B$$. Quickly alternating (i.e., stroboscopic) applications of $$A$$ and $$B$$ for very short times $$\Delta t$$ can be used as a heuristic to approximate this evolution.

### Tensor network architectures¶

Amongst the architectures that do not consist of layers, but a single fixed structure, are gate sequences inspired by tensor networks [R18] [R9]. The simplest one is a tree architecture that consecutively entangles subsets of qubits.

Another tensor network is based on matrix product states. The circuit unitaries can be decomposed in different ways, and their size corresponds to the “bond dimension” of the matrix product state — the higher the bond dimension, the more complex the circuit ansatz.

Note

Tensor networks such as matrix product states were invented to simulate certain quantum systems efficiently (though not universally) on classical computers. Hence, tensor network architectures do not necessarily give rise to classically intractable quantum nodes, but have found use as machine learning models [R19].

Footnotes

  For example, see the following non-exhaustive list: [R11] [R15] [R19] [R10] [R13] [R20] [R21] [R18] [R4] [R12] [R2] [R22] [R3] [R14].