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.7.tar.gz
(3.6 kB
view hashes)
Built Distribution
Close
Hashes for qrl_graph-0.0.7-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 3a9c54be53546212c86da5a71563099b1aec7eaa95294b61da53a293a9e154fc |
|
MD5 | c2adcc68e666b79da335115ce2dea303 |
|
BLAKE2b-256 | 181ba8f4880a963d3b81aa044a4d6fdba2ab5c5df51f6c53c164f1054d6163b8 |