{"id":16731203,"url":"https://github.com/krastanov/qevo","last_synced_at":"2025-04-10T11:13:30.448Z","repository":{"id":147594429,"uuid":"115594209","full_name":"Krastanov/qevo","owner":"Krastanov","description":"Optimization algorithm for the creation of quantum entanglement purification (distillation) circuits.","archived":false,"fork":false,"pushed_at":"2020-05-31T21:02:50.000Z","size":49475,"stargazers_count":13,"open_issues_count":0,"forks_count":2,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-03-24T10:06:10.514Z","etag":null,"topics":["entanglement","genetic-algorithm","optimization","quantum-circuit","quantum-computing"],"latest_commit_sha":null,"homepage":"https://qevo.krastanov.org","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Krastanov.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2017-12-28T06:47:12.000Z","updated_at":"2025-02-02T15:50:11.000Z","dependencies_parsed_at":"2023-05-31T17:31:10.961Z","dependency_job_id":null,"html_url":"https://github.com/Krastanov/qevo","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/Krastanov%2Fqevo","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Krastanov%2Fqevo/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Krastanov%2Fqevo/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Krastanov%2Fqevo/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Krastanov","download_url":"https://codeload.github.com/Krastanov/qevo/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248208567,"owners_count":21065203,"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":["entanglement","genetic-algorithm","optimization","quantum-circuit","quantum-computing"],"created_at":"2024-10-12T23:36:13.170Z","updated_at":"2025-04-10T11:13:30.431Z","avatar_url":"https://github.com/Krastanov.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"Optimized Quantum Entanglement\n\n`qevo.py` provides a small python library for the creation and optimization of\nquantum entanglement purification circuits.\n\n`Clifford.jl` is a higly-optimized julia library for enumerating and studying\nthe Clifford group of multiple qubits.\n\n`examples` contains multiple notebooks showcasing the use of these libraries.\nSome of these files were used in the writing of the related paper.\n\n- `Example` shows how to run a simple optimization for the creation of\n  purification circuits.\n\n- `Compare_Regimes` shows that for different parameter regimes (i.e. error\n  models) different circuits are better.\n\n- `HotCold` shows how to augment the library to work with custom error models\n  and hardware architectures. In this case we optimize for a register that has\n  only one \"hot\" qubit (a communication qubit capable of establishing initial remote\n  entanglement).\n\n- `OptimizeHashingYield` shows how to optimize for the hashing yield (defined\n  only for perfect local operations). It is of great theoretical interest in\n  the study of assymptotic circuits, but it is less useful in our case of small\n  circuits optimized for operational errors.\n\n- `Structure_ParallelNaiveCoarseDividing` and `julia-subgroup` are used to\n  enumerate and study the group structure of the Clifford/Permutation\n  operations used in the purification circuits.\n\nSee [qevo.krastanov.org](https://qevo.krastanov.org) for visualizations and\ncomparisons of circuits generated by this software.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkrastanov%2Fqevo","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkrastanov%2Fqevo","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkrastanov%2Fqevo/lists"}