pygsti.circuits.cloudcircuitconstruction.create_kcoverage_template

create_kcoverage_template(n, k, verbosity=0)

Construct a template for how to create a “k-coverage” set of length-n sequences.

Consider a set of length-n words from a k-letter alphabet. These words (sequences of letters) have the “k-coverage” property if, for any choice of k different letter positions (indexed from 0 to n-1), every permutation of the k distinct letters (symbols) appears in those positions for at least one element (word) in the set. Such a set of sequences is returned by this function, namely a list length-n lists containing the integers 0 to k-1.

This notion has application to idle-gate fiducial pair tiling, when we have found a set of fiducial pairs for k qubits and want to find a set of sequences on n > k qubits such that any subset of k qubits experiences the entire set of (k-qubit) fiducial pairs. Simply take the k-coverage template and replace the letters (0 to k-1) with the per-qubit 1Q pieces of each k-qubit fiducial pair.

Parameters:

• n (int) – The sequences length (see description above).

• k (int) – The coverage number (see description above).

• verbosity (int, optional) – Amount of detail to print to stdout.

Returns:

A list of length-n lists containing the integers 0 to k-1. The length of the outer lists depends on the particular values of n and k and is not guaranteed to be minimal.

Return type:

list