From the 1 of 3 linked papers with an AI index.
3 papers
quant-ph2026
Explicit Separations for One-Query Unitary Synthesis
Fangqi Dong, Alex Lombardi, Fermi Ma
The paper studies how hard it is to construct specific quantum gates using only a single query to a classical oracle, proving lower bounds for certain explicit unitaries and showin…
quant-ph2026
Quantum Lazy Sampling and Path Recording for Any Group
Ben Foxman, Alex Lombardi, Fermi Ma +2
A central challenge in quantum algorithms and cryptography is reasoning about algorithms with oracle access to a random group element (e.g. a random function, permutation, or unita…
quant-ph2025
Strong random unitaries and fast scrambling
Thomas Schuster, Fermi Ma, Alex Lombardi +2
Understanding how fast physical systems can resemble Haar-random unitaries is a fundamental question in physics. Many experiments of interest in quantum gravity and many-body physi…