Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Quantum Search with In-Place Queries
Blake Holman, Ronak Ramachandran, Justin Yirka
Quantum query complexity is typically characterized in terms of XOR queries |x,y> to |x,y+f(x)> or phase queries, which ensure that even queries to non-invertible functions are uni…
quant-ph2021
The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs
Jeremiah Blocki, Blake Holman, Seunghoon Lee
The classical (parallel) black pebbling game is a useful abstraction which allows us to analyze the resources (space, space-time, cumulative space) necessary to evaluate a function…