Given a tensor of possible 'a' vals, return a tensor of W(a)

Construction function the ANNNI Hamiltonian (J=1)

returns the average KL divergence for a test set X_test.

Create a quantum circuit with a given layout for preparing quantum states. The circuit only contains RY rotation gates and CNOT gates, design

Evaluate the loss function ℒ, defined in the background section for a certain set of parameters.

Create and initialize an Adam optimizer for the parameters.

Get the phase from the DMRG transition lines

Extract the pulse program from the trained policy.

Get an instance of the DataGetter class defined above, which behaves analogously to next(iterator) but is pickleable.

Generates the wire map for the full system.

Given matrix B, this function groups identical rows and columns, orders these groups by sparsity (most zeros first) and returns the row & col

Fourier coefficients of h.

Implements the hinge loss.

Initializes random weights for the QCNN model.

Circuit to load initial state and prepare auxiliary qubit.

Compute the expectation value of an operator ``H`` in the state |0>.

Compute the trace inner product between two operators.

A generator for batches of the input data Args: inputs (array[float]): input data targets (array[float]): targets Retur

Get the KL divergence between two probability distributions

Building block of the embedding ansatz

Return training and testing data of digits dataset.

Verify if the given logical operators are consistent.

Convert input time series data provided in a two-dimensional tensor format to atomized tuple chunks: (xt, t).

Create a cost function on N qubits with N frequencies.

Make a markdown link from a link block. Returns a markdown text string for the link. The format for the link block is a list containing three

Make a markdown table from a table block. Returns a markdown text string for the table. The format for the table block is a list containing si

QJIT-compatible modular multiplicative inverse routine. Source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm#Modular_integers

Returns the indices of the N most probable states in descending order.