#include <N_Qubit_Decomposition_Tree_Search.h>
|
| bool | best_feasible_for_some_composition (int total, std::vector< int > &edge_counts, const std::vector< std::pair< int, double >> &cut_bounds, int pos, int used_sum, double &best_kappa, std::vector< int > &best_edge_counts) const |
| |
| void | build_cut_to_edges (const std::vector< matrix_base< int >> &topology) |
| |
| bool | composition_satisfies (const std::vector< int > &edge_counts, const std::vector< std::pair< int, double > > &cut_bounds) const |
| |
| bool | feasible_for_some_composition (int total, std::vector< int > &edge_counts, const std::vector< std::pair< int, double > > &cut_bounds, int pos, int used_sum) const |
| |
◆ MinCnotBoundSolver()
| MinCnotBoundSolver::MinCnotBoundSolver |
( |
int |
num_qubits, |
|
|
const std::vector< std::vector< int >> & |
cuts, |
|
|
const std::vector< matrix_base< int >> & |
topology |
|
) |
| |
|
inline |
◆ best_feasible_for_some_composition()
| bool MinCnotBoundSolver::best_feasible_for_some_composition |
( |
int |
total, |
|
|
std::vector< int > & |
edge_counts, |
|
|
const std::vector< std::pair< int, double >> & |
cut_bounds, |
|
|
int |
pos, |
|
|
int |
used_sum, |
|
|
double & |
best_kappa, |
|
|
std::vector< int > & |
best_edge_counts |
|
) |
| const |
|
inlineprivate |
◆ build_cut_to_edges()
| void MinCnotBoundSolver::build_cut_to_edges |
( |
const std::vector< matrix_base< int >> & |
topology | ) |
|
|
inlineprivate |
◆ composition_satisfies()
| bool MinCnotBoundSolver::composition_satisfies |
( |
const std::vector< int > & |
edge_counts, |
|
|
const std::vector< std::pair< int, double > > & |
cut_bounds |
|
) |
| const |
|
inlineprivate |
◆ feasible_for_some_composition()
| bool MinCnotBoundSolver::feasible_for_some_composition |
( |
int |
total, |
|
|
std::vector< int > & |
edge_counts, |
|
|
const std::vector< std::pair< int, double > > & |
cut_bounds, |
|
|
int |
pos, |
|
|
int |
used_sum |
|
) |
| const |
|
inlineprivate |
◆ solve_min_cnots() [1/2]
| int MinCnotBoundSolver::solve_min_cnots |
( |
const std::vector< std::pair< int, double > > & |
cut_bounds, |
|
|
int |
max_total = -1 |
|
) |
| const |
|
inline |
◆ solve_min_cnots() [2/2]
| int MinCnotBoundSolver::solve_min_cnots |
( |
const std::vector< std::pair< int, double > > & |
cut_bounds, |
|
|
double & |
best_kappa, |
|
|
std::vector< int > & |
best_edge_counts, |
|
|
int |
max_total = -1 |
|
) |
| const |
|
inline |
◆ cut_to_edges_
| std::vector<std::vector<int> > MinCnotBoundSolver::cut_to_edges_ |
|
private |
◆ cuts_
| std::vector<std::vector<int> > MinCnotBoundSolver::cuts_ |
|
private |
◆ num_edges_
| int MinCnotBoundSolver::num_edges_ |
|
private |
◆ num_qubits_
| int MinCnotBoundSolver::num_qubits_ |
|
private |
The documentation for this class was generated from the following file:
