From the 1 of 5 linked papers with an AI index.
5 papers
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…
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…
Haar random codes attain the quantum Hamming bound, approximately
Fermi Ma, Xinyu Tan, John Wright
We study the error correcting properties of Haar random codes, in which a -dimensional code space is chosen at random from the Haar distr…
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…
How to Construct Random Unitaries
Fermi Ma, Hsin-Yuan Huang
The existence of pseudorandom unitaries (PRUs) -- efficient quantum circuits that are computationally indistinguishable from Haar-random unitaries -- has been a central open questi…