4 citations · 4 across the 7 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
quant-ph2026
Near-Optimal Gap Amplification for Nonnegative Unentangled Quantum Proofs
Masayuki Miyamoto
We study gap amplification of the class characterized by unentangled quantum proofs whose amplitudes are nonnegative in the computational basis. This class wa…
cs.DC2026
Distributed Statistical Zero-Knowledge Proofs via Sumcheck
Benjamin Jauregui, Masayuki Miyamoto
We study distributed zero-knowledge proofs, introduced by Bick, Kol, and Oshman (SODA 2022). While distributed interactive proofs have advanced rapidly, general-purpose techniques…
quant-ph2026
Classical simulability of quantum circuits followed by sparse classical post-processing
Yasuhiro Takahashi, Masayuki Miyamoto, Noboru Kunihiro
We study the classical simulability of a polynomial-size quantum circuit on qubits followed by sparse classical post-processing (SCP) on bits, where $m \leq n \leq {\…