1. The work is "easy" or "trivial"
I disagree. It does not scale the way we want yet for coherent control gates but we were able to scale the terminal QFT accurately by using Graph Theory on a classical computer vs matrix mechanics. That is an alternate algorithm at the least so not very easy. For example, if someone told you go implement the terminal QFT on a classical computer using graph theory how quickly do you think you could have done it? Or even better, what if I tell you now "implement an alternate scalable terminal QFT algorithm on a classical computer without using QuDot Nets" how easy do you view that question?
2. Maybe I did not explain the IF BPP=BQP argument well
IF BPP=BQP, and that is a BIG IF, then it is very likely that a different deterministic theory could reproduce the randomness in quantum mechanics. We are not saying that quick sort isn't random, we are saying that quick sort can be replaced by a non random algorithm. Why? because there is much evidence that P=BPP which implies that randomized algorithms can have equivalent non-random algorithms. Similar to how the primality testing algorithm was shown to have a non-random equivalent. "Quantum computing from Democritus" does a nice job of explaining this.
Lastly, it could be that this graph algorithm of quantum computing will never be able to scale coherent control gates. But at the very least we came up with an alternate algorithm to do quantum computing on a classical device. Not completely worthless right? What else are you going to do on a Saturday night? :-)
Thanks again for feedback, even though it was negative