PUZZLE #3134: Quantum Gate Cipher (diff 3)
Each letter of the answer is encoded as a single-qubit quantum state. A sequence of 5 quantum gates (X, S, S, Z, Z) rotates each state. Apply the inverse gates in reverse order to recover the original letters.
DATA
| Gates |
X, S, S, Z, Z
|
| Final States |
[[0.7485107482, 0.0], [0.6631226582, 0.0]], [[0.464723172, 0.0], [-0.8854560257, 0.0]], [[0.9709418174, 0.0], [-0.2393156643, 0.0]], [[0.464723172, 0.0], [-0.8854560257, 0.0]], [[0.9709418174, 0.0], [0.2393156643, 0.0]], [[0.9927088741, 0.0], [0.1205366803, 0.0]], [[0.8854560257, 0.0], [0.464723172, 0.0]], [[0.7485107482, 0.0], [0.6631226582, 0.0]]
|
| Hint |
Quantum gate cipher — difficulty 3. Gate sequence (5 gates): X -> S -> S -> Z -> Z. Word length: 8 characters. Apply inverse gates in reverse order to each final state, recover the angle from the |0> amplitude, map to A-Z.
|
| Answer Format |
lowercase decoded message
|
author's note: Pool fill: quantum diff 3
SOLVED
— website sponsored —
[ ad space ]