Skip To Main Content
Alex Lombardi on Muck Rack

Alex Lombardi

As seen in: Billings Gazette, Rapid City Journal, Fine Gardening Magazine, Cincinnati Citybeat, Threads Magazine, Fremont Tribune, Beatrice Daily Sun, Watertown Public Opinion
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Alex

Contact Alex, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

A one-query lower bound for unitary synthesis and breaking quantum cryptography

|
By Alex Lombardi, John Wright, Fermi Ma, John Wright
| eprint.iacr.org
Paper 2023/1602 , Princeton University , Simons Institute, University of California, Berkeley , University of California, Berkeley The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any $n$-qubit unitary $U$ can be implemented by an efficient quantum algorithm $A$ augmented with an oracle that computes an arbitrary Boolean function $f$. In other words, can the task of implementing any unitary be efficiently reduced to the task of implementing any Boolean function?
Open in Who Shared Issue with article?

SNARGs for Monotone Policy Batch NP

|
By Zvika Brakerski, Maya Brodsky, Yael Tauman Kalai, Alex Lombardi
| eprint.iacr.org
Paper 2023/1050 SNARGs for Monotone Policy Batch NP , Weizmann Institute of Science , Tel Aviv University , Microsoft Research, Massachusetts Institute of Technology , Simons Institute, University of California, Berkeley , Tel Aviv University Abstract We construct a succinct non-interactive argument ($\mathsf{SNARG}$) for the class of monotone policy batch $\mathsf{NP}$ languages under the Learning with Errors ($\mathsf{LWE}$) assumption.
Open in Who Shared Issue with article?

SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption

|
By Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Microsoft Research
| eprint.iacr.org
Paper 2022/1409 SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption , Microsoft Research, Massachusetts Institute of Technology , Simons Institute, University of California, Berkeley , Massachusetts Institute of Technology Abstract We construct succinct non-interactive arguments (SNARGs) for bounded-depth computations assuming that the decisional Diffie-Hellman (DDH) problem is sub-exponentially hard.
Open in Who Shared Issue with article?
See all 50 articles