QuEraComputing / UnitDiskMapping.jl

Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
https://github.com/QuEraComputing/UnitDiskMapping.jl
Other
16 stars 3 forks source link

Redo weighted map #30

Closed GiggleLiu closed 2 years ago

GiggleLiu commented 2 years ago

@minhthin1028 , now the mapping should be correct. Please check the example in the README.

The weights should be in range [0, 1]. This mapping preserves the degeneracy.

I am pretty sure the adiabatic time evolution with this mapping is very different from the previous one, because the weights in the previous mapping are limited to a very small range. Thanks for pointing out the degeneracy problem, now I understand better about Hannes's mapping scheme, this update is very important!