N_Qubit_Decomposition_Tabu_Search.h

Go to the documentation of this file.

/*
Created on Fri Jun 26 14:13:26 2020
Copyright 2020 Peter Rakyta, Ph.D.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.

You should have received a copy of the GNU General Public License
along with this program.  If not, see http://www.gnu.org/licenses/.

@author: Peter Rakyta, Ph.D.
*/
#ifndef N_Qubit_Decomposition_Tabu_Search_H
#define N_Qubit_Decomposition_Tabu_Search_H

#include "N_Qubit_Decomposition_Tree_Search.h"
#include "GrayCode.h"
#include "GrayCodeHash.h"
#include <unordered_set>


class N_Qubit_Decomposition_Tabu_Search : public N_Qubit_Decomposition_Tree_Search {


public:

protected:
 
    std::unordered_set<GrayCode, GrayCodeHash> tested_gate_structures;
    
    std::vector< std::pair<GrayCode, double> > best_solutions;
    

public:

N_Qubit_Decomposition_Tabu_Search();


N_Qubit_Decomposition_Tabu_Search( Matrix Umtx_in, int qbit_num_in, int level_limit_in, std::map<std::string, Config_Element>& config, int accelerator_num=0 );


N_Qubit_Decomposition_Tabu_Search( Matrix Umtx_in, int qbit_num_in, int level_limit_in, std::vector<matrix_base<int>> topology_in, std::map<std::string, Config_Element>& config, int accelerator_num=0 );



virtual ~N_Qubit_Decomposition_Tabu_Search();



Gates_block* determine_gate_structure(Matrix_real& optimized_parameters_mtx);



GrayCode tabu_search_over_gate_structures();


std::vector<GrayCode> determine_mutated_structures( const GrayCode& gcode );



GrayCode draw_gate_structure_from_list( std::vector<GrayCode>& gcodes );



void insert_into_best_solution( const GrayCode& gcode_, double minimum_ );


};






#endif