Draft:Uniform Quantum Superposition States

• Comment: There is a section called "uniform quantum superposition states" in Quantum superposition, and the contents of this submitted draft overlap significantly with that section. It is not clear that a separate article is justified. Rkieferbaum (talk) 16:58, 28 June 2024 (UTC)

---

Uniform quantum superposition states are specific cases of superposition, where all the basic states involved have equal weight. Research on preparing and utilizing these states is ongoing, comprising methods for automatic preparation and quantum algorithms.

Overview

Uniform quantum superposition states are a fundamental concept in quantum mechanics, representing a state where a quantum system exists in a linear combination of multiple basis states, with each basis state contributing equally to the overall superposition.

Definition

In the context of an $n$-qubit system, a uniform quantum superposition state is defined as: $$|\Psi \rangle ={\frac {1}{\sqrt {N}}}\sum _{j=0}^{N-1}|j\rangle$$ Here, $|j\rangle$ represents the computational basis states of the $n$-qubit system, and $N$ is the total number of distinct states in the superposition. The normalization factor ${\frac {1}{\sqrt {N}}}$ ensures that the total probability of finding the system in one of the basis states is equal to 1.

Importance in Quantum Computation

Uniform superposition states play a crucial role in quantum computation algorithms. They are often utilized as initial states or intermediate states during quantum computations. The ability to efficiently prepare uniform superposition states is essential for the implementation of various quantum algorithms (e.g., Grover's algorithm, Quantum Fourier Transform), as it impacts the overall efficiency and success of quantum computations.

Preparation of uniform quantum superposition states when $N=2^{n}$

Further information: Quantum gate § Hadamard gate

For an $n$-qubit system, Hadamard gates acting on each of the $n$ qubits (each initialized to the $|0\rangle$) can be used to prepare uniform quantum superposition states when $N$ is of the form $N=2^{n}$. In this case case with $n$ qubits, the combined Hadamard gate $H_{n}$ is expressed as the tensor product of $n$ Hadamard gates: $H_{n}=\underbrace {H\otimes H\otimes \ldots \otimes H} _{n{\text{ times}}}$

The resulting uniform quantum superposition state is then: $H_{n}|0\rangle ^{\otimes n}={\frac {1}{\sqrt {2^{n}}}}\sum _{j=0}^{2^{n}-1}|j\rangle$ This generalizes the preparation of uniform quantum states using Hadamard gates for any $N=2^{n}$.

Measurement of this uniform quantum state results in a random random state between $|0\rangle$ and $|N-1\rangle$.

Examples:

Example 1: $N=2$

For a system with $n=1$ qubit, the Hadamard gate is applied to the single qubit:

$H_{1}=H$

Applying $H_{1}$ to $|0\rangle$ yields the uniform quantum superposition state: ${\frac {1}{\sqrt {2}}}(|0\rangle +|1\rangle )$

Example 2: $N=4$

For a system with $n=2$ qubits, the combined Hadamard gate $H_{2}$ is the tensor product of two Hadamard gates:

$H_{2}=H\otimes H$

Mathematically, this is expressed as:

$$H_{2}={\frac {1}{2}}{\begin{bmatrix}1&1&1&1\\1&-1&1&-1\\1&1&-1&-1\\1&-1&-1&1\end{bmatrix}}$$ Applying $H_{2}$ to $|00\rangle$, yields the superposition states with equal weights.

Preparation of uniform quantum superposition states in the general case, $N$ ≠ $2^{n}$

An efficient and deterministic approach for preparing the superposition state $$|\Psi \rangle ={\frac {1}{\sqrt {N}}}\sum _{j=0}^{N-1}|j\rangle$$ with a gate complexity and circuit depth of only $O(\log _{2}N)$ for all $N$ was recently presented. This approach requires only $n=\lceil \log _{2}N\rceil$ qubits. Importantly, neither ancilla qubits nor any quantum gates with multiple controls are needed in this approach for creating the uniform superposition state $|\Psi \rangle$.

References

Sources

• Nielsen, Michael A.; Chuang, Isaac (2000). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. ISBN 0521632358. OCLC 43641333.
• Williams, Colin P. (2011). Explorations in Quantum Computing. Springer. ISBN 978-1-84628-887-6.
• Yanofsky, Noson S.; Mannucci, Mirco (2013). Quantum computing for computer scientists. Cambridge University Press. ISBN 978-0-521-87996-5.

Category:Quantum superposition Category:Quantum gates Category:Quantum information science