Chaithanya Rayudu
banner
the-chaits.bsky.social
Chaithanya Rayudu
@the-chaits.bsky.social
PhD Student at University of New Mexico. Trying to understand what quantum computers can and can't do.

https://www.chaithanyarss.com/
Nice work! I am trying to understand this result through the lens of ETH. What does your result say that is different from what ETH implies?
December 6, 2024 at 6:00 PM
Do it!
December 3, 2024 at 4:54 AM
Yes, please!
December 2, 2024 at 7:57 PM
Reposted by Chaithanya Rayudu
Interesting but perhaps not exactly breaking (at least as a headline). Richard Jozsa argued, over 25 years ago, that "doing nothing" is an essential ingredient for quantum speed-ups: arxiv.org/abs/quant-ph...
Quantum Effects in Algorithms
We discuss some seemingly paradoxical yet valid effects of quantum physics in information processing. Firstly, we argue that the act of ``doing nothing'' on part of an entangled quantum system is a hi...
arxiv.org
November 26, 2024 at 5:30 PM
👋
November 21, 2024 at 8:22 PM
We prove that finding the minimum eigenvalue of the Laplacian of an Independence complex, which has information about the holes, is QMA-hard, improving from a previous result of QMA1-hardness.
November 21, 2024 at 8:16 PM
2. Fermionic Independent Set is also related to another problem from homology that has gained a lot of interest among QI community: are there any holes in a topological manifold?
November 21, 2024 at 8:16 PM
1. We tried to generalize Independent Set using qubits in a previous (arxiv.org/abs/2409.04433) and turned out that it can't be harder than StoqMA. We really need the intrinsic sign problem of fermions to get a QMA-hard generalization of the Independent Set problem.
Constrained local Hamiltonians: quantum generalizations of Vertex Cover
Recent successes in producing rigorous approximation algorithms for local Hamiltonian problems such as Quantum Max Cut have exploited connections to unconstrained classical discrete optimization probl...
arxiv.org
November 21, 2024 at 8:16 PM