Skip to content

Commit

Permalink
Deploying to gh-pages from @ 52c0c3e 🚀
Browse files Browse the repository at this point in the history
  • Loading branch information
GiggleLiu committed Nov 27, 2024
1 parent 5585ab9 commit 015dab5
Show file tree
Hide file tree
Showing 10 changed files with 453 additions and 203 deletions.
9 changes: 8 additions & 1 deletion Project.toml
Original file line number Diff line number Diff line change
Expand Up @@ -7,9 +7,16 @@ version = "0.4.0"
Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"
LuxorGraphPlot = "1f49bdf2-22a7-4bc4-978b-948dc219fbbc"

[weakdeps]
ProblemReductions = "899c297d-f7d2-4ebf-8815-a35996def416"

[extensions]
ProblemReductionsExt = "ProblemReductions"

[compat]
Graphs = "1.6"
LuxorGraphPlot = "0.5"
ProblemReductions = "0.1.1"
julia = "1"

[extras]
Expand All @@ -19,4 +26,4 @@ Random = "9a3f8284-a2c9-5f02-9a11-845980a1fd5c"
Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"

[targets]
test = ["Test", "Random", "GenericTensorNetworks", "LinearAlgebra"]
test = ["Test", "Random", "GenericTensorNetworks", "LinearAlgebra", "ProblemReductions"]
118 changes: 118 additions & 0 deletions ext/ProblemReductionsExt.jl
Original file line number Diff line number Diff line change
@@ -0,0 +1,118 @@
module ProblemReductionsExt

using UnitDiskMapping, UnitDiskMapping.Graphs
import ProblemReductions: reduceto, target_problem, extract_multiple_solutions
import ProblemReductions

function _to_gridgraph(g::UnitDiskMapping.GridGraph)
return ProblemReductions.GridGraph(getfield.(g.nodes, :loc), g.radius)
end
function _extract_weights(g::UnitDiskMapping.GridGraph{<:WeightedNode})
getfield.(g.nodes, :weight)
end

###### unweighted reduction
struct IndependentSetToKSG{NT, VT} <: ProblemReductions.AbstractReductionResult
mapres::MappingResult{NT}
weights::VT
end
function ProblemReductions.reduceto(::Type{ProblemReductions.IndependentSet{ProblemReductions.GridGraph{2}, Int, ProblemReductions.UnitWeight}}, problem::ProblemReductions.IndependentSet{GT, Int, ProblemReductions.UnitWeight} where GT<:SimpleGraph)
return IndependentSetToKSG(map_graph(UnWeighted(), problem.graph), problem.weights)
end

function ProblemReductions.target_problem(res::IndependentSetToKSG{<:UnWeightedNode})
return ProblemReductions.IndependentSet(_to_gridgraph(res.mapres.grid_graph))
end
function ProblemReductions.extract_solution(res::IndependentSetToKSG, sol)
return map_config_back(res.mapres, sol)
end

###### Weighted reduction
# TODO: rescale the weights to avoid errors
function ProblemReductions.reduceto(::Type{ProblemReductions.IndependentSet{ProblemReductions.GridGraph{2}, T, Vector{T}}} where T, problem::ProblemReductions.IndependentSet{GT} where GT<:SimpleGraph)
return IndependentSetToKSG(map_graph(Weighted(), problem.graph), problem.weights)
end
function ProblemReductions.target_problem(res::IndependentSetToKSG{<:WeightedNode})
graph = _to_gridgraph(res.mapres.grid_graph)
weights = UnitDiskMapping.map_weights(res.mapres, res.weights)
return ProblemReductions.IndependentSet(graph, weights)
end

###### Factoring ######
struct FactoringToIndependentSet{NT} <: ProblemReductions.AbstractReductionResult
mapres::FactoringResult{NT}
raw_graph::ProblemReductions.GridGraph{2}
raw_weight::Vector{Int}
vmap::Vector{Int}
problem::ProblemReductions.IndependentSet{ProblemReductions.GridGraph{2}, Int, Vector{Int}}
end
function ProblemReductions.reduceto(::Type{ProblemReductions.IndependentSet{ProblemReductions.GridGraph{2}, T, Vector{T}}} where T, problem::ProblemReductions.Factoring)
mres = map_factoring(problem.m, problem.n)
g = _to_gridgraph(mres.grid_graph)
ws = getfield.(mres.grid_graph.nodes, :weight)
mg, vmap = UnitDiskMapping.set_target(g, [mres.pins_zeros..., mres.pins_output...], problem.input << length(mres.pins_zeros))
return FactoringToIndependentSet(mres, g, ws, vmap, ProblemReductions.IndependentSet(mg, ws[vmap]))
end

function ProblemReductions.target_problem(res::FactoringToIndependentSet)
return res.problem
end

function ProblemReductions.extract_solution(res::FactoringToIndependentSet, sol)
cfg = zeros(Int, nv(res.raw_graph))
cfg[res.vmap] .= sol
i1, i2 = map_config_back(res.mapres, cfg)
return vcat([i1>>(k-1) & 1 for k=1:length(res.mapres.pins_input1)], [i2>>(k-1) & 1 for k=1:length(res.mapres.pins_input2)])
end

###### Spinglass problem to MIS on KSG ######
# NOTE: I am not sure about the correctness of this reduction. If you encounter a bug, please question this function!
struct SpinGlassToIndependentSet{NT} <: ProblemReductions.AbstractReductionResult
mapres::QUBOResult{NT}
end
function ProblemReductions.reduceto(::Type{ProblemReductions.IndependentSet{ProblemReductions.GridGraph{2}, T, Vector{T}}} where T, problem::ProblemReductions.SpinGlass{<:SimpleGraph})
n = length(problem.h)
M = similar(problem.h, n, n)
for (e, j) in zip(edges(problem.graph), problem.J)
M[e.src, e.dst] = M[e.dst, e.src] = j
end
return SpinGlassToIndependentSet(map_qubo(M, -problem.h))
end

function ProblemReductions.target_problem(res::SpinGlassToIndependentSet)
grid = _to_gridgraph(res.mapres.grid_graph)
ws = getfield.(res.mapres.grid_graph.nodes, :weight)
return ProblemReductions.IndependentSet(grid, ws)
end

function ProblemReductions.extract_solution(res::SpinGlassToIndependentSet, sol)
res = map_config_back(res.mapres, sol)
return 1 .- 2 .* Int.(res)
end

###### Spinglass problem on grid to MIS on KSG ######
# NOTE: the restricted layout is not implemented, since it is not often used
struct SquareSpinGlassToIndependentSet{NT} <: ProblemReductions.AbstractReductionResult
mapres::SquareQUBOResult{NT}
end
function ProblemReductions.reduceto(::Type{ProblemReductions.IndependentSet{ProblemReductions.GridGraph{2}, T, Vector{T}}} where T, problem::ProblemReductions.SpinGlass{ProblemReductions.GridGraph{2}})
g = problem.graph
@assert 1 <= g.radius < sqrt(2) "Only support nearest neighbor interaction"
coupling = [(g.locations[e.src]..., g.locations[e.dst]..., J) for (e, J) in zip(edges(g), problem.J)]
onsite = [(i, j, -h) for ((i, j), h) in zip(g.locations, problem.h)]
# a vector coupling of `(i, j, i', j', J)`, s.t. (i', j') == (i, j+1) or (i', j') = (i+1, j).
# a vector of onsite term `(i, j, h)`.
return SquareSpinGlassToIndependentSet(map_qubo_square(coupling, onsite))
end

function ProblemReductions.target_problem(res::SquareSpinGlassToIndependentSet)
grid = _to_gridgraph(res.mapres.grid_graph)
ws = getfield.(res.mapres.grid_graph.nodes, :weight)
return ProblemReductions.IndependentSet(grid, ws)
end

function ProblemReductions.extract_solution(res::SquareSpinGlassToIndependentSet, sol)
res = map_config_back(res.mapres, sol)
return 1 .- 2 .* Int.(res)
end
end
Loading

0 comments on commit 015dab5

Please sign in to comment.