Uncomputation in the Qrisp high-level Quantum Programming Framework

TL;DR

This paper introduces an automated method for generating uncomputation circuits within the Qrisp high-level quantum programming framework, improving resource management and algorithmic efficiency in quantum computing.

Contribution

It presents an interface and improved algorithm for synthesizing uncomputation circuits in Qrisp, enhancing automation and suitability for high-level quantum programming.

Findings

Automated uncomputation circuit generation in Qrisp.

Enhanced algorithm based on Unqomp for better integration.

Supports high-level quantum programming with resource optimization.

Abstract

Uncomputation is an essential part of reversible computing and plays a vital role in quantum computing. Using this technique, memory resources can be safely deallocated without performing a nonreversible deletion process. For the case of quantum computing, several algorithms depend on this as they require disentangled states in the course of their execution. Thus, uncomputation is not only about resource management, but is also required from an algorithmic point of view. However, synthesizing uncomputation circuits is tedious and can be automated. In this paper, we describe the interface for automated generation of uncomputation circuits in our Qrisp framework. Our algorithm for synthesizing uncomputation circuits in Qrisp is based on an improved version of "Unqomp", a solution presented by Paradis et. al. Our paper also presents some improvements to the original algorithm, in order to make it suitable for the needs of a high-level programming framework. Qrisp itself is a fully compilable, high-level programming language/framework for gate-based quantum computers, which abstracts from many of the underlying hardware details. Qrisp's goal is to support a high-level programming paradigm as known from classical software development.