Granthi: Higher-Order Quantum Programming via Unitary Wiring

• URL: http://arxiv.org/abs/2608.20443v1
• Date: Thu, 20 Aug 2026 15:49:09 GMT
• Title: Granthi: Higher-Order Quantum Programming via Unitary Wiring
• Abstract summary: Existing quantum programming languages confine higher order structure to a classical host.<n>Granthi is a unitary higher-order quantum programming language built on three design commitments.<n>Granthi is implemented end-to-end: an OCaml DSL elaborates surface programs through a binder-free core IR to executable quantum circuits via pytket.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Existing quantum programming languages confine higher order structure to a classical host while restricting the quantum layer to first order operations on qubits. This paper presents Granthi, a purely unitary higher-order quantum programming language built on three design commitments: quantum programs are first class values that may be passed, returned, and coherently composed; additive structure is tag-preserving routing rather than observational branching, so control may remain in superposition; and programmer-facing finite label types with named reversible operations provide domain-level control spaces without exposing tag management. Every well-typed term, including at function type, denotes a unitary on its boundary interface, and the compiler realizes exactly its wiring as a quantum circuit on the physical qubit layout (assuming correctness of the pytket backend). Granthi is implemented end-to-end: an OCaml DSL elaborates surface programs through a binder-free core IR to executable quantum circuits via pytket. The language directly supports the quantum switch, compiled to a static circuit, as well as interference on control-flow history and structured finite control, all within the purely unitary fragment.

Related papers

• Strategic Plan for Neutral Atom Quantum Computation [84.56908019536233]
  We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements.<n>The concept of practical quantum advantage is defined, along with how to verify claims of advantage, and approaches to designing quantum algorithms that deliver practical advantage.
  arXiv  Detail & Related papers  (2026-07-23T17:36:19Z)
• Higher-Order Programs with Indefinite Causal Orders: a Linear Approach to Coherent Control of Quantum Processes [0.0]
  We introduce a higher-order quantum functional language for quantum computation.<n>It supports general quantum computation, not merely the permutation of channels.<n>It can express every quantum channel at first order, and at second order a large subclass of quantum circuits with quantum control.
  arXiv  Detail & Related papers  (2026-07-10T15:38:33Z)
• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• Full Quantum Stack: Ket Platform [0.7340017786387767]
  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.
  arXiv  Detail & Related papers  (2025-09-18T23:14:01Z)
• Quantum circuits are just a phase [0.0]
  We introduce a novel quantum programming language for generating unitaries from "just a phase"<n>This minimal language lifts the focus from quantum gates to eigendecomposition, conjugation, and controlled unitaries.
  arXiv  Detail & Related papers  (2025-07-15T19:31:53Z)
• ONDA: A High-Level Quantum Programming Language with Sequential Execution and Conditional Branching [0.0]
  ONDA is a quantum programming language designed to significantly simplify quantum programming.<n>ONDA compiles into quantum instructions executed autonomously by specialized quantum hardware.<n>By leveraging a quantum microarchitecture that autonomously processes compiled instructions, ONDA facilitates the intuitive implementation of high-level quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-09T11:16:29Z)
• 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)
• Distributed Architecture for FPGA-based Superconducting Qubit Control [7.804530685405802]
  Quantum circuits utilizing real time feedback techniques are a powerful tool for NISQ-era quantum computing. We have developed a custom FPGA-based processor architecture for QubiC, an open source platform for superconducting qubit control. We will detail the design of both the processor and compiler stack, and demonstrate its capabilities with a quantum state teleportation experiment.
  arXiv  Detail & Related papers  (2024-04-23T17:47:31Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Quantum Control Machine: The Limits of Control Flow in Quantum Programming [9.481014977048282]
  We provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer. We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.
  arXiv  Detail & Related papers  (2023-04-28T17:51:35Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Extending XACC for Quantum Optimal Control [70.19683407682642]
  Quantum computing vendors are beginning to open up application programming for direct pulse-level quantum control. We present an extension to the XACC system-level quantum-classical software framework. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences.
  arXiv  Detail & Related papers  (2020-06-04T13:13:55Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

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.