13 citations · 26 across the 3 of their papers we have counts for
5 papers · 1 filter
Planted Cliques and Quantum Symmetry-Adapted Measurements
Vojtech Havlicek, Jordan Docter, Subhash Khot
We study how quantum encodings and symmetry-adapted measurements preserve information for planted-clique detection from one classical graph. For $k=\lfloor n^{1/2-\varepsilon}\rflo…
A Separation Between Types of Quantum Oracle Separations
Scott Aaronson, Adam Bouland, Jordan Docter +1
Recent works have demonstrated that quantum oracles have subtle behavior, as access to inverse, conjugate or controlled queries can exponentially change the query complexity of cer…
Quantum Speedups Require Structure or Depth
Guy Blanc, Jordan Docter, Carmen Strassle +1
One of the most basic conjectures in quantum complexity theory states that every -query quantum algorithm can be simulated on most inputs by a -query classical…
Efficient unitary designs and pseudorandom unitaries from permutations
Chi-Fang Chen, Adam Bouland, Fernando G. S. L. Brandão +3
In this work we give an efficient construction of unitary -designs using quantum gates, as well as an efficient construction of a parallel-secure pse…
Efficient Unitary T-designs from Random Sums
Chi-Fang Chen, Jordan Docter, Michelle Xu +2
Unitary -designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most…