beneills / quantum Goto Github PK

End users should be able to run this.

The solution is to package a thin binary, which:

• accepts a script as input
• which is in some common language, like IBM's
• reads this line-by-line and dispatches equivalent library calls

We need to allow, e.g. a reversed control-not gate.

At the moment the gates::* implementations are set to use, e.g. the first qubit as a control.

The solution is to allow gate transformations which will do things like permute underlying matrix rows/columns. Then we could change the interfaces to accepting parameters.

We should add some benchmarking using the best-practice Rust solution.

This will allow us to:

• measure current performance
• stop us regressing performance
• justify our README claim of efficiency

Hi!

I saw that your project needs a check for the input matrix to be unitary, in some of its parts.
I came across the nalgebra crate, which provides a framework for linear algebra.
In particular, they provide a nice trick to avoid checks for unity, by exposing a Unit wrapper.

Hopefully, may this help you in your project!

Best,

Filippo.

I am getting the following error:

Updating registry `https://github.com/rust-lang/crates.io-index`
error: no matching version `^0.1.3` found for package `quantum` (required by `quantum`)
location searched: registry `https://github.com/rust-lang/crates.io-index`
versions found: 0.1.2, 0.1.0

Thank you & BR,

Maciej