Full Quantum Stack: Ket Platform

• URL: http://arxiv.org/abs/2509.15484v1
• Date: Thu, 18 Sep 2025 23:14:01 GMT
• Title: Full Quantum Stack: Ket Platform
• Authors: Evandro Rosa, Eduardo Lussi, Jerusa Marchi, Rafael de Santiago,
• Abstract summary: We present an end-to-end quantum software stack, detailing each layer of abstraction from user-facing code to hardware execution.<n>We begin at the highest level with the Ket quantum programming platform, which provides an expressive, Python-based interface for algorithm development.<n>We connect the compiled circuit to its physical realization by explaining how native gates are implemented through calibrated microwave pulses.
• Score: 0.7340017786387767
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As quantum computing hardware continues to scale, the need for a robust software infrastructure that bridges the gap between high-level algorithm development and low-level physical qubit control becomes increasingly critical. A full-stack approach, analogous to classical computing, is essential for managing complexity, enabling hardware-agnostic programming, and systematically optimizing performance. In this paper, we present a comprehensive, end-to-end quantum software stack, detailing each layer of abstraction from user-facing code to hardware execution. We begin at the highest level with the Ket quantum programming platform, which provides an expressive, Python-based interface for algorithm development. We then describe the crucial multi-stage compilation process, which translates hardware-agnostic programs into hardware-compliant circuits by handling gate decomposition, qubit mapping to respect device connectivity, and native gate translation. To illustrate the complete workflow, we present a concrete example, compiling the Grover diffusion operator for a superconducting quantum processor. Finally, we connect the compiled circuit to its physical realization by explaining how native gates are implemented through calibrated microwave pulses. This includes the calibration of single- and two-qubit gates, frequency characterization, and measurement procedures, providing a clear picture of how abstract quantum programs ultimately map onto the physical control of a quantum processor. By providing a detailed blueprint of a complete quantum stack, this work illuminates the critical interplay between software abstractions and physical hardware, establishing a framework for developing practical and performant quantum applications.

Related papers

• Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• State Similarity in Modular Superconducting Quantum Processors with Classical Communications [41.94024259927014]
  We propose a cross-platform fidelity estimation algorithm tailored for modular architectures.<n>We experimentally implement the protocol on modular superconducting quantum processors with up to 6 qubits to verify the similarity of two 11-qubit GHZ states.<n>As a proof of concept, we apply it to a 5-qubit quantum phase learning task using six 3-qubit modules, successfully extracting phase information with just eight training samples.
  arXiv  Detail & Related papers  (2025-06-02T13:27:38Z)
• Design and synthesis of scalable quantum programs [0.8007726207322294]
  We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity.<n>The quantum program is expressed in terms of a high-level model together with constraints and objectives on the final program.<n>The technology adapts electronic design automation methods to quantum computing, finding feasible implementations in a virtually unlimited functional space.
  arXiv  Detail & Related papers  (2024-12-10T10:12:03Z)
• Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects [59.07692103357675]
  This survey explores the feasibility of an integrated design and optimization scheme that spans from the algorithmic level to quantum hardware.<n>It becomes more possible to reduce manual design costs, enhance the precision and efficiency of execution, and facilitate the implementation and validation of the superiority of quantum algorithms on hardware.
  arXiv  Detail & Related papers  (2024-06-30T15:50:10Z)
• 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)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Design Verification of the Quantum Control Stack [0.5089990359065384]
  The paper serves both as an introduction to quantum computing and to how classical device verification techniques can be employed there. Two main challenges in building a quantum control stack are generating precise deterministic-timing operations at the edge and scaled-out processing in the middle layer.
  arXiv  Detail & Related papers  (2023-10-08T16:51:48Z)
• Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures [2.465579331213113]
  We present a pioneering characterization of the era of monolithic-temporal inter-core qubit traffic in large-scale circuits. The programs are executed on an all-to-all connected-core architecture that supports up to around 1000 qubits. Based on the showcased results, we provide a set of guidelines to improve mapping quantum circuits to multi-core processors, and lay the foundations of benchmarking large-scale multi-core architectures.
  arXiv  Detail & Related papers  (2023-10-03T09:54:41Z)
• 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)
• Full-stack quantum computing systems in the NISQ era: algorithm-driven and hardware-aware compilation techniques [1.3496450124792878]
  We will provide an overview on current full-stack quantum computing systems. We will emphasize the need for tight co-design among adjacent layers as well as vertical cross-layer design.
  arXiv  Detail & Related papers  (2022-04-13T13:26:56Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow [7.619626059034881]
  We propose an efficient scheme for quantum circuit equivalence checking. The proposed scheme allows to verify even large circuit instances with tens of thousands of operations within seconds or even less.
  arXiv  Detail & Related papers  (2020-09-04T19:58:53Z)

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.