1 citations · 1 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2002★ 1 cited
Non-Interactive Quantum Statistical and Perfect Zero-Knowledge
Hirotada Kobayashi
This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness…
quant-ph2001
Quantum Certificate Verification: Single versus Multiple Quantum Certificates
Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
The class MA consists of languages that can be efficiently verified by classical probabilistic verifiers using a single classical certificate, and the class QMA consists of languag…