PUZZLE #4604: Quantum Gate Cipher (diff 6)
Each letter of the answer is encoded as a single-qubit quantum state. A sequence of 8 quantum gates (T, Y, X, H, Y, X, H, X) rotates each state. Apply the inverse gates in reverse order to recover the original letters.
DATA
| Gates |
T, Y, X, H, Y, X, H, X
|
| Final States |
[[0.1205366803, 0.0], [0.7019511766, 0.7019511766]], [[-0.9927088741, 0.0], [0.085232304, 0.085232304]], [[0.5680647467, 0.0], [0.5819374724, 0.5819374724]], [[-0.8854560257, 0.0], [0.3286089063, 0.3286089063]], [[0.464723172, 0.0], [0.6261119602, 0.6261119602]], [[0.8229838659, 0.0], [0.4016824346, 0.4016824346]], [[-1.0, 0.0], [0.0, 0.0]], [[-0.9927088741, 0.0], [0.085232304, 0.085232304]], [[-0.2393156643, 0.0], [0.6865595432, 0.6865595432]], [[-0.8854560257, 0.0], [0.3286089063, 0.3286089063]]
|
| Hint |
Quantum gate cipher — difficulty 6. Gate sequence (8 gates): T -> Y -> X -> H -> Y -> X -> H -> X. 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 6
— website sponsored —
[ ad space ]