Calpin, Padraic; (2020) Exploring Quantum Computation Through the Lens of Classical Simulation. Doctoral thesis (Ph.D), UCL (University College London).

Preview

Text Thesis_Corrected_PCalpin.pdf - Accepted Version Download (2MB) | Preview

Abstract

It is widely believed that quantum computation has the potential to offer an ex- ponential speedup over classical devices. However, there is currently no definitive proof of this separation in computational power. Such a separation would in turn imply that quantum circuits cannot be efficiently simulated classically. However, it is well known that certain classes of quantum computations nonetheless admit an efficient classical description. Recent work has also argued that efficient classical simulation of quantum circuits would imply the collapse of the Polynomial Hierarchy, something which is commonly invoked in clas- sical complexity theory as a no-go theorem. This suggests a route for studying this ‘quantum advantage’ through classical simulations. This project looks at the problem of classically simulating quantum circuits through decompositions into stabilizer circuits. These are a restricted class of quantum computation which can be efficiently simulated classically. In this picture, the rank of the decomposition determines the temporal and spatial complexity of the simulation. We approach the problem by considering classical simulations of stabilizer circuits, introducing two new representations with novel features compared to previous meth- ods. We then examine techniques for building these so-called ‘stabilizer rank’ decom- positions, both exact and approximate. Finally, we combine these two ingredients to introduce an improved method for classically simulating broad classes of circuits using the stabilizer rank method.

Download activity - last month

Export as XMLJSONCSV

Download activity - last 12 months

Export as JSONCSVXML

Downloads by country - last 12 months

Export as JSONCSVXML

Archive Staff Only

View Item