Exciting paper by Louis Golowich, an awesome first-year at Berkeley!
https://t.co/wy1ck44CK2
A super-simple construction and analysis of explicit (one-sided) lossless expanders, i.e., graphs with vertex expansion as good as random graphs.
genuine q: what evidence is there that the results in their "beyond-classical" setting are correct beside (a) being correct at few Trotter steps by comparing with classical sim (b) the results approximately match the correct result when the angles make the circuit Clifford?
I am excited to announce the release of my paper with Adam Bene Watts:
“Unconditional Quantum Advantage for Sampling with Shallow Circuits”
https://t.co/VYMYQErXth
https://t.co/MXp5pEjsd2
1/8
Quantum Colloquium, Dec. 6
Sam Gunn
"Approaching the Quantum Singleton Bound with Approximate Error Correction"
11 am PT
Panel: D. Leung and V. Guruswami
12 pm PT
Details: https://t.co/yuolqIZIL5
Zoom: https://t.co/2OTyvoKCwq
#simonsquantum
New paper out today with Sam Gunn, Nathan Ju (@nathanju34), and Mark Zhandry. https://t.co/QZ8kxdRxsh
This project began with a simple question: what does it mean to commit to a quantum state? (1/16)
@michael_nielsen (Shannon) Most funcs need exp size circuits: For circuits w/ <= s gates, push all NOTs to beginning. Each AND/OR gate has 2 inputs from 2n (x_i or NOT(x_i)) + s - 1 (another gate) choices. But 2^s(2n+s-1)^{2s} total circuits is less than 2^{2^n} functions if s is subexponential.