Skip to content
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

Edit descriptions for transpiler plugin projects #595

Merged
merged 1 commit into from
Nov 21, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion ecosystem/resources/members/dsm-swap.toml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
name = "dsm-swap"
url = "https://github.com/qiskit-community/dsm-swap"
description = "A doubly stochastic matrices-based approach to optimal qubit routing"
description = "A doubly stochastic matrices-based approach to optimal qubit routing."
licence = "Apache License 2.0"
contact_info = "_No response_"
alternatives = "_No response_"
Expand Down
2 changes: 1 addition & 1 deletion ecosystem/resources/members/qiskit-bip-mapper.toml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
name = "qiskit-bip-mapper"
url = "https://github.com/qiskit-community/qiskit-bip-mapper"
description = "The repository contains a standalone routing stage plugin to use the BIPMapping [routing](https://qiskit.org/documentation/apidoc/transpiler.html#routing-stage) pass. The BIP mapping pass solves the routing and [layout](https://qiskit.org/documentation/apidoc/transpiler.html#layout-stage) problems as a binary integer programming (BIP) problem. The algorithm used in this pass is described in: G. Nannicini et al. \"Optimal qubit assignment and routing via integer programming.\" [arXiv:2106.06446](https://arxiv.org/abs/2106.06446)"
description = "This plugin solves the routing and layout problems as a binary integer programming (BIP) problem. This is an implementation of G. Nannicini et al. \"Optimal qubit assignment and routing via integer programming.\" (arXiv:2106.06446)."
licence = "Apache License 2.0"
contact_info = "itoko@jp.ibm.com"
alternatives = "_No response_"
Expand Down