2 papers
quant-ph2025
Group Order is in QCMA
François Le Gall, Harumichi Nishimura, Dhara Thakkar
In this work, we show that verifying the order of a finite group given as a black-box is in the complexity class QCMA. This solves an open problem asked by Watrous in 2000 in his s…
cs.DS2023
On the Complexity of the Eigenvalue Deletion Problem
Neeldhara Misra, Harshil Mittal, Saket Saurabh +1
For any fixed positive integer and a given budget , the -\textsc{Eigenvalue Vertex Deletion} (-EVD) problem asks if a graph admits a subset of at most vert…