heavy hex graph generators from number of nodes

Open
#573 2 comments 0 reactions 1 assignee View on GitHub

@enavarro51 is already working on this.

Since Jan 17, 2023.

Assessment

This issue has not been assessed yet.

Description

enhancement
What is the expected enhancement?

Currently the heavy hex graphs accept a d which is the code distance for the quantum error correction code that can run on them. Since retworkx is supposed to be a standalone library, I think it would be useful to allow building generic heavy hex graphs that are not explicitly tied to quantum error correction. The other motivation is that with the current d parameter the number of qubits rise very rapidly, i.e. they go 19, 57, 115, 193, 291, 409, 547, .... This makes it hard for example to build a 27-node graph in the heavy-hex style.

So the request is to expose another parameter (n) which is number of nodes. From that one could find the appropriate number of heavy-hex tiles and the maximum d that can fit in that n. Any outstanding nodes can just be added to the periphery (in a way that it becomes a subset of the graph for the next d).

Dominant language
Rust
Stars
1.8k
Forks
220
Avg merge
3d 16h
Merged PRs (30d)
3

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from Qiskit/rustworkx

All issues in Qiskit/rustworkx

Similar issues

More Rust issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.