An efficient and deterministic approach for preparing the superposition state | Ψ Ψ ⟩ ⟩ = 1 N ∑ ∑ j = 0 N − − 1 | j ⟩ ⟩ with a gate complexity and circuit depth of only O ( log 2 ⁡ ⁡ N ) for all N was recently presented. This approach requires only n = ⌈ ⌈ log 2 ⁡ ⁡ N ⌉ ⌉ qubits. Importantly, neither ancilla qubits nor any quantum gates with multiple controls are needed in this approach for creating the uniform superposition state | Ψ Ψ ⟩ ⟩ .