Sequential Quantum Gate Decomposer  v1.9.6
Powerful decomposition of general unitarias into one- and two-qubit gates gates
Namespaces | Functions | Variables
ilp.py File Reference

Go to the source code of this file.

Namespaces

 ilp
 

Functions

def ilp._check_gurobi_available ()
 
def ilp._get_topo_order (g, rg, gate_to_qubit)
 
def ilp._print_gurobi_fallback_warning (exc)
 
def ilp._solve_pulp_with_gurobi_or_cbc (prob, pulp, callback=None, gurobi_kwargs)
 
def ilp._test_max_qasm ()
 
def ilp.all_cycles_from_dag_edges (succ, max_len=5)
 
def ilp.contract_single_qubit_chains (go, rgo, gate_to_qubit, topo_order)
 
def ilp.find_next_biggest_partition (c, max_qubits_per_partition, prevparts=None)
 
def ilp.get_all_partitions (c, max_qubits_per_partition)
 
def ilp.get_part_cycle_graph (g, gate_to_parts)
 
def ilp.ilp_global_optimal (allparts, g, weighted_info=None, gurobi_direct=False, use_order=False, weights=None)
 
def ilp.ilp_max_partitions (c, max_qubits_per_partition)
 
def ilp.max_partitions (c, max_qubits_per_partition, use_ilp=True, fusion_cost=False, control_aware=False)
 
def ilp.nuutila_reach_scc (succ, subg=None)
 
def ilp.recombine_single_qubit_chains (g, rg, single_qubit_chains, gate_to_tqubit, L, fusion_info, surrounded_only=False)
 
def ilp.scc_tarjan_iterative (succ)
 
def ilp.sol_to_badsccs (g, allparts, L)
 
def ilp.topo_sort_partitions (c, parts)
 
def ilp.two_cycles_from_dag_edges (g, gate_to_parts, allparts)
 

Variables

 ilp._GUROBI_AVAILABILITY_ERROR
 
 ilp._GUROBI_AVAILABLE
 
 ilp._GUROBI_FALLBACK_WARNING_PRINTED