PUZZLE #5270: Quantum Gate Cipher (diff 2)
Each letter of the answer is encoded as a single-qubit quantum state. A sequence of 4 quantum gates (Y, T, S, T) rotates each state. Apply the inverse gates in reverse order to recover the original letters.
DATA
| Gates |
Y, T, S, T
|
| Final States |
[[0.0, -1.0], [0.0, 0.0]], [[0.0, -0.9927088741], [0.0, 0.1205366803]], [[0.0, 0.464723172], [0.0, 0.8854560257]], [[0.0, -0.2393156643], [-0.0, -0.9709418174]], [[0.0, -0.9709418174], [-0.0, -0.2393156643]], [[0.0, -0.9927088741], [0.0, 0.1205366803]], [[0.0, -1.0], [0.0, 0.0]], [[0.0, -0.8229838659], [-0.0, -0.5680647467]], [[0.0, -1.0], [0.0, 0.0]], [[0.0, -0.6631226582], [-0.0, -0.7485107482]]
|
| Hint |
Quantum gate cipher — difficulty 2. Gate sequence (4 gates): Y -> T -> S -> T. 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 2
— website sponsored —
[ ad space ]