Eric Peterson
Eric Peterson
I don’t find this simple example too simple at all.
Definitely! The business case is the one described in VII.A here: https://arxiv.org/pdf/1904.10541.pdf . The "searching" compiler templates in `src/compilers/approx.lisp` currently use a high-dimensional Nelder-Mead instance to optimize a function over...
Sounds quite tricky to arrange in RPCQ.
I don’t feel that this is something to be fixed. The “controlled” construction doesn't descend to an operation from PU(2^n) to PU(2^(n+1)), and that situation just is what it is....
QISKit deals with this by adding an explicit phase slot to their circuits, so that if a compiler replaces the G in CONTROLLED G with a H1 … Hn, it...
I'm sorry this has been such a headache. On the bright side, this is an _excellent_ bug report.
I regret to say I've also seen this (second) error and failed to file a report about it.
if u say so
Here's a related paper that also makes use of certain Hamiltonians' large isotropy groups: https://arxiv.org/abs/2104.00728 .
Good idea. Also, there are “ladder SWAP” constructors already written that would almost certainly make this the simplest option to implement.