|
Sequential Quantum Gate Decomposer
v1.9.6
Powerful decomposition of general unitarias into one- and two-qubit gates gates
|
Structure containing level information for breadth-first search over gate structures. More...
#include <N_Qubit_Decomposition_Tree_Search.h>
Public Attributes | |
| std::vector< std::vector< int > > | q |
| Queue of states to be processed in the next BFS level. 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 level information for breadth-first search over gate structures.
This structure tracks visited states, sequence pairs, and the queue of states to process during BFS enumeration.
Definition at line 44 of file N_Qubit_Decomposition_Tree_Search.h.
| std::vector<std::vector<int> > LevelInfo::q |
Queue of states to be processed in the next BFS level.
Definition at line 50 of file N_Qubit_Decomposition_Tree_Search.h.
| std::map<std::vector<int>, GrayCodeCNOT> LevelInfo::seq_pairs_of |
Map from state vectors to their corresponding Gray code sequences.
Definition at line 48 of file N_Qubit_Decomposition_Tree_Search.h.
| std::set<std::vector<int> > LevelInfo::visited |
Set of visited states (represented as vectors of integers)
Definition at line 46 of file N_Qubit_Decomposition_Tree_Search.h.
1.8.13