Scalable Compilation and Equivalence Checking of Quantum Circuits — with an Application to Quantum Error Correction

Thumbnail Image

Files

master_Moflic_Ioana_2024.pdf (4.27 MB)

URL

Journal Title

Journal ISSN

Volume Title

School of Science | Master's thesis
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.

Authors

Date

2024-09-30

Department

Major/Subject

Machine Learning, Data Science and Artificial Intelligence

Mcode

SCI3044

Degree programme

Master's Programme in Computer, Communication and Information Sciences

Language

en

Pages

77

Series

Abstract

Quantum computers have the potential of offering superpolynomial speedup for a restricted set of algorithms which cannot be efficiently executed on classical machines. The reliable execution of the algorithms requires error-correction. The latter adds significant overheads in terms of qubit and gate counts. This thesis aims to answer two research questions: How can error-corrected logical operators be efficiently implemented? What are the architecture and implementation of a design automation tool that can process very large scale quantum circuits? To answer the first question, we derive novel circuit rewrite rules for pairwise interactions and decompose arbitrary Pauli exponentials via these rules. The resulting decomposition has a constant depth and requires a linear number of ancillas. The decomposition has many applications in quantum computing, ranging from the efficient implementation of NISQ algorithms to the efficient implementation of error-correcting codes. To answer the second question, we architect and implement a multi-threaded design automation tool, named Pandora, which has a relational database as a backend. Pandora is able to efficiently compile, optimize and perform equivalence checking for circuits with millions of gates. Our tool can apply thousands of circuit rewrites per second at random circuit locations, and is integrated with Google Qualtran. Future research will build upon the fault tolerance of the Pauli decomposition and will integrate Pandora in a full-stack quantum software pipeline.

Description

Supervisor

Paler, Alexandru

Thesis advisor

Paler, Alexandru

Keywords

quantum computing, quantum software, optimisation, design automation, equivalence checking, quantum error correction

Other note

Citation

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-202411217219

Collections

[dipl] Perustieteiden korkeakoulu / SCI