{"id":22668362,"url":"https://github.com/lanl/parallel-quantum-annealing","last_synced_at":"2025-04-12T11:04:15.111Z","repository":{"id":44874202,"uuid":"420540617","full_name":"lanl/Parallel-Quantum-Annealing","owner":"lanl","description":"Parallel Quantum Annealing","archived":false,"fork":false,"pushed_at":"2023-01-07T03:57:30.000Z","size":1980,"stargazers_count":8,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"main","last_synced_at":"2024-06-27T00:19:56.052Z","etag":null,"topics":["dwave","graph-embedding","maximum-clique","parallel-quantum-annealing","quantum-annealing","quantum-computing"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lanl.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-10-23T22:58:05.000Z","updated_at":"2024-06-26T04:46:17.000Z","dependencies_parsed_at":"2023-02-06T11:16:18.349Z","dependency_job_id":null,"html_url":"https://github.com/lanl/Parallel-Quantum-Annealing","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lanl%2FParallel-Quantum-Annealing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lanl%2FParallel-Quantum-Annealing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lanl%2FParallel-Quantum-Annealing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lanl%2FParallel-Quantum-Annealing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lanl","download_url":"https://codeload.github.com/lanl/Parallel-Quantum-Annealing/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":228911888,"owners_count":17990774,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dwave","graph-embedding","maximum-clique","parallel-quantum-annealing","quantum-annealing","quantum-computing"],"created_at":"2024-12-09T15:14:51.229Z","updated_at":"2024-12-09T15:14:51.948Z","avatar_url":"https://github.com/lanl.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Parallel Quantum Annealing\n\nThe Arxiv version of the paper can be found [here](https://arxiv.org/abs/2111.05995)\n\nThe classical exact solver we used to compare to D-Wave Advantage 1.1 was the fast maximum clique (fmc) solver. This solver can be downloaded [here](http://cucis.ece.northwestern.edu/projects/MAXCLIQUE/download.html)\n\n```generate_disjoint_clique_embeddings.py``` generates all-to-all connectivity minor embeddings for different quantum annealing hardware connectivities.\n\n```create_random_QUBOs.py``` generates test random graphs and their corresponding Maximum Clique QUBOs.\n\n```fmc_utils.py``` are utility functions for using fmc.\n\n```get_exact_solutions.py``` computes all maximum cliques using brute force classical clique enumeration methods in Networkx.\n\n```run_QA.py``` Calls D-Wave in order to solve the set of test problems using both sequential and parallel QA.\n\n```run_fmc.py``` Solves the test problems exactly using fmc, and records the time this computation used.\n\n`hardware_edges/` contains reference connectivites for the two D-Wave QA backends (DW_2000Q_LANL and Advantage_system1.1).\n\n### Directories with Figures\n\nThe directories `figures_MaxClique_DW_2000Q_LANL_results/` and `figures_MaxClique_Advantage_system1.1_results/` both contain Time-to-Solution and ground state proportion figures and comparisons to the classical fmc solver for Maximum Clique. \n\nThe directory `figures_disjoint_minor_embeddings` contains renderings of the disjoint all-to-all minor embeddings. \n\nThe directory `figures_embedding_sizes` contains figures which provide information on the minor embedding sizes and chain lengths. \n\n## Authors\n- [Elijah Pelofske](mailto:epelofske@lanl.gov): Information Sciences, Los Alamos National Laboratory\n- [Georg Hahn](mailto:ghahn@hsph.harvard.edu): T.H. Chan School of Public Health, Harvard University\n- [Hristo Djidjev](mailto:hdjidjev@msn.com): Information Sciences, Los Alamos National Laboratory and Institute of Information and Communication Technologies, Sofia, Bulgaria\n\n\n## How to cite Parallel Quantum Annealing?\n```latex\n@article{pelofske2022parallel,\n  title={Parallel quantum annealing},\n  author={Pelofske, Elijah and Hahn, Georg and Djidjev, Hristo N},\n  journal={Scientific Reports},\n  volume={12},\n  number={1},\n  pages={1--11},\n  year={2022},\n  publisher={Nature Publishing Group},\n  doi={s41598-022-08394-8}\n}\n```\n\n## Copyright Notice:\n© 2021. Triad National Security, LLC. All rights reserved.\nThis program was produced under U.S. Government contract 89233218CNA000001 for Los Alamos\nNational Laboratory (LANL), which is operated by Triad National Security, LLC for the U.S.\nDepartment of Energy/National Nuclear Security Administration. All rights in the program are\nreserved by Triad National Security, LLC, and the U.S. Department of Energy/National Nuclear\nSecurity Administration. The Government is granted for itself and others acting on its behalf a\nnonexclusive, paid-up, irrevocable worldwide license in this material to reproduce, prepare\nderivative works, distribute copies to the public, perform publicly and display publicly, and to permit\nothers to do so.\n\n**LANL C Number: C21027**\n\n## License:\nThis program is open source under the BSD-3 License.\nRedistribution and use in source and binary forms, with or without modification, are permitted\nprovided that the following conditions are met:\n1. Redistributions of source code must retain the above copyright notice, this list of conditions and\nthe following disclaimer.\n \n2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions\nand the following disclaimer in the documentation and/or other materials provided with the\ndistribution.\n \n3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse\nor promote products derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\nIS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\nPURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\nOR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\nWHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\nOTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flanl%2Fparallel-quantum-annealing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flanl%2Fparallel-quantum-annealing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flanl%2Fparallel-quantum-annealing/lists"}