# Source code for pennylane.fourier.coefficients

# Copyright 2018-2021 Xanadu Quantum Technologies Inc.

# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at

# Unless required by applicable law or agreed to in writing, software
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
"""Contains methods for computing Fourier coefficients and frequency spectra of quantum functions."""
from itertools import product
import numpy as np

# pylint:disable=too-many-arguments

[docs]def coefficients(
f, n_inputs, degree, lowpass_filter=False, filter_threshold=None, use_broadcasting=False
):
r"""Computes the first :math:2d+1 Fourier coefficients of a :math:2\pi
periodic function, where :math:d is the highest desired frequency (the
degree) of the Fourier spectrum.

While this function can be used to compute Fourier coefficients in general,
the specific use case in PennyLane is to compute coefficients of the
functions that result from measuring expectation values of parametrized
quantum circuits, as described in Schuld, Sweke, and Meyer (2020)
<https://arxiv.org/abs/2008.08605>__ and Vidal and Theis (2019)
<https://arxiv.org/abs/1901.11434>__.

**Details**

Consider a quantum circuit that depends on a
parameter vector :math:x with
length :math:N. The circuit involves application of some unitary
operations :math:U(x), and then measurement of an observable
:math:\langle \hat{O} \rangle. Analytically, the expectation value is

.. math::

\langle \hat{O} \rangle = \langle 0 \vert U^\dagger (x) \hat{O} U(x) \vert 0\rangle = \langle
\psi(x) \vert \hat{O} \vert \psi (x)\rangle.

This output is simply a function :math:f(x) = \langle \psi(x) \vert \hat{O} \vert \psi
(x)\rangle. Notably, it is a periodic function of the parameters, and
it can thus be expressed as a multidimensional Fourier series:

.. math::

f(x) = \sum \limits_{n_1\in \Omega_1} \dots \sum \limits_{n_N \in \Omega_N}
c_{n_1,\dots, n_N} e^{-i x_1 n_1} \dots e^{-i x_N n_N},

where :math:n_i are integer-valued frequencies, :math:\Omega_i are the set
of available values for the integer frequencies, and the
:math:c_{n_1,\ldots,n_N} are Fourier coefficients.

Args:
f (callable): Function that takes a 1D tensor of n_inputs scalar inputs. The function can be a QNode, but
has to return a real scalar value (such as an expectation).
n_inputs (int): number of function inputs
degree (int or tuple[int]): max frequency of Fourier coeffs to be computed. For degree :math:d,
the coefficients from frequencies :math:-d, -d+1,...0,..., d-1, d will be computed.
If multiple degrees are passed, their length must match n_inputs.
lowpass_filter (bool): If True, a simple low-pass filter is applied prior to
computing the set of coefficients in order to filter out frequencies above the
given degree(s). See examples below.
filter_threshold (None or int or tuple[int]): The integer frequency at which to filter if
lowpass_filter is set to True. If set to None, 2 * degree is used.
If multiple thresholds are passed, their length must match n_inputs.
multiple function calls at once. Broadcasting is performed along the last axis
of the grid of evaluation points.

Returns:
array[complex]: The Fourier coefficients of the function f up to the specified degree(s).

**Example**

Suppose we have the following quantum function and wish to compute its Fourier
coefficients with respect to the variable inpt, which is an array with 2 values:

.. code-block:: python

dev = qml.device('default.qubit', wires=['a'])

@qml.qnode(dev)
def circuit(weights, inpt):
qml.RX(inpt, wires='a')
qml.Rot(*weights, wires='a')

qml.RY(inpt, wires='a')
qml.Rot(*weights, wires='a')

return qml.expval(qml.PauliZ(wires='a'))

.. note::

The QNode has to return a scalar value (such as a single expectation).

Unless otherwise specified, the coefficients will be computed for all input
values. To compute coefficients with respect to only a subset of the input
values, it is necessary to use a wrapper function (e.g.,
functools.partial). We do this below, while fixing a value for
weights:

>>> from functools import partial
>>> weights = np.array([[0.1, 0.2, 0.3], [-4.1, 3.2, 1.3]])
>>> partial_circuit = partial(circuit, weights)

Now we must specify the number of inputs, and the maximum desired
degree. Based on the underlying theory, we expect the degree to be 1
(frequencies -1, 0, and 1).

>>> num_inputs = 2
>>> degree = 1

Then we can obtain the coefficients:

>>> coeffs = coefficients(partial_circuit, num_inputs, degree)
>>> print(coeffs)
[[ 0.    +0.j     -0.    +0.j     -0.    +0.j    ]
[-0.0014-0.022j  -0.3431-0.0408j -0.1493+0.0374j]
[-0.0014+0.022j  -0.1493-0.0374j -0.3431+0.0408j]]

If the specified degree is lower than the highest frequency of the function,
aliasing may occur, and the resultant coefficients will be incorrect as they
will include components of the series expansion from higher frequencies. In
order to mitigate aliasing, setting lowpass_filter=True will apply a
simple low-pass filter prior to computing the coefficients. Coefficients up
to a specified value are computed, and then frequencies higher than the
degree are simply removed. This ensures that the coefficients returned will
have the correct values, though they may not be the full set of
coefficients. If no threshold value is provided, the threshold will be set
to 2 * degree.

Consider the circuit below:

.. code-block:: python

@qml.qnode(dev)
def circuit(inpt):
qml.RX(inpt, wires=0)
qml.RY(inpt, wires=1)
qml.CNOT(wires=[1, 0])
return qml.expval(qml.PauliZ(0))

One can work out by hand that the Fourier coefficients are :math:c_0 = 0.5, c_1 = c_{-1} = 0,
and :math:c_2 = c_{-2} = 0.25. Suppose we would like only to obtain the coefficients
:math:c_0 and :math:c_1, c_{-1}. If we simply ask for the coefficients of degree 1,
we will obtain incorrect values due to aliasing:

>>> coefficients(circuit, 1, 1)
array([0.5 +0.j, 0.25+0.j, 0.25+0.j])

However if we enable the low-pass filter, we can still obtain the correct coefficients:

>>> coefficients(circuit, 1, 1, lowpass_filter=True)
array([0.5+0.j, 0. +0.j, 0. +0.j])

Note that in this case, 2 * degree gives us exactly the maximum coefficient;
in other situations it may be desirable to set the threshold value explicitly.

The coefficients function can handle qnodes from all PennyLane interfaces and if the
passed function allows broadcasted parameter inputs, the computation of the coefficients
can be accelerated by setting use_broadcasting=True.
"""
if isinstance(degree, int):
degree = (degree,) * n_inputs
elif len(degree) != n_inputs:
raise ValueError("If multiple degrees are provided, their number has to match n_inputs.")

if not lowpass_filter:

if filter_threshold is None:
filter_threshold = tuple(2 * d for d in degree)
elif isinstance(filter_threshold, int):
filter_threshold = (filter_threshold,) * n_inputs
elif len(filter_threshold) != n_inputs:
raise ValueError(
"If multiple filter_thresholds are provided, their number has to match n_inputs."
)

# Compute the fft of the function at 2x the specified degree

# Shift the frequencies so that the 0s are at the centre
shifted_unfiltered_coeffs = np.fft.fftshift(unfiltered_coeffs)

# Next, slice up the array so that we get only the coefficients we care about,
# those between -degree and degree
shape = shifted_unfiltered_coeffs.shape
shifted_filtered_coeffs = shifted_unfiltered_coeffs.copy()

# Go axis by axis and take only the central components
for axis in range(n_inputs - 1, -1, -1):
num_excess = filter_threshold[axis] - degree[axis]
_slice = list(range(num_excess, shape[axis] - num_excess))
shifted_filtered_coeffs = np.take(shifted_filtered_coeffs, _slice, axis=axis)

# Shift everything back into "normal" fft ordering
filtered_coeffs = np.fft.ifftshift(shifted_filtered_coeffs)

# Compute the inverse FFT
f_discrete_filtered = np.fft.ifftn(filtered_coeffs)

# Now compute the FFT again on the filtered data
coeffs = np.fft.fftn(f_discrete_filtered)

return coeffs

r"""Computes the first :math:2d+1 Fourier coefficients of a :math:2\pi periodic
function, where :math:d is the highest desired frequency in the Fourier spectrum.

This function computes the coefficients blindly without any filtering applied, and
is thus used as a helper function for the true coefficients function.

Args:
f (callable): function that takes a 1D array of scalar inputs
degree (int or tuple[int]): max frequency of Fourier coeffs to be computed. For degree
:math:d, the coefficients from frequencies :math:-d, -d+1,...0,..., d-1, d
will be computed.
multiple function calls at once. Broadcasting is performed along the last axis
of the grid of evaluation points.

Returns:
array[complex]: The Fourier coefficients of the function f up to the specified degree.
"""
degree = np.array(degree)

# number of integer values for the indices n_i = -degree_i,...,0,...,degree_i
k = 2 * degree + 1

# create generator for indices nvec = (n1, ..., nN), ranging from (-d1,...,-dN) to (d1,...,dN)
n_ranges = [np.arange(-d, d + 1) for d in degree]
nvecs = product(*(n_ranges[:-1] if use_broadcasting else n_ranges))

# here we will collect the discretized values of function f
f_discrete = np.zeros(shape=tuple(k))

spacing = (2 * np.pi) / k

for nvec in nvecs:
# When use_broadcasting=True, nvec is made into a tuple[int,..int,ndarray].
# This would yield to a ragged array, so we do not cast nvec to an array but manually
# iterate over the first axis of spacing and nvec.
nvec = (*nvec, n_ranges[-1])
sampling_point = [s * n for s, n in zip(spacing, nvec)]
else:
sampling_point = spacing * np.array(nvec)
# fill discretized function array with value of f at inpts
f_discrete[nvec] = f(sampling_point)

coeffs = np.fft.fftn(f_discrete) / f_discrete.size

return coeffs


Using PennyLane

Development

API

Internals