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.6.tar.gz
(3.6 kB
view hashes)
Built Distribution
Close
Hashes for qrl_graph-0.0.6-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 79f491558878a6d42bbb20c79dab7e820616886822ee5fc15ce3a232f03ff7c2 |
|
MD5 | 688254d6051b98e15854a3a0759d06d8 |
|
BLAKE2b-256 | a9b4504904a8aa84cfe53bdf2f7b4d9393589e3606d324a03b4bf1fc33c3d7be |