Eric Peterson
Eric Peterson
The random unitary chosen in `warm-up-addresser-state` is mismatched with the stated goal of the slot it populates. Namely, it claims to calculate a 'worst case' cost for any unitary operation...
This meta-issue contains a roadmap for implementing various features in the compiler related to `HARDWARE-OBJECT`s of order ≥ 2, which includes such existing GH Issues as #23 and #118. This...
The current implementation of this function was written under time pressure and could stand to be cleaned up. For example, using an actual queue would let us write the function...
Huang et al. recently produced an optimal compilation technique for XY(pi/4) = \sqrt{ISWAP}, which quilc still compiles using numerical search, despite this being a native interaction on certain Rigetti devices....
The diagonal compiler included as part of #498 makes its choice of where to insert `CNOT`s based solely on most frequently sighted `ZZ` Pauli pairs. This has the benefit of...
The cost function currently used by the fidelity addresser (`src/addresser/fidelity-addresser.lisp`) weights which qubits and links have good execution properties based on the respective gate fidelities, as opposed to the temporal...
https://arxiv.org/abs/1003.5760 contains efficient state preparation schemes for other small numbers of qubits beyond 1 and 2. Implement them!
The function `pprint-aqvm`, which was largely lifted from the QVM project, contains code which handsomely prints wavefunctions. It would be helpful to be able to handsomely print wavefunctions that _aren't_...
There's no perceivable gain to this over just erroring with the relevant condition.
There isn't much in the way of examples of standard Quil. For that reason, I think it would be helpful to give several equivalent definitions of gates in `stdgates.quil`, hidden...