3 papers
quant-ph2025
Absence of censoring inequalities in random quantum circuits
Daniel Belkin, James Allen, Bryan K. Clark
Ref. 1 asked whether deleting gates from a random quantum circuit architecture can ever make the architecture a better approximate -design. We show that it can. In particular, w…
quant-ph2024
Conditional t-independent spectral gap for random quantum circuits and implications for t-design depths
James Allen, Daniel Belkin, Bryan K. Clark
A fundamental question is understanding the rate at which random quantum circuits converge to the Haar measure. One quantity which is important in establishing this rate is the spe…
cs.ET2018
Long short-term memory networks in memristor crossbars
Can Li, Zhongrui Wang, Mingyi Rao +14
Recent breakthroughs in recurrent deep neural networks with long short-term memory (LSTM) units has led to major advances in artificial intelligence. State-of-the-art LSTM models w…