Alex Lombardi

activity

20142023

most citedDistinguishing extension numbers for

R^{n}

and

S^{n}

1 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

quant-ph2023

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 $n$ -qubit unitary $U$ can be implemented by an efficient quantum algorithm $A$ augmented with an oracle tha…

quant-ph2022★ 1 cited

Succinct Classical Verification of Quantum Computation

James Bartusek, Yael Tauman Kalai, Alex Lombardi +5

We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in th…

math.CO2014★ 1 cited

Distinguishing extension numbers for $R^{n}$ and $S^{n}$

Alex Lombardi

In the setting of a group $Γ$ acting faithfully on a set $X$ , a $k$ -coloring $c : X \to {1, 2, ..., k}$ is called $Γ$ -distinguishing if the only element of $Γ$ that fixes $…

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

Succinct Classical Verification of Quantum Computation

Distinguishing extension numbers for Rn and Sn

Distinguishing extension numbers for $R^{n}$ and $S^{n}$