PUZZLE #9586: Quantum Gate Cipher (diff 3)
Each letter of the answer is encoded as a single-qubit quantum state. A sequence of 5 quantum gates (Z, X, S, S, H) rotates each state. Apply the inverse gates in reverse order to recover the original letters.
DATA
| Gates |
Z, X, S, S, H
|
| Final States |
[[-0.7071067812, 0.0], [-0.7071067812, 0.0]], [[-0.6167188726, 0.0], [-0.7871834806, 0.0]], [[0.9547208665, 0.0], [-0.2975030539, 0.0]], [[-0.8557812723, 0.0], [0.5173378142, 0.0]], [[-0.8557812723, 0.0], [-0.5173378142, 0.0]], [[-0.6167188726, 0.0], [-0.7871834806, 0.0]], [[-0.7071067812, 0.0], [-0.7071067812, 0.0]], [[-0.9836199069, 0.0], [-0.1802550378, 0.0]], [[-0.7071067812, 0.0], [-0.7071067812, 0.0]], [[-0.9981755542, 0.0], [0.0603784974, 0.0]]
|
| Hint |
Quantum gate cipher — difficulty 3. Gate sequence (5 gates): Z -> X -> S -> S -> H. Word length: 10 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
— website sponsored —
[ ad space ]