Quantum Computing Stack Exchange is a question and answer site for engineers, scientists, programmers, and computing professionals interested in quantum computing. It only takes a minute to sign up.
Sign up to join this community
Let's say my algorithm starts with the qubit state $|0^N\rangle$. Is there a possibility to end up in a superposition where every component is made of a bitstring containing exactly an $1$ at on position and only $0$'s on every other position, i.e. $\frac{1}{\sqrt{2}^N} (|1,0^{N-1}\rangle + |01,0^{N-2}\rangle + ...+|0^{N-1},1\rangle)$
I would like to only use the standard gates/unitary transformations: $X,Y,Z,H, \text{CNOT}$
It is not possible to construct the above state using the specified gates. States that can be prepared using these gates are called stabilizer states. To quote this stack exchange post, "for a stabilizer state, the 1-site reduced density matrices must be maximally mixed or pure, which [W states, like the one on your question] aren't."
