-
π I just completed my master's in Quantum Computing at IISc, Bengaluru.
-
π± My primary interest is in Quantum Complexity theory. Beyond this, I aspire to contribute to (quantum/classical) algorithmic research in optimization/ML and system simulation. I also keep track of developments in Quantum (Post-Quantum) Cryptography and Quantum error corrections.
-
π― One of the long-term goals is to understand the power and limitations of the computational complexity class BQP, i.e., the set of problems having a polynomial time Quantum algorithm.
-
Some Open problems in Quantum Complexity theory:
$P\neq BQP:$ It is conjecture that Quantumess adds power to computation. Still, there is no formal proof for it.$BQP\not\subset NP$ : It is conjectured that the power of Quantum Turing Machine and Non-deterministic Turing Machine are not comparable. It is known to hold in the oracle/relativized model. -
β A part-time programmer. Trying to learn a bit of creative thinking via Dynamic Programming [π ]. See if these codes are relevant.
- π« Reach me at manishkumar7[at]iisc.ac.in