Timeline for Creating a uniform superposition of a subset of basis states
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9 at 4:18 | comment | added | akkapi | Note that the paper of Shukla & Vedula (arxiv.org/abs/2306.11747) achieves a superposition of computational basis states $| k_1 \rangle , \ldots, | k_M \rangle$ if $k_j = j - 1$, meaning only for the initial segment $[0, M - 1] \subset [0, 2^n - 1]$. The improvement over just Hadamard gates is that $M$ need not be a power of $2$ here. This doesn't quite answer the question of the OP, since there the subset can be arbitrary. Interestingly, this was recently overlooked elsewhere (see journals.aps.org/pra/pdf/10.1103/PhysRevA.110.056401) attempting to use Shukla-Vedula. | |
| Apr 10 at 12:26 | review | Late answers | |||
| Apr 10 at 18:21 | |||||
| Apr 10 at 12:17 | history | edited | Martin Vesely | CC BY-SA 4.0 |
added 6 characters in body
|
| S Apr 10 at 12:04 | review | First answers | |||
| Apr 10 at 18:20 | |||||
| S Apr 10 at 12:04 | history | answered | Quantum_Brains | CC BY-SA 4.0 |