Skip to content

[CQT-462] Write MIP mapper User documentation - #708

Open
rares1609 wants to merge 2 commits into
developfrom
CQT-462-Write-MIP-mapper-User-documentation
Open

[CQT-462] Write MIP mapper User documentation#708
rares1609 wants to merge 2 commits into
developfrom
CQT-462-Write-MIP-mapper-User-documentation

Conversation

@rares1609

Copy link
Copy Markdown
Contributor

No description provided.

@rares1609
rares1609 requested review from elenbaasc and a lite review from Copilot and removed request for Copilot August 25, 2026 09:02
@elenbaasc elenbaasc changed the title add MIPMapper documentation [CQT-462] Write MIP mapper User documentation Aug 28, 2026

@elenbaasc elenbaasc left a comment

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Looks good, nice description and examples!

Just a few minor comments. Make sure to add tests for the examples and an entry to the Changelog 🙂

Comment thread mkdocs.yaml
- Analysis:
- Analysis: compilation-passes/analysis/index.md
- Circuit analyzer: compilation-passes/analysis/circuit-analyzer.md
- Decomposition:

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Strange that the Measure decomposer is not there...?? It should be there in develop. It seems like this branch either does not have the latest changes in develop, or it does not compare to the latest version of develop...

Comment on lines +18 to +19
It is also computes the distance $d_{kl}$ between every pair of physical qubits $k$ and
$l$, i.e. the length of the shortest path between them in the connectivity graph, using

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
It is also computes the distance $d_{kl}$ between every pair of physical qubits $k$ and
$l$, i.e. the length of the shortest path between them in the connectivity graph, using
It also computes the distance $d_{kl}$ between every pair of physical qubits $k$ and
$l$, _i.e._ the length of the shortest path between them in the connectivity graph, using

CNOT q[1], q[2]
```

The connectivity above is a line, so physical qubit `1` is the only one with two

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
The connectivity above is a line, so physical qubit `1` is the only one with two
The connectivity above represents a linear array, so physical qubit `1` is the only one with two


The connectivity above is a line, so physical qubit `1` is the only one with two
neighbours.
Virtual qubit `0` is the one interacting with both others, so it is placed there,

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
Virtual qubit `0` is the one interacting with both others, so it is placed there,
Virtual qubit `0` interact with both virtual qubits `1` and `2`, so it is placed on the position of physical qubit `1`,

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants