Sequential Quantum Gate Decomposer  v1.9.3
Powerful decomposition of general unitarias into one- and two-qubit gates gates
Functions
partition Namespace Reference

Functions

def find_next_biggest_partition (c, max_qubits_per_partition, prevparts=None)
 
def get_qubits (gate)
 
def ilp_max_partitions (c, max_qubits_per_partition)
 
def kahn_partition (c, max_qubit, preparts=None)
 
def PartitionCircuit
 
def PartitionCircuitQasm
 
def translate_param_order
 

Function Documentation

◆ find_next_biggest_partition()

def partition.find_next_biggest_partition (   c,
  max_qubits_per_partition,
  prevparts = None 
)

Definition at line 110 of file partition.py.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ get_qubits()

def partition.get_qubits (   gate)

Definition at line 12 of file partition.py.

Here is the caller graph for this function:

◆ ilp_max_partitions()

def partition.ilp_max_partitions (   c,
  max_qubits_per_partition 
)

Definition at line 158 of file partition.py.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ kahn_partition()

def partition.kahn_partition (   c,
  max_qubit,
  preparts = None 
)

Definition at line 25 of file partition.py.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ PartitionCircuit()

def partition.PartitionCircuit (   circ)

Definition at line 211 of file partition.py.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ PartitionCircuitQasm()

def partition.PartitionCircuitQasm (   filename)

Definition at line 242 of file partition.py.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ translate_param_order()

def partition.translate_param_order (   params)

Definition at line 187 of file partition.py.

Here is the caller graph for this function: