12 citations · 15 across the 2 of their papers we have counts for
2 papers
quant-ph2024★ 3 cited
Efficiently verifiable quantum advantage on near-term analog quantum simulators
Zhenning Liu, Dhruv Devulapalli, Dominik Hangleiter +4
Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimen…
quant-ph2010★ 12 cited
Quantum property testing for bounded-degree graphs
Andris Ambainis, Andrew M. Childs, Yi-Kai Liu
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the O…