Kevin J. Sung

The test was removed in #158 so this is an issue again. Not a high priority for me right now though.

The way OpenFermion currently tests notebooks doesn't test that the output is correct. I guess it's better than nothing though. I can easily add a test that simply runs the...

For starters, here are circuits for the term a^\dagger_p a^\dagger_{p+1} a_{p+2} a_{p+3} + h.c. =(JWT) - |0011>

I haven't looked very deeply into it, but I just assumed that we'd be able to adapt a classical FFT algorithm. The QFT is pretty different from the FFFT (with...

@Strilanc to answer your question about the creation/annihilation operators... What you said about mapping a basis state with one `1` and the rest `0`s is correct, assuming the Jordan-Wigner Transform....

The Cooley-Tukey algorithm actually works by recursively breaking N down into its factors N = N_1 * N_2 and performing smaller FFT's of size N_1 and N_2: https://en.wikipedia.org/wiki/Cooley%E2%80%93Tukey_FFT_algorithm#General_factorizations. The base...

The task here is to perform the transformation in Eq. (11) of https://arxiv.org/pdf/0804.1888.pdf. The right boxed part of Figure 1 shows the structure of the circuit when the number of...

Here is a short note I wrote on the operation of rotating together adjacent fermionic modes under the JWT. It might be useful for understanding what's going on. [givens_rotations.pdf](https://github.com/quantumlib/OpenFermion-Cirq/files/2634684/givens_rotations.pdf)

@Strilanc most of the extra build time from the tutorials is from the simulator, so the first thing is to upgrade the simulator.

>There's a limit on how much we can do for QuantumCircuit, because we can't really output something that can eval back to the input @jakelishman could you elaborate on this...