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.5.tar.gz
(2.4 kB
view hashes)
Built Distribution
Close
Hashes for qrl_graph-0.0.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | cc0704298692c6a8249d98a1edc51d3ad530304cf739138537be0e0e26fb43f8 |
|
MD5 | f6c2598f235c89f3505f72a35448e013 |
|
BLAKE2b-256 | 5a133a16ab06d4c7188308545b9cae2a29434c9394fc57a5cd1142080cc90b27 |