PUZZLE #3238: 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, H, Y, H, T) rotates each state. Apply the inverse gates in reverse order to recover the original letters.
DATA
| Gates |
X, H, Y, H, T
|
| Final States |
[[0.0, -0.8854560257], [0.3286089063, -0.3286089063]], [[0.0, 1.0], [0.0, 0.0]], [[0.0, -0.8229838659], [0.4016824346, -0.4016824346]], [[0.0, 0.8854560257], [0.3286089063, -0.3286089063]], [[0.0, 0.8229838659], [0.4016824346, -0.4016824346]], [[0.0, -0.7485107482], [0.4688985284, -0.4688985284]], [[0.0, -0.0], [0.7071067812, -0.7071067812]], [[0.0, 0.9709418174], [0.1692217291, -0.1692217291]], [[0.0, -0.6631226582], [0.5292770258, -0.5292770258]], [[0.0, 0.5680647467], [0.5819374724, -0.5819374724]], [[0.0, -0.1205366803], [0.7019511766, -0.7019511766]], [[0.0, -0.0], [0.7071067812, -0.7071067812]]
|
| Hint |
Quantum gate cipher — difficulty 3. Gate sequence (5 gates): X -> H -> Y -> H -> T. Word length: 12 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: Replenishment audit: quantum diff 3
— website sponsored —
[ ad space ]