pygsti.layouts.prefixtable

Defines the PrefixTable class.

Functions

tree_partition_kundu_misra(tree, max_weight)

Algorithm for optimal minimum cardinality k-partition of tree (a partition of a tree into cluster of size at most k) based on a slightly less sophisticated implementation of the algorithm from "A Linear Tree Partitioning Algorithm" by Kundu and Misra (SIAM J.

Classes

ChildNode(value[, parent, children, ...])	Class for representing a child node for a tree, along with the corresponding metadata specific to child nodes.
PrefixTable(circuits_to_evaluate, max_cache_size)	An ordered list ("table") of circuits to evaluate, where common prefixes can be cached.
PrefixTableJacobian(circuits_to_evaluate, ...)	An ordered list ("table") of circuits to evaluate, where common prefixes can be cached.
RootNode(value[, cost, tree, children, ...])	Class for representing a root node for a tree, along with the corresponding metadata specific to root nodes.
Tree([roots])	Container class for storing a tree structure (technically a forest, as there can be multiple roots).
TreeNode(value[, children, orig_indices])