Commitments to Quantum States

Abstract. 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 state is hidden from the sender’s view. We accompany this new definition with several instantiations. We build the first non-interactive succinct quantum state commitments, which can be seen as an analogue of collision-resistant hashing for quantum messages. We also show that hiding quantum state commitments (QSCs) are implied by any commitment scheme for classical messages. All of our constructions can be based on quantum-cryptographic assumptions that are implied by but are potentially weaker than one-way functions. Commitments to quantum states open the door to many new cryptographic possibilities. Our flagship application of a succinct QSC is a quantum-communication version of Kilian’s succinct arguments for any language that has quantum PCPs with constant error and polylogarithmic locality. Plugging in the PCP theorem, this yields succinct arguments for [Formula: see text] under significantly weaker assumptions than required classically; moreover, if the quantum PCP conjecture holds, this extends to [Formula: see text]. Our security proof develops new rewinding techniques for extracting quantum information.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Computing
Published
2026-11-03
DOI
https://doi.org/10.1137/23m1598556
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Commitments to Quantum States

Mark Zhandry, Sam Gunn, Fermi Ma, Nathan Ju
SIAM Journal on Computing
Quantum Information and Cryptography
article

Commitments to Quantum States

Mark Zhandry, Sam Gunn, Fermi Ma, Nathan Ju
article en

Abstract

Abstract. 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 state is hidden from the sender’s view. We accompany this new definition with several instantiations. We build the first non-interactive succinct quantum state commitments, which can be seen as an analogue of collision-resistant hashing for quantum messages. We also show that hiding quantum state commitments (QSCs) are implied by any commitment scheme for classical messages. All of our constructions can be based on quantum-cryptographic assumptions that are implied by but are potentially weaker than one-way functions. Commitments to quantum states open the door to many new cryptographic possibilities. Our flagship application of a succinct QSC is a quantum-communication version of Kilian’s succinct arguments for any language that has quantum PCPs with constant error and polylogarithmic locality. Plugging in the PCP theorem, this yields succinct arguments for [Formula: see text] under significantly weaker assumptions than required classically; moreover, if the quantum PCP conjecture holds, this extends to [Formula: see text]. Our security proof develops new rewinding techniques for extracting quantum information.

SIAM Journal on Computing
Berkeley College (US), Princeton University (US), University of California, Berkeley (US)
Openalex Percentile: Top 16%
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon