Quantum commitments from complexity assumptions

Abstract. We study worst-case complexity assumptions that imply quantum bitcommitment schemes. First we show that QSZK ⊆ QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP ⊆ QMA (which is weaker than PSPACE ⊆ PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK ⊆ QMA we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA.

• Type: Journal
• Year: 2016
• Where: CC
• Authors: André Chailloux, Iordanis Kerenidis, Bill Rosgen
• Keywords: CC 2016, System Software