2 citations · 3 across the 7 of their papers we have counts for
7 papers
Explicit Separations for One-Query Unitary Synthesis
Fangqi Dong, Alex Lombardi, Fermi Ma
The unitary synthesis problem (Aaronson-Kuperberg, CCC 2007) asks whether every -qubit unitary is computable by efficient quantum circuits relative to some classical oracle…
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…
A one-query lower bound for unitary synthesis and breaking quantum cryptography
Alex Lombardi, Fermi Ma, John Wright
The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any -qubit unitary can be implemented by an efficient quantum algorithm augmented with an oracle tha…
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably)
Alex Lombardi, Fermi Ma, Nicholas Spooner
A major difficulty in quantum rewinding is the fact that measurement is destructive: extracting information from a quantum state irreversibly changes it. This is especially problem…