Unweighted triangular lattice gadget search

[GiggleLiu]

main.pdf

https://github.com/QuEraComputing/UnitDiskMapping.jl/blob/86cb5f0e0963d0fb8af2a269b0da160c8a7fb056/test/gadgets.jl#L6

[isPANN]

I still used the original method and got two gadgets. This time, I checked them carefully, so I believe there shouldn’t be any problems.

[GiggleLiu]

Wow wow wow! I also verified the correctness of the gadget. The code that I used to verify the gadget.

@testset "triangular lattice" begin
    # crossing gadget
    a = [sqrt(3), 1.0]
    b = [0.0, 2.0]
    locs = vcat([a * (i-1) for i=1:5], [b + a * (i-1) for i=1:4], [2 * b + a * (i-1) for i=1:3], [-a + 3 * b, 3 * b + 2 * a])
    udg = unit_disk_graph(Tuple.(locs), 2.1)
    @test nv(udg) == 14
    @test ne(udg) == 25
    pins = [1, 5, 13, 14]
    weights = [1, 2, 3, 2, 1, 2, 4, 4, 2, 3, 2, 3, 1, 1]
    g = GenericTensorNetwork(IndependentSet(udg, weights))
    configs = solve(g, ConfigsMax())[]
    @test length(configs.c) == 4
    for c in configs.c
        @test c[pins[1]] == 1 - c[pins[4]]
        @test c[pins[2]] == 1 - c[pins[3]]
    end

    # crossing + edge
    locs = [0 * a, 2 * a, b, b + a, -a + 2b, a + 2b, 3b -a ,3b, 4b-2a, 4b-a, 4b]
    weights = [1, 1, 2, 2, 2, 2, 3, 3, 1, 3, 1]
    udg = unit_disk_graph(Tuple.(locs), 2.1)
    @test nv(udg) == 11
    @test ne(udg) == 14
    pins = [1, 2, 9, 11]
    g = GenericTensorNetwork(IndependentSet(udg, weights))
    configs = solve(g, ConfigsMax())[]
    @test length(configs.c) == 3
    for c in configs.c
        @test c[pins[1]] == 1 - c[pins[4]]
        @test c[pins[2]] == 1 - c[pins[3]]
        @test c[pins[4]] * c[pins[3]] == 0
    end
end

[GiggleLiu]

Could you please try doing the UDG mapping using the above example in the Minh-Thi's paper?