-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #126 from qulacs/118-probablistic
Probablistic Gate
- Loading branch information
Showing
11 changed files
with
295 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1 @@ | ||
| from .scaluq_core.gate import * |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,86 @@ | ||
| #pragma once | ||
|
|
||
| #include "../util/random.hpp" | ||
| #include "gate.hpp" | ||
|
|
||
| namespace scaluq { | ||
| namespace internal { | ||
| class ProbablisticGateImpl : public GateBase { | ||
| std::vector<double> _distribution; | ||
| std::vector<double> _cumlative_distribution; | ||
| std::vector<Gate> _gate_list; | ||
|
|
||
| public: | ||
| ProbablisticGateImpl(const std::vector<double>& distribution, | ||
| const std::vector<Gate>& gate_list) | ||
| : _distribution(distribution), _gate_list(gate_list) { | ||
| UINT n = distribution.size(); | ||
| if (n == 0) { | ||
| throw std::runtime_error("At least one gate is required."); | ||
| } | ||
| if (n != gate_list.size()) { | ||
| throw std::runtime_error("distribution and gate_list have different size."); | ||
| } | ||
| _cumlative_distribution.resize(n + 1); | ||
| std::partial_sum( | ||
| distribution.begin(), distribution.end(), _cumlative_distribution.begin() + 1); | ||
| if (std::abs(_cumlative_distribution.back() - 1.) > 1e-6) { | ||
| throw std::runtime_error("Sum of distribution must be equal to 1."); | ||
| } | ||
| } | ||
| const std::vector<Gate>& gate_list() { return _gate_list; } | ||
| const std::vector<double>& distribution() { return _distribution; } | ||
|
|
||
| std::vector<UINT> get_target_qubit_list() const override { | ||
| std::vector<UINT> ret; | ||
| for (const auto& gate : _gate_list) { | ||
| std::vector<UINT> targets = gate->get_target_qubit_list(); | ||
| ret.reserve(ret.size() + targets.size()); | ||
| std::ranges::copy(targets, std::back_inserter(ret)); | ||
| } | ||
| std::ranges::sort(ret); | ||
| auto result = std::ranges::unique(ret); | ||
| ret.erase(result.begin(), result.end()); | ||
| return ret; | ||
| } | ||
| std::vector<UINT> get_control_qubit_list() const override { | ||
| std::vector<UINT> ret; | ||
| for (const auto& gate : _gate_list) { | ||
| std::vector<UINT> controls = gate->get_control_qubit_list(); | ||
| ret.reserve(ret.size() + controls.size()); | ||
| std::ranges::copy(controls, std::back_inserter(ret)); | ||
| } | ||
| std::ranges::sort(ret); | ||
| auto result = std::ranges::unique(ret); | ||
| ret.erase(result.begin(), result.end()); | ||
| return ret; | ||
| } | ||
|
|
||
| Gate copy() const override { return std::make_shared<ProbablisticGateImpl>(*this); } | ||
| Gate get_inverse() const override { | ||
| std::vector<Gate> inv_gate_list; | ||
| inv_gate_list.reserve(_gate_list.size()); | ||
| std::ranges::transform(_gate_list, std::back_inserter(inv_gate_list), [](const Gate& gate) { | ||
| return gate->get_inverse(); | ||
| }); | ||
| return std::make_shared<ProbablisticGateImpl>(_distribution, inv_gate_list); | ||
| } | ||
| std::optional<ComplexMatrix> get_matrix() const override { | ||
| if (_gate_list.size() == 1) return _gate_list[0]->get_matrix(); | ||
| return std::nullopt; | ||
| } | ||
|
|
||
| void update_quantum_state(StateVector& state_vector) const override { | ||
| Random random; | ||
| double r = random.uniform(); | ||
| UINT i = std::distance(_cumlative_distribution.begin(), | ||
| std::ranges::upper_bound(_cumlative_distribution, r)) - | ||
| 1; | ||
| if (i >= _gate_list.size()) i = _gate_list.size() - 1; | ||
| _gate_list[i]->update_quantum_state(state_vector); | ||
| } | ||
| }; | ||
| } // namespace internal | ||
|
|
||
| using ProbablisticGate = internal::GatePtr<internal::ProbablisticGateImpl>; | ||
| } // namespace scaluq |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,105 @@ | ||
| #pragma once | ||
|
|
||
| #include <variant> | ||
|
|
||
| #include "../util/random.hpp" | ||
| #include "gate.hpp" | ||
| #include "param_gate.hpp" | ||
|
|
||
| namespace scaluq { | ||
| namespace internal { | ||
| class PProbablisticGateImpl : public ParamGateBase { | ||
| using EitherGate = std::variant<Gate, ParamGate>; | ||
| std::vector<double> _distribution; | ||
| std::vector<double> _cumlative_distribution; | ||
| std::vector<EitherGate> _gate_list; | ||
|
|
||
| public: | ||
| PProbablisticGateImpl(const std::vector<double>& distribution, | ||
| const std::vector<std::variant<Gate, ParamGate>>& gate_list) | ||
| : _distribution(distribution), _gate_list(gate_list) { | ||
| UINT n = distribution.size(); | ||
| if (n == 0) { | ||
| throw std::runtime_error("At least one gate is required."); | ||
| } | ||
| if (n != gate_list.size()) { | ||
| throw std::runtime_error("distribution and gate_list have different size."); | ||
| } | ||
| _cumlative_distribution.resize(n + 1); | ||
| std::partial_sum( | ||
| distribution.begin(), distribution.end(), _cumlative_distribution.begin() + 1); | ||
| if (std::abs(_cumlative_distribution.back() - 1.) > 1e-6) { | ||
| throw std::runtime_error("Sum of distribution must be equal to 1."); | ||
| } | ||
| } | ||
| const std::vector<std::variant<Gate, ParamGate>>& gate_list() { return _gate_list; } | ||
| const std::vector<double>& distribution() { return _distribution; } | ||
|
|
||
| std::vector<UINT> get_target_qubit_list() const override { | ||
| std::vector<UINT> ret; | ||
| for (const auto& gate : _gate_list) { | ||
| std::vector<UINT> targets = | ||
| std::visit([](const auto& g) { return g->get_target_qubit_list(); }, gate); | ||
| ret.reserve(ret.size() + targets.size()); | ||
| std::ranges::copy(targets, std::back_inserter(ret)); | ||
| } | ||
| std::ranges::sort(ret); | ||
| auto result = std::ranges::unique(ret); | ||
| ret.erase(result.begin(), result.end()); | ||
| return ret; | ||
| } | ||
| std::vector<UINT> get_control_qubit_list() const override { | ||
| std::vector<UINT> ret; | ||
| for (const auto& gate : _gate_list) { | ||
| std::vector<UINT> controls = | ||
| std::visit([](const auto& g) { return g->get_control_qubit_list(); }, gate); | ||
| ret.reserve(ret.size() + controls.size()); | ||
| std::ranges::copy(controls, std::back_inserter(ret)); | ||
| } | ||
| std::ranges::sort(ret); | ||
| auto result = std::ranges::unique(ret); | ||
| ret.erase(result.begin(), result.end()); | ||
| return ret; | ||
| } | ||
|
|
||
| ParamGate copy() const override { return std::make_shared<PProbablisticGateImpl>(*this); } | ||
| ParamGate get_inverse() const override { | ||
| std::vector<EitherGate> inv_gate_list; | ||
| inv_gate_list.reserve(_gate_list.size()); | ||
| std::ranges::transform( | ||
| _gate_list, std::back_inserter(inv_gate_list), [](const EitherGate& gate) { | ||
| return std::visit([](const auto& g) { return EitherGate{g->get_inverse()}; }, gate); | ||
| }); | ||
| return std::make_shared<PProbablisticGateImpl>(_distribution, inv_gate_list); | ||
| } | ||
| std::optional<ComplexMatrix> get_matrix(double param) const override { | ||
| if (_gate_list.size() == 1) { | ||
| const auto& gate = _gate_list[0]; | ||
| if (gate.index() == 0) { | ||
| return std::get<0>(gate)->get_matrix(); | ||
| } else { | ||
| return std::get<1>(gate)->get_matrix(param); | ||
| } | ||
| } | ||
| return std::nullopt; | ||
| } | ||
|
|
||
| void update_quantum_state(StateVector& state_vector, double param) const override { | ||
| Random random; | ||
| double r = random.uniform(); | ||
| UINT i = std::distance(_cumlative_distribution.begin(), | ||
| std::ranges::upper_bound(_cumlative_distribution, r)) - | ||
| 1; | ||
| if (i >= _gate_list.size()) i = _gate_list.size() - 1; | ||
| const auto& gate = _gate_list[i]; | ||
| if (gate.index() == 0) { | ||
| std::get<0>(gate)->update_quantum_state(state_vector); | ||
| } else { | ||
| std::get<1>(gate)->update_quantum_state(state_vector, param); | ||
| } | ||
| } | ||
| }; | ||
| } // namespace internal | ||
|
|
||
| using PProbablisticGate = internal::ParamGatePtr<internal::PProbablisticGateImpl>; | ||
| } // namespace scaluq |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters