CParitySwap - Githubissues

Pitt-JonesLab / slam_decomposition

Numerical optimizers for decomposing unitary ops, or Hamiltonian parameter sweeping

MIT License

4 stars 1 forks source link

CParitySwap #1

Closed evmckinney9 closed 1 year ago

evmckinney9 commented 2 years ago

[x] Build target 3Q cyclic SWAP unitary
[x] Use Hamiltonian to see if feasible to build target cyclic SWAP unitary
[x] Sweep g, phi terms
[x] Advanced optimization sweep (ML?), with time-dependent g and phi
[x] Of possible gates we can build, are they entangling/universal?

Reference: https://journals.aps.org/prx/pdf/10.1103/PhysRevX.5.041020 https://arxiv.org/pdf/1301.1696.pdf

evmckinney9 commented 2 years ago

[x] CRotate gate, see if we can build a known 3Q using 1Q gates on both sides

evmckinney9 commented 2 years ago

[x] make sure we can move from .99 to 1

evmckinney9 commented 2 years ago

Now we know we can construct this gate, but we still aren't sure how to decomp with it. One way, but not ideal, is to measure its Haar random decomposition power. Preliminary testing shows that we need 10 uses of this gate to build Haar random. If we want to test how many gates we need if we can include 3Q+2Q+1Q that's challenging because how do you report the total count of gates (i.e. 2Q and 3Q gates weigh the same in the count)? Also, we don't have a clear way to build the template for 3Q+ numerical decomps since a new degree of freedom in addition to mixed bag gates you have mixed bag edges.

evmckinney9 commented 2 years ago

[ ] need to use more powerful synthesizer tools to come up with a good list of cparityswap identities
[ ] find an algorithm that uses cparityswap gate (see #5)
[ ]