How to Construct Quantum Random Functions

Pseudorandom functions ( PRFs ) are one of the foundational concepts in theoretical computer science, with numerous applications in complexity theory and cryptography. In this work, we study the security of PRFs when evaluated on quantum superpositions of inputs. The classical techniques for arguing the security of PRFs do not carry over to this setting, even if the underlying building blocks are quantum resistant. We therefore develop a new proof technique to show that many of the classical PRF constructions remain secure when evaluated on superpositions.

The Born rule as a statistics of quantum micro-events

We deduce the Born rule from a purely statistical take on quantum theory within minimalistic math-setup. No use is required of quantum postulates. One exploits only rudimentary quantum mathematics—a linear, not Hilbert’, vector space—and empirical notion of the Statistical Length of a state. Its statistical nature comes from the lab micro-events (detector-clicks) being formalized into the C -coefficients of quantum superpositions. We also comment that not only has the use not been made of quantum axioms (scalar-product, operators, interpretations , etc.), but that the involving thereof would be, in a sense, inconsistent when deriving the rule. In point of fact, the quadratic character of the statistical length, and even not (the ‘physics’ of) Born’s formula, represents a first step in constructing the mathematical structure we name the Hilbert space of quantum states.