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
Project details
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.8.tar.gz
(3.6 kB
view hashes)
Built Distribution
Close
Hashes for qrl_graph-0.0.8-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | a50fa25c7c75384d1bc491be8cc73a1160e518d8867ce412a05d36bebaac98e7 |
|
MD5 | 1b2b67de5915baf0081d0c370366176b |
|
BLAKE2b-256 | eab3176c56638248c19e6dda3cbbb854ee6c063ef43c012a535d2d11ec1db0f4 |