Architecting a reliable quantum operating system: microkernel, message passing and supercomputing

• URL: http://arxiv.org/abs/2410.13482v1
• Date: Thu, 17 Oct 2024 12:24:55 GMT
• Title: Architecting a reliable quantum operating system: microkernel, message passing and supercomputing
• Authors: Alexandru Paler,
• Abstract summary: A quantum operating system (QCOS) is a classic software running on classic hardware. We discuss why a QCOS should be architected according to the following principles.
• Score: 55.616364225463066
• License:
• Abstract: A quantum operating system (QCOS) is a classic software running on classic hardware. The QCOS is preparing, starting, controlling and managing quantum computations. The reliable execution of fault-tolerant quantum computations will require the QCOS to be as reliable and fault-tolerant as the computation itself. In the following, we discuss why a QCOS should be architected according to the following principles: 1) using a microkernel; 2) the components are working in an aggregated, non-stacked manner and communicate by message passing; 3) the components are executed by default on supercomputers, unless there are very good reasons not to. These principles can guarantee that the execution of error-corrected, fault-tolerant quantum computation is not vulnerable to the failures of the QCOS.

Related papers

• Quantum Operating System Support for Quantum Trusted Execution Environments [10.353892677735212]
  Quantum Trusted Execution Environments (QTEEs) have been proposed to protect users' quantum circuits when they are submitted to remote cloud-based quantum computers. This work introduces the first architecture for a QOS to support and enable essential steps required for secure quantum task execution on cloud platforms.
  arXiv  Detail & Related papers  (2024-10-11T03:27:34Z)
• MQT Qudits: A Software Framework for Mixed-Dimensional Quantum Computing [4.306566710489809]
  We introduce MQT Qudits, an open-source tool to assist in designing and implementing applications for mixed-dimensional qudit devices. We specify a standardized language for mixed-dimension systems and discuss circuit specification, compilation to hardware gate sets, efficient circuit simulation, and open challenges.
  arXiv  Detail & Related papers  (2024-10-03T18:00:01Z)
• Quantum Wasserstein Compilation: Unitary Compilation using the Quantum Earth Mover's Distance [2.502222151305252]
  We present a quantum Wasserstein compilation (QWC) cost function based on the quantum Wasserstein distance of order 1. An estimation method based on measurements of local Pauli-observable is utilized in a generative adversarial network to learn a given quantum circuit.
  arXiv  Detail & Related papers  (2024-09-09T17:46:40Z)
• 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)
• 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)
• Quantum computation capability verification protocol for NISQ devices with dihedral coset problem [0.4061135251278187]
  We propose an interactive protocol for one party (the verifier) holding a quantum computer to verify the quantum computation power of another party's (the prover) device via a one-way quantum channel. We conduct a 4-qubit experiment on one of IBM Q devices.
  arXiv  Detail & Related papers  (2022-02-14T19:00:58Z)
• Exploiting Different Levels of Parallelism in the Quantum Control Microarchitecture for Superconducting Qubits [16.81923513772868]
  We propose a novel control microarchitecture design to exploit Circuit Level Parallelism (CLP) and Quantum Operation Level Parallelism (QOLP) In the benchmark test of a Shor syndrome measurement, a six-core implementation of our proposal achieves up to 2.59$times$ speedup compared with a single core.
  arXiv  Detail & Related papers  (2021-08-19T13:24:01Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

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.