InQuIR: Intermediate Representation for Interconnected Quantum Computers
- URL: http://arxiv.org/abs/2302.00267v1
- Date: Wed, 1 Feb 2023 06:19:23 GMT
- Title: InQuIR: Intermediate Representation for Interconnected Quantum Computers
- Authors: Shin Nishio and Ryo Wakizaka
- Abstract summary: InQuIR is a representation that can express communication and computation on distributed quantum systems.
We give examples written in InQuIR to illustrate the problems arising in distributed programs, such as deadlock.
We also provide software tools for InQuIR and evaluate the computational costs of quantum circuits.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Various physical constraints limit the number of qubits that can be
implemented in a single quantum processor, and thus it is necessary to connect
multiple quantum processors via quantum interconnects. While several compiler
implementations for interconnected quantum computers have been proposed, there
is no suitable representation as their compilation target. The lack of such
representation impairs the reusability of compiled programs and makes it
difficult to reason formally about the complicated behavior of distributed
quantum programs. We propose InQuIR, an intermediate representation that can
express communication and computation on distributed quantum systems. InQuIR
has formal semantics that allows us to describe precisely the behaviors of
distributed quantum programs. We give examples written in InQuIR to illustrate
the problems arising in distributed programs, such as deadlock. We present a
roadmap for static verification using type systems to deal with such a problem.
We also provide software tools for InQuIR and evaluate the computational costs
of quantum circuits under various conditions. Our tools are available at
https://github.com/team-InQuIR/InQuIR.
Related papers
- DisQ: A Markov Decision Process Based Language for Quantum Distributed Systems [0.0]
We present DisQ as a framework to facilitate the rewrites of quantum algorithms to their distributed versions.
DisQ combines the concepts of Chemical Abstract Machine (CHAM) and Markov Decision Processes (MDP) with the objective of providing a clearly distinguishing quantum concurrent and distributed behaviors.
We present several case studies, such as quantum addition and Shor's algorithm, to demonstrate their equivalent rewrites to distributed versions.
arXiv Detail & Related papers (2024-07-12T22:26:22Z) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Quantum Circuit Learning on NISQ Hardware [0.0]
Current quantum computers are small and error-prone systems.
Fault-tolerant quantum computers are not expected to be available in the near future.
We show that exemplary QCL circuits with up to three qubits are executable on the IBM quantum computer.
arXiv Detail & Related papers (2024-05-03T13:00:32Z) - Scaling quantum computing with dynamic circuits [0.6990493129893112]
Quantum computers process information with the laws of quantum mechanics.
Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits.
Here we overcome these limitations with error mitigated dynamic circuits and circuit-cutting to create quantum states requiring a periodic connectivity employing up to 142 qubits.
arXiv Detail & Related papers (2024-02-27T19:00:07Z) - Applying an Evolutionary Algorithm to Minimize Teleportation Costs in Distributed Quantum Computing [3.0846297887400977]
A quantum communication network can be formed by connecting multiple quantum computers (QCs) through classical and quantum channels.
In distributed quantum computing, QCs collectively perform a quantum computation.
In this paper, we propose an evolutionary algorithm for this problem.
arXiv Detail & Related papers (2023-11-30T13:10:28Z) - Delegated variational quantum algorithms based on quantum homomorphic
encryption [69.50567607858659]
Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices.
The private data of clients may be leaked to quantum servers in such a quantum cloud model.
A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
arXiv Detail & Related papers (2023-01-25T07:00:13Z) - TeD-Q: a tensor network enhanced distributed hybrid quantum machine
learning framework [59.07246314484875]
TeD-Q is an open-source software framework for quantum machine learning.
It seamlessly integrates classical machine learning libraries with quantum simulators.
It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
arXiv Detail & Related papers (2023-01-13T09:35:05Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - A MLIR Dialect for Quantum Assembly Languages [78.8942067357231]
We demonstrate the utility of the Multi-Level Intermediate Representation (MLIR) for quantum computing.
We extend MLIR with a new quantum dialect that enables the expression and compilation of common quantum assembly languages.
We leverage a qcor-enabled implementation of the QIR quantum runtime API to enable a retargetable (quantum hardware agnostic) compiler workflow.
arXiv Detail & Related papers (2021-01-27T13:00:39Z)
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.