Quantum cryptography is the art and science of exploiting quantum mechanical effects in
order to perform cryptographic tasks. While the most well-known example of this discipline is …

This article surveys quantum computational complexity, with a focus on three fundamental
notions: polynomial-time quantum computations, the efficient verification of quantum proofs …

The interest in post-quantum cryptography—classical systems that remain secure in the
presence of a quantum adversary—has generated elegant proposals for new cryptosystems …

A thorough exposition of quantum computing and the underlying concepts of quantum
physics, with explanations of the relevant mathematics and numerous examples. The …

We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with
complexity sublogarithmic in the inverse error, an exponential improvement over previous …

A bstract In this paper we discuss quantum computational restrictions on the types of thought
experiments recently used by Almheiri, Marolf, Polchinski, and Sully to argue against the …

H04B7/0615—Diversity systems; Multi-antenna system, ie transmission or reception using
multiple antennas using two or more spaced independent antennas at the transmitting …

We prove the security of NMAC, HMAC, AMAC, and the cascade construction with fixed
input-length as quantum-secure pseudo-random functions (PRFs). Namely, they are …

Abstract The Fiat-Shamir transformation is a useful approach to building non-interactive
arguments (of knowledge) in the random oracle model. Unfortunately, existing proof …

We present a construction for non-interactive zero-knowledge proofs of knowledge in the
random oracle model from general sigma-protocols. Our construction is secure against …