Reinforcement Learning Algorithms for the quantum speed up in graphs
Project description
QRL_graph
Reinforcement Learning for the quantum speedup in the graph
Given a graph, we try to compute the classical and quantum critical time. The definition of the criticial time is defined as the hitting time of the endpoints with the probility bigger than $p_0$.
Usage
pip install qrl_graph
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
qrl-graph-0.0.3.tar.gz
(2.4 kB
view hashes)
Built Distribution
Close
Hashes for qrl_graph-0.0.3-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 812c7d16b803e91fd018d924f7244f67fb1fcc8f267d833d3927ef37f875d2b0 |
|
| MD5 | a503b63cd6368d58b73607a5fd89ecfb |
|
| BLAKE2b-256 | 8b941d19f8920a45f7a6f6dd649ac8b611860b93f2c47a8dcd51eab9de71b7f4 |
