## Classical simulation complexity of restricted models of quantum computation

##### Author(s)

Koh, Dax Enshan.
Download1117775048-MIT.pdf (22.79Mb)

##### Other Contributors

Massachusetts Institute of Technology. Department of Mathematics.

##### Advisor

Peter W. Shor.

##### Terms of use

##### Metadata

Show full item record##### Abstract

Restricted models of quantum computation are mathematical models which describe quantum computers that have limited access to certain resources. Well-known examples of such models include the boson sampling model, extended Clifford circuits, and instantaneous quantum polynomial-time circuits. While unlikely to be universal for quantum computation, several of these models appear to be able to outperform classical computers at certain computational tasks, such as sampling from certain probability distributions. Understanding which of these models are capable of performing such tasks and characterizing the classical simulation complexity of these models--i.e. how hard it is to simulate these models on a classical computer--are some of the central questions we address in this thesis. Our first contribution is a classification of various extended Clifford circuits according to their classical simulation complexity. Among these circuits are the conjugated Clifford circuits, which we prove cannot be efficiently classically simulated up to multiplicative or additive error, under certain plausible conjectures in computational complexity theory. Our second contribution is an estimate of the number of qubits needed in various restricted quantum computation models in order for them to be able to demonstrate quantum computational supremacy. Our estimate is obtained by fine-graining existing hardness results for these restricted models. Our third contribution is a new alternative proof of the Gottesman-Knill theorem, which states that Clifford circuits can be efficiently simulated by a classical computer. Our proof uses the sum-over-paths technique and establishes a correspondence between quantum circuits and a class of exponential sums. Our final contribution is a theorem characterizing the operations that can be efficiently simulated using a particular rebit simulator. An application of this result is a generalization of the Gottesman-Knill theorem that allows for the efficient classical simulation of certain nonlinear operations.

##### Description

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019 Cataloged from PDF version of thesis. Includes bibliographical references (pages 355-372).

##### Date issued

2019##### Department

Massachusetts Institute of Technology. Department of Mathematics##### Publisher

Massachusetts Institute of Technology

##### Keywords

Mathematics.