5 papers
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…
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…
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 {\…
Quantum Merlin-Arthur proof systems for synthesizing quantum states
Hugo Delavenne, François Le Gall, Yupan Liu +1
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it i…
Distributed Complexity of -freeness: Decision and Certification
Masayuki Miyamoto
The class of graphs that do not contain a path on nodes as an induced subgraph (-free graphs) has rich applications in the theory of graph algorithms. This paper explores…