2 citations · 3 across the 3 of their papers we have counts for
5 papers
Commitments to Quantum States
Sam Gunn, Nathan Ju, Fermi Ma +1
What does it mean to commit to a quantum state? In this work, we propose a simple answer: a commitment to quantum messages is binding if, after the commit phase, the committed stat…
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…
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
Alessandro Chiesa, Fermi Ma, Nicholas Spooner +1
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any colla…
One-Way Functions Imply Secure Computation in a Quantum World
James Bartusek, Andrea Coladangelo, Dakshita Khurana +1
We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functio…
On The Round Complexity of Secure Quantum Computation
James Bartusek, Andrea Coladangelo, Dakshita Khurana +1
We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries.…