UnitDiskMapping.jl
UnitDiskMapping.jl copied to clipboard
QuEraComputing
Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
Let's suppose I define the peterson graph, then its unweighted mapping unweight_res (as in the example notebook). How should the field unweighted_res.lines be interpreted? For example: UnitDiskMapping.CopyLine 10: vslot →...
I used the same graph K23 as in [arXiv:2209.03965](https://arxiv.org/abs/2209.03965). Although the DUGG looks the same, however, the mapping here is unweighted. ```julia # output: a 7 x 11 DUGG #...
""" ⋅ ◯ ⋅ ⋅ ● ⋅ ● ⋅ ⋅ ● ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ """=>""" ⋅ ◯ ⋅ ⋅ ● ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅...
Hello & thank you for your library on this interesting topic. sorry, if I may miss the obvious (this is my first contact to julia-libraries). I created a simple all-to-all...
After doing this qubo = UnitDiskMapping.map_qubo(J, h);. I got the unit disk graph, now how to use that graph in bloqade python sdk and map it to a hardware.
This pull request introduces support for mapping graphs onto triangular lattices in addition to the existing square lattice approach, enabling more flexible and realistic modeling for quantum hardware with different...
@GiggleLiu I observed inconsistent maximum weighted independent set (MWIS) solutions between two methods applied to the same graph and weight vector: - Method 1: Integer Programming (`JuMP + GLPK`) -...
Metadata
Owner
Metadata
Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid