4 ms·
Yup, I am a big fan of Stim, and work on similar tools in Julia. It is awesome to be able to run 1Gqubit Pauli multiplication in a few milliseconds, however I f
by krastanov 5y ago
Yup, I am a big fan of Stim, and work on similar tools in Julia. It is awesome to be able to run 1Gqubit Pauli multiplication in a few milliseconds, however I feel it is reasonable to call this "boring" high-performance libraries given how "fortran-ie" they still feel. Even if the application of these libraries is not boring at all (I have seen what Stim can do).
- Strilanc 5y agoAh, you're that krastanov. https://github.com/Krastanov/QuantumClifford.jl/commit/aafd5806fdace9be04be4a72cf135e398d8d092b https://github.com/Krastanov/QuantumClifford.jl/commit/aafd5... Hey, when everyone else is falling back to "oh we just simulate the hard cases to verify them", making simulation faster is making verification better.
- krastanov 5y agoYou are right. And, practically, I probably will be using Stim much more in the next few years than this particular toy language. Same as you, I hope this toy language leads to more research in useful type theory for quantum algos.