PUZZLE #3567: Quantum Gate Cipher (diff 7)
Each letter of the answer is encoded as a single-qubit quantum state. A sequence of 9 quantum gates (X, Y, X, T, H, Y, X, Y, T) rotates each state. Apply the inverse gates in reverse order to recover the original letters.
DATA
| Gates |
X, Y, X, T, H, Y, X, Y, T
|
| Final States |
[[-0.2840323734, -0.297905099], [0.8131743675, -0.4114919329]], [[-0.3742553741, -0.0946431543], [0.8608383549, -0.3315613291]], [[-0.1196578321, -0.5669017111], [0.6546926378, -0.4854709087]], [[0.4427280128, -0.7713369192], [-0.3937503742, -0.232361586]], [[-0.232361586, -0.3937503742], [0.7713369192, -0.4427280128]], [[-0.1196578321, -0.5669017111], [0.6546926378, -0.4854709087]], [[-0.0602683401, -0.6416828365], [0.581586741, -0.496354437]], [[-0.2840323734, -0.297905099], [0.8131743675, -0.4114919329]], [[0.2840323734, -0.8659698457], [0.0098094984, -0.4114919329]], [[-0.3315613291, -0.1977156967], [0.8431539025, -0.3742553741]], [[0.2840323734, -0.8659698457], [0.0098094984, -0.4114919329]], [[-0.0602683401, -0.6416828365], [0.581586741, -0.496354437]], [[-0.0, -0.7071067812], [0.5, -0.5]]
|
| Hint |
Quantum gate cipher — difficulty 7. Gate sequence (9 gates): X -> Y -> X -> T -> H -> Y -> X -> Y -> T. Word length: 13 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 7
— website sponsored —
[ ad space ]