Impossibility of Succinct Quantum Proofs for Collision-Freeness Scott Aaronson∗ Abstract We show that any quantum algorithm to decide whether a function f : [n] → [n] is a - Quantum algorithm - Document - PDFSEARCH.IO

First Page	Meta Content
	Impossibility of Succinct Quantum Proofs for Collision-Freeness Scott Aaronson∗ Abstract We show that any quantum algorithm to decide whether a function f : [n] → [n] is a Add to Reading List Document Date: 2011-10-21 00:13:04 Open Document File Size: 139,96 KB Share Result on Facebook

Impossibility of Succinct Quantum Proofs for Collision-Freeness Scott Aaronson∗ Abstract We show that any quantum algorithm to decide whether a function f : [n] → [n] is aAdd to Reading List