Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Quantum Query Complexity of Persistence Statistics in Graph Zigzags
Cheng Xin
We study the query complexity of estimating scalar summaries of zigzag bar lifetimes from snapshot-adjacency bits. For graphs on labeled vertices, let …
quant-ph2026
Quantum Query Algorithms for the Constructive Diagonal Ramsey Theorem
Cheng Xin
The constructive diagonal Ramsey problem asks, given adjacency-oracle access to an -vertex graph, for a clique or independent set of the order guaranteed by Ramsey's theorem. We…