-
Notifications
You must be signed in to change notification settings - Fork 3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
how to do automatic simplification (tries)? #49
Comments
The reduction in this package is a generic one. Although the method claims to be "optimal up to a constant factor", which can be far from the optimal. Post-processing based on the mapped graph may help. However, it is not considered a lot in this package. |
Thank you @GiggleLiu for your quick response.
and that those rulesets (and maybe added rulesets by me) are working on the grid-(string-)representation (local?)? is there / do you have an example of using methods of simplifiers.jl on a grid > (4,3) (as in tests)? |
You are right. The simplification rules will be applied repeatedly and locally on the grid. Currently, only the rule of removing dangling edges are considered in the package. I think the grid size is not an issue. Here is an example of calling simplifier explicitly: UnitDiskMapping.jl/test/mapping.jl Line 40 in 4ef1965
|
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 graph for 4 qbits:
as far as I understand, the simplest implementation to a unit-disk graph should be just 2x2 atoms connected to each other (left upper corner). surely the automatic mapping creates something much more complicated (
unweighted_res = map_graph(graph; vertex_order=MinhThiTrick());
):how do I apply simplification on this mapping?
i tried
unweighted_res2 = map_graph( UnWeighted(), graph, vertex_order=MinhThiTrick(), ruleset=UnitDiskMapping.default_simplifier_ruleset(UnWeighted()))
(did not find functions for vertex-reordering).
The text was updated successfully, but these errors were encountered: