Tried implementing the NAND-tree algorithm in Qiskit

I've been working on a Qiskit implementation of the NAND-tree quantum algorithm and thought I'd share it here. Right now it works with small finite trees. I implemented the quantum walk, the input oracle, query counting, and a few different ways of simulating the Hamiltonian. I've mostly been testing it on 2, 4, and 8 leaves. It's not a scalable implementation yet. Some parts still use dense Hamiltonian matrices, and figuring out how to get past that is one of the things I'm looking into. Here's the repo: https://github.com/mncrftfrcnm/qiskit-nand-tree-implementation If anyone here has worked with NAND-tree algorithms or quantum walks, I'd really appreciate feedback, especially if you spot something wrong with how I've handled the oracle or query counting. submitted by /u/FollowingEvery4802 [link] [comments]