> A superposition of all n bit integers is no big deal Is it? How do you do it? The papers I've seen so far shown that given enough measurements we can conclud

> A superposition of all n bit integers is no big deal Is it? How do you do it? The papers I've seen so far shown that given enough measurements we can conclude that the qbits ware in superposition in many cases. I still haven't seen any way to have superposition of all numbers from 0 to 2^n. What you're describing in the rest of your comment is solved by Shor's algorithm. It is quite straight-forward. If we can get the superposition as an input and have working quantum gates it would work. Similar how all we need to draw a square with -1 area is to take a line segment with a length of i, the rest is simple.