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 …

The continuous technological revolution, driven by transformative innovations such as
artificial intelligence, blockchain, and Internet of Things, has left an everlasting mark on the …

We show how to obfuscate pseudo-deterministic quantum circuits, assuming the quantum
hardness of learning with errors (QLWE) and post-quantum virtual black-box (VBB) …

We construct a classically verifiable succinct interactive argument for quantum computation
(BQP) with communication complexity and verifier runtime that are poly-logarithmic in the …

Recent work shows that quantum signal processing (QSP) and its multi-qubit lifted version,
quantum singular value transformation (QSVT), unify and improve the presentation of most …

The study of classical algorithms is supported by an immense understructure, founded in
logic, type, and category theory, that allows an algorithmist to reason about the sequential …

We construct a succinct classical argument system for QMA, the quantum analogue of NP,
from generic and standard cryptographic assumptions. Previously, building on the prior work …

Collapsing is a post-quantum strengthening of collision resistance, needed to lift many
classical results to the quantum setting. Unfortunately, the only existing standard-model …

We show that for many fundamental cryptographic primitives, proving classical security
under the learning-with-errors (LWE) assumption, does not imply post-quantum security …

Zero-knowledge proof or argument systems for generic NP statements (such as circuit
satisfiability) have typically been instantiated with cryptographic commitment schemes; this …