3 papers
quant-ph2026
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…
quant-ph2024
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…
quant-ph2024
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…