Uncomputation in the Qrisp high-level Quantum Programming Framework
- URL: http://arxiv.org/abs/2307.11417v1
- Date: Fri, 21 Jul 2023 08:21:03 GMT
- Title: Uncomputation in the Qrisp high-level Quantum Programming Framework
- Authors: Raphael Seidel, Nikolay Tcholtchev, Sebastian Bock and Manfred
Hauswirth
- Abstract summary: 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"
- Score: 1.299941371793082
- License: http://creativecommons.org/licenses/by/4.0/
- 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.
Related papers
- Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computers [0.52197339162908]
We introduce Qrisp, a framework designed to bridge several gaps between high-level programming paradigms and quantum hardware.
Qrisp's standout feature is its ability to compile programs to the circuit level, making them executable on most existing physical backends.
arXiv Detail & Related papers (2024-06-20T23:40:22Z) - Qwerty: A Basis-Oriented Quantum Programming Language [0.4999814847776098]
We present Qwerty, a new quantum programming language that allows programmers to manipulate qubits more expressively than gates.
Qwerty is a powerful framework for high-level quantum-classical computation.
arXiv Detail & Related papers (2024-04-19T03:13:43Z) - Modelling the Impact of Quantum Circuit Imperfections on Networks and Computer Applications [0.31908919831471466]
Post Quantum and Quantum Cryptography schemes are feasible quantum computer applications for 7G networks.
These algorithms have been compromised by advances in quantum search algorithms run on quantum computers like Shor algorithm.
arXiv Detail & Related papers (2024-03-27T10:00:35Z) - Quantum Algorithmic Gate-Based Computing: Grover Quantum Search
Algorithm Design in Quantum Software Engineering [0.0]
The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators.
The presented article describes a practical approach to modeling one of the most famous QA on classical computers, the Grover algorithm.
arXiv Detail & Related papers (2023-04-20T15:47:23Z) - The Basis of Design Tools for Quantum Computing: Arrays, Decision
Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
Quantum computers promise to efficiently solve important problems classical computers never will.
A fully automated quantum software stack needs to be developed.
This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
arXiv Detail & Related papers (2023-01-10T19:00:00Z) - Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages.
The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z) - A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
We propose a hybrid quantum-classical algorithm for robust fitting.
Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs.
We present results obtained using an actual quantum computer.
arXiv Detail & Related papers (2022-01-25T05:59:24Z) - QuantumCircuitOpt: An Open-source Framework for Provably Optimal Quantum
Circuit Design [0.0]
We propose QuantumCircuitOpt, a novel open-source framework which implements mathematical optimization formulations and algorithms for decomposing arbitrary unitary gates into a sequence of hardware-native gates.
We show that QCOpt can find up to 57% reduction in the number of necessary gates on circuits with up to four qubits, and in run times less than a few minutes on commodity computing hardware.
We also show how the QCOpt package can be adapted to various built-in types of native gate sets, based on different hardware platforms like those produced by IBM, Rigetti and Google.
arXiv Detail & Related papers (2021-11-23T06:45:40Z) - Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context.
Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
arXiv Detail & Related papers (2020-10-08T12:49:07Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.