Search Results for author:
Found 4 papers, 1 papers with code
Secure Software Leasing Without Assumptions
Given a target circuit $C$ from a circuit class, SSL produces an encoding of $C$ that enables a recipient to evaluate $C$, and also enables the originator of the software to verify that the software has been returned -- meaning that the recipient has relinquished the possibility of any further use of the software.
Quantum Physics
Quantum learning algorithms imply circuit lower bounds
This result is optimal in both $\gamma$ and $T$, since it is not hard to learn any class $\mathfrak{C}$ of functions in (classical) time $T = 2^n$ (with no error), or in quantum time $T = \mathsf{poly}(n)$ with error at most $1/2 - \Omega(2^{-n/2})$ via Fourier sampling.
Quantum hardness of learning shallow classical circuits
The main technique in this result is to establish a connection between the quantum security of public-key cryptosystems and the learnability of a concept class that consists of decryption functions of the cryptosystem.
Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
The polynomial-time hierarchy ($\mathrm{PH}$) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\mathrm{PH}$ does not collapse).
Computational Complexity Quantum Physics 68Q12, 68Q15, 81P68, 03D15 F.1.3
