Alex Lombardi

most citedQuantum Advantage from Any Non-Local Game

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

collaborators

3 papers

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…

quant-ph2022★ 1 cited

Quantum Advantage from Any Non-Local Game

Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan +1

We show a general method of compiling any $k$ -prover non-local game into a single-prover interactive game maintaining the same (quantum) completeness and (classical) soundness guar…

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 $…

Succinct Classical Verification of Quantum Computation

Quantum Advantage from Any Non-Local Game

Distinguishing extension numbers for Rn and Sn

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