My quantum computing proof

 

My quantum computing proof is coming along!  It looks very salvageable.  I am planning to take some internet courses.  I am taking one very excellent one that I think will help me get a very good job within a few months :).  Later, I'll take another one on academic publishing, and publish my quantum computing paper, that shows that there are is a sort of way to place the modular square root problem in BQP.  The catch is, I need another oracle, so really, given that language X, it's, NP is a subset of BQP^X.  The good news is, although X is not known to be in polynomial time, in practice, it's typically easy to compute.


No more updates for now!

Comments

Popular posts from this blog

Math Update: My P != NP Proof Might Be Correct!!!!! -- (update, no it's not, see the note at the beginning and the updates near the bottom)

Hello, Texas - A Quick Monopoly Lesson

Flash Non-Fiction: James Bond and Masculinity