pygsti.algorithms.get_max_gram_basis

pygsti.algorithms.get_max_gram_basis(gateLabels, dataset, maxLength=0)
Compute a maximal set of gate strings that can be used as a basis for a Gram
matrix. That is, a maximal set of strings {S_i} such that the gate strings { S_i S_j } are all present in dataset. If maxLength > 0, then restrict len(S_i) <= maxLength.
Parameters:
  • gateLabels (list or tuple) – the gate labels to use in Gram matrix basis strings
  • dataset (DataSet) – the dataset to use when constructing the Gram matrix
  • maxLength (int, optional) – the maximum string length considered for Gram matrix basis elements. Defaults to 0 (no limit).
Returns:

where each tuple contains gate labels and specifies a single gate string.

Return type:

list of tuples