DECQA

Dictionary-based Energy-efficient Coding of Quantum Instruction Set guided by Algorithmic Information

Master Thesis (2024)
Author(s)

S. Mishra (TU Delft - Applied Sciences)

Contributor(s)

Sebastian Feld – Mentor (TU Delft - Quantum Circuit Architectures and Technology)

Aritra Sarkar – Graduation committee member (TU Delft - QCD/Feld Group)

F. Sebasatiano – Graduation committee member (TU Delft - Quantum Circuit Architectures and Technology)

Michael Wimmer – Graduation committee member (TU Delft - Qubit Research Division)

Faculty
Applied Sciences
More Info
expand_more
Publication Year
2024
Language
English
Graduation Date
20-06-2024
Awarding Institution
Delft University of Technology
Programme
Applied Physics
Faculty
Applied Sciences
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Efficiency in handling instructions within compilation and control processes is essential for scalability and fault-tolerant quantum computation. To mitigate the limited bandwidth for transmission of instructions and energy bottlenecks in cryogenic control architectures, this thesis aims to develop a compressed representation of quantum circuits. To achieve this goal, we study the concepts of algorithmic information theory and resource theory of computation. We focus on description complexity and establish compression as a useful estimate of algorithmic description complexity. With this motivation, we develop a generalized framework for the synthesis of quantum unitaries into a set of native gates and present a Huffman-encoded representation of the instruction stream that has a short code dictionary and offers a 60% compression over binary encoded representations. The developed framework offers 2 major contributions: an energy-efficient encoded representation of the quantum instruction stream and an estimate of the description complexity for quantum circuits. It qualifies as a successful algorithmic approach towards optimizing the QISA and aids the discovery of high-level quantum programming constructs.

Files

License info not available