Qualtran
Qualtran copied to clipboard
Qᴜᴀʟᴛʀᴀɴ is a Python library for expressing and analyzing Fault Tolerant Quantum algorithms.
This is more of a feature request, but it looks like `HamiltonianSimulationByGQSP` doesn't have its own explicit control and uses the defaults for `.controlled()`. This gives errors like `DecomposeTypeError: Could...
Implements decomposition of ECAddR and ECPhaseEstimateR to match that of https://arxiv.org/abs/2306.08585. Removes MeasureQFT() bloq in favor of an actual QFT() bloq and a shimmed in Measure() bloq.
The docs still need a bit more TLC but they go over a complete example from scratch of how to build a unary iterator.
- sundry improvements to the cost expressions, including better comments on where they're from - example using the real 256 bit modulus, which reveals a problem with ModAdd(?) - fixes...
Not all bloq examples support tensor simulation. This report card automatically determines which bloq examples should be tensor simulable. - State vector simulation uses $2^n$ numbers to simulate a quantum...
Based on the execution fixture introduced in #1362 This times how long it takes to compute the qubit counts for each bloq example. Can be extended to also time the...
In #1388 , two off-by-one errors were encountered in the single factorization tests. Might be a rounding thing? Not blocking; @fdmalone to investigate at his leisure
`QubitCount` is currently computed by either decomposing the bloq or looking at it signature if the decomposition doesn't exist. Often, we want to write bloqs quickly with only a call...
#1383 is a shim. This notebook should probably be re-written to use QubitizationQPE bloq and the existing bloq examples everywhere.
## Uniform state preparation 1. inverting inequality tests should not need more toffolis #235 2. We are not using phase-gradient gate toffoli cost for Ry rotations 3. Small differences in...