Unconditionally Secure Quantum Commitments with Preprocessing

We demonstrate how to build computationally secure commitment schemes with the aid of quantum auxiliary inputs without unproven complexity assumptions. Furthermore, the quantum auxiliary input can be either sampled in uniform exponential time or prepared in at most doubly exponential time, without relying on an external trusted third party. Classically, this remains impossible without first proving 𝖯 ̸ = 𝖭𝖯.

• This is the conference proceeding version. For a full-er version that contains the simplified proof of Theorem 2, please refer to the author's dissertation.