Skip to content

Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid

License

Notifications You must be signed in to change notification settings

QuEraComputing/UnitDiskMapping.jl

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

UnitDiskMapping

Dev CI codecov

UnitDiskMapping is a   Julia Language   package for reducing a generic maximum (weighted) independent set problem, quadratic unconstrained binary optimization (QUBO) problem or integer factorization problem to a maximum independent set problem on a unit disk grid graph (or hardcore lattice gas in physics), which can then be naturally encoded in neutral-atom quantum computers.

Installation

To install UnitDiskMapping, please open Julia's interactive session (known as REPL) and press the ] key in the REPL to use the package mode, and then type the command below:

pkg> add UnitDiskMapping

Usage

Please check the documentation or PRXQuantum.4.010316

Supporting and Citing

Much of the software in this ecosystem was developed as a part of an academic research project. If you would like to help support it, please star the repository. If you use our software as part of your research, teaching, or other activities, we would like to request you to cite our work. The CITATION.bib file in the root of this repository lists the relevant papers.

About

Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •