|
Sequential Quantum Gate Decomposer
v1.9.6
Powerful decomposition of general unitarias into one- and two-qubit gates gates
|
Structure containing the result of a BFS level enumeration. More...
Public Attributes | |
| std::vector< std::pair< std::vector< int >, GrayCodeCNOT > > | out_res |
| Vector of output results (discoveries) from the BFS level enumeration. More... | |
| std::map< std::vector< int >, GrayCodeCNOT > | seq_pairs_of |
| Map from state vectors to their corresponding Gray code sequences. More... | |
| std::set< std::vector< int > > | visited |
| Set of visited states (represented as vectors of integers) More... | |
Structure containing the result of a BFS level enumeration.
This structure contains the visited states, sequence pairs, and the output results from enumerating a single BFS level.
Definition at line 44 of file N_Qubit_Decomposition_Tree_Search.cpp.
| std::vector<std::pair<std::vector<int>, GrayCodeCNOT> > LevelResult::out_res |
Vector of output results (discoveries) from the BFS level enumeration.
Definition at line 50 of file N_Qubit_Decomposition_Tree_Search.cpp.
| std::map<std::vector<int>, GrayCodeCNOT> LevelResult::seq_pairs_of |
Map from state vectors to their corresponding Gray code sequences.
Definition at line 48 of file N_Qubit_Decomposition_Tree_Search.cpp.
| std::set<std::vector<int> > LevelResult::visited |
Set of visited states (represented as vectors of integers)
Definition at line 46 of file N_Qubit_Decomposition_Tree_Search.cpp.
1.8.13