Skip to content

Quantum Discrete Hamiltonian Monte Carlo - Simulation of continuous time quantum walks with a markovian outer loop for solving SVP.

Notifications You must be signed in to change notification settings

eddableheath/QDHMC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Quantum Discrete Hybrid Monte Carlo

Using continuous-time discrete space quantum walks over planar lattice graphs in concert with a Metropolis filter to solve SVP.

Fairly basic free particle walk on integer lattice given by:

U = exp(iHt)

where t is the propagation time and H is the Hamiltonian:

H = -gL

where g is the hopping amplitude and L is the graph Laplacian,

L = A - D

where A is the adjacency matrix for the graph and D_{jj} = deg(j).

Given a starting state of |j> we apply U and then measure to give a new proposal state. This is then compared to the previous state using a Metropolis filter.

This scales poorly if you want to ensure the existence of the shortest vector with the scope of the integer plane, however there are several proposed remedies for this:

  • Explore a smaller area, expand if the shortest vector not found.
    • This area could be defined around the starting state and move based on the new starting state.
  • Explore two dimensions at a time.

About

Quantum Discrete Hamiltonian Monte Carlo - Simulation of continuous time quantum walks with a markovian outer loop for solving SVP.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages