Method phase1

Extensions/QMapping/OBMTQMapping.cpp:283–455

}

std::vector<std::vector<MappingCandidate>> OptBMTQAllocator::phase1(LayeredTopoSeq& layer_info)
{
    // First Phase:
    //     in this phase, we divide the program in layers, such that each layer is satisfied
    //     by any of the mappings inside 'candidates'.
    //
    mPP.push_back(std::vector<QNodeRef>());
    std::vector<std::vector<MappingCandidate>> collection;
    std::vector<MappingCandidate> candidates { { Mapping(mVQubits, UNDEF_UINT32), 0 } };
    std::vector<bool> mapped(mVQubits, false);
    Graph lastPartitionGraph(mVQubits);
    Graph partitionGraph(mVQubits);

	PTrace("OPT-BMT PHASE 1 : Solving SIP Instances.");
	auto mXbitSize = mVQubits;
	using CandidateCirNode = CNodeCandidate<QNodeRef>;
	std::priority_queue<CandidateCirNode,
		std::vector<CandidateCirNode>,
		std::greater<CandidateCirNode>> nodeQueue;
	QVec last_layer_qubits;
	for (auto layer_iter = layer_info.begin(); (layer_iter != layer_info.end()) || (nodeQueue.size() > 0); )
	{
		bool b_stay_cur_layer = false;
		bool b_no_double_gate = true;
		std::list<QNodeRef> circuitNodeCandidatesVector;
		if (layer_iter != layer_info.end())
		{
			auto& cur_layer = *layer_iter;
			for (auto gate_iter = cur_layer.begin(); gate_iter != cur_layer.end(); )
			{
				const auto tmp_node = gate_iter->first;
				auto used_qv = tmp_node->m_target_qubits + tmp_node->m_control_qubits;
				auto q = used_qv - last_layer_qubits;
				bool b_qubit_multiplex = (q.size() != used_qv.size());
				b_stay_cur_layer = (b_stay_cur_layer || b_qubit_multiplex);

				if (tmp_node->m_gate_type == BARRIER_GATE)
				{
					if (!b_qubit_multiplex)
					{
						mPP.back().push_back(*(tmp_node->m_iter));
						gate_iter = cur_layer.erase(gate_iter);
						continue;
					}
				}

				if ((used_qv.size() < 2))
				{
					if (!b_qubit_multiplex)
					{
						mPP.back().push_back(*(tmp_node->m_iter));
						gate_iter = cur_layer.erase(gate_iter);
						continue;
					}
				}
				else
				{
					b_no_double_gate = false;