Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Oracle Separations for the Quantum-Classical Polynomial Hierarchy
Avantika Agarwal, Shalev Ben-David
We study the quantum-classical polynomial hierarchy, QCPH, which is the class of languages solvable by a constant number of alternating classical quantifiers followed by a quantum…
quant-ph2024
Separations in query complexity for total search problems
Shalev Ben-David, Srijita Kundu
We study the query complexity analogue of the class TFNP of total search problems. We give a way to convert partial functions to total search problems under certain settings; we al…