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