3 citations · 3 across the 1 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
quant-ph2020
Symmetries, graph properties, and quantum speedups
Shalev Ben-David, Andrew M. Childs, András Gilyén +3
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: h…
quant-ph2020★ 3 cited
Can graph properties have exponential quantum speedup?
Andrew M. Childs, Daochen Wang
Quantum computers can sometimes exponentially outperform classical ones, but only for problems with sufficient structure. While it is well known that query problems with full permu…