Method run_with_optimizing

Core/QuantumMachine/OriginQVM.cpp:131–212

}

std::map<string, size_t> QVM::run_with_optimizing(QProg& prog, std::vector<ClassicalCondition>& cbits, int shots, TraversalConfig& traver_param)
{
	if (0 == traver_param.m_measure_qubits.size())
	{
		return map<string, size_t>();
	}

	map<string, size_t> result_map;
	//_pGates->initState(0, 1, _Qubit_Pool->get_max_usedqubit_addr() + 1);
	_pGates->initState(0, 1, prog.get_max_qubit_addr() +1);

	QProgExecution prog_exec;
	prog_exec.execute(prog.getImplementationPtr(), nullptr, traver_param, _pGates);
	map<size_t, size_t> result;

	vector<double> random_nums(shots, 0);
	for (size_t i = 0; i < shots; i++)
	{
		random_nums[i] = random_generator19937();
	}

	std::sort(random_nums.begin(), random_nums.end(), [](double& a, double b) { return a > b; });
	prob_vec probs;

	Qnum qubits_nums = traver_param.m_measure_qubits;
	_pGates->pMeasure(qubits_nums, probs);
	std::unordered_multimap<size_t, CBit*> qubit_cbit_map;
	for (size_t i = 0; i < traver_param.m_measure_cc.size(); i++)
	{
		qubit_cbit_map.insert({ traver_param.m_measure_qubits[i], traver_param.m_measure_cc[i] });
	}

	double p_sum = 0;
	for (size_t i = 0; i < probs.size(); i++)
	{
		if (probs[i] < DBL_EPSILON && probs[i] > -DBL_EPSILON)
		{
			continue;
		}

		p_sum += probs[i];
		auto iter = random_nums.rbegin();
		while (iter != random_nums.rend() && *iter < p_sum)
		{
			size_t measure_num = traver_param.m_measure_cc.size();
			auto bin_str_index = integerToBinary(i, measure_num);
			for (size_t j = 0; j < measure_num; j++)
			{
				auto qubit_idx = qubits_nums[j];
				auto mulit_iter = qubit_cbit_map.equal_range(qubit_idx);
				while (mulit_iter.first != mulit_iter.second)
				{
					auto cbit = mulit_iter.first->second;
					cbit->set_val(bin_str_index[measure_num - j - 1] - 0x30);
					_QResult->append({ cbit->getName(), cbit->getValue() });
					++mulit_iter.first;
				}
			}