Topic
Algorithms
3 questions · 3 investigations · 0 notes
Questions
What this subject opens.
When does incomplete evidence determine hidden structure?
Enigma indicators reveal strong algebraic constraints, but reconstruction can stop at rotor-order, twist, or spin ambiguities. I am studying which observations and exact-twist conditions turn those constraints into a verified recovery.
Can quantum advantage be proved formally?
Quantum computing feels intuitively different. I want to understand what would establish an advantage over classical computation, and what exactly such a proof would compare.
Which kinds of problems could benefit from quantum computing?
If quantum computation offers an advantage, what features of a problem make that advantage possible, and how broadly does it apply?
Investigations
Where it became concrete.
Recovering hidden structure from the Enigma
When can intercepted Enigma indicators uniquely identify rotor wirings without relying on historical clues?
I’m investigating when intercepted Enigma indicators and rotor-setting constraints can pin down the exact rotor wirings, including their rotational offsets.
Open Source Contributions
How can quantum software become more reliable for the people using it?
Three merged contributions to Qiskit and Cirq covering control-flow angle wrapping, tests for two-qubit block consolidation, and NumPy Generator support.
Quantum state simulator in C
How do the mathematical objects of quantum computing become a working simulator?
Building a simulator from scratch in C: complex arithmetic, single- and multi-qubit state representations, normalization, Bloch-sphere angles, and general quantum operators. Gate and circuit simulation are in progress.