GreedyPartitioner

class GreedyPartitioner(block_size=3)[source]

Bases: BasePass

The GreedyPartitioner Pass.

This pass partitions a circuit by forming the largest regions first.

__init__(block_size=3)[source]

Construct a GreedyPartitioner.

Parameters:

block_size (int) – Maximum size of partitioned blocks. (Default: 3)

Raises:

ValueError – If block_size is less than 2.

Note

GreedyPartitioner has been deprecated and will be removed in a future update. See QuickPartitioner for a replacement partitioner.

Attributes

name

The name of the pass.

Methods

execute(*args, **kwargs)

Map a function over iterable arguments in parallel.

get_connectivity(_, data)

Retrieve the current connectivity of the circuit.

get_model(_, data)

Retrieve the machine model from the data dictionary.

get_placement(_, data)

Retrieve the logical to physical qubit map from the data dictionary.

get_target(_, data)

Retrieve the target from the data dictionary.

in_parallel(data)

Return true if pass is being executed in a parallel.

run(circuit, data)

Perform the pass's operation, see BasePass for more.

topo_sort(regions)

Topologically sort regions.