Liu, Yinchen2021-12-232021-12-232021-12-232021-12-16http://hdl.handle.net/10012/17809Random quantum circuits and random circuit sampling (RCS) have recently garnered tremendous attention from all sub-fields of the quantum information community, especially after Google’s quantum supremacy announcement in 2019. While the science of RCS draws ideas from diverse disciplines ranging from pure mathematics to electrical engineering, this thesis explores the subject from a theoretical computer science perspective. We begin by offering a rigorous treatment of the t-design and the anti-concentration properties of random quantum circuits in a way that various intermediate lemmas will find further applications in subsequent discussions. In particular, we prove a new upper bound for expressions of the form E_V[<0^n|V\sigma_p|0^n>^2] for 1D random quantum circuits V and n-qubit Pauli operators \sigma_p. Next, we discuss at a high level the RCS supremacy conjecture, which forms the main complexity-theoretic basis supporting the belief that deep random quantum circuits may be just as hard to classically simulate as arbitrary quantum circuits. Finally, we study the performance of quantum and classical spoofing algorithms on the linear cross-entropy benchmark (XEB), a statistical test proposed by Google for the purpose of verifying RCS experiments. We consider an extension of a classical algorithm recently proposed by Barak, Chou, and Gao and try to show that the extended algorithm can achieve higher XEB scores [BCG20]. While we are unable to prove a key conjecture for random quantum circuits with Haar random 2-qubit gates, we do establish the result in other related settings including for Haar random unitaries, random Clifford circuits, and random fermionic Gaussian unitaries.enrandom quantum circuitsrandom circuit samplingquantum computational advantageMaster Thesis