Search arXivSearch

arXiv · 2608.20443

Granthi: Higher-Order Quantum Programming via Unitary Wiring

Abstract

Many mainstream 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 staged reversible-operation bindings provide domain-level control spaces without exposing tag management. These bindings are eliminated by elaboration before Source typing. Granthi deterministically normalizes each Source program to a canonical wiring form. Every well-typed Source program, including a term of function type, has a unitary boundary interpretation. Under backend correctness (BC), the reference compiler produces a unitary circuit realizing that interpretation. Granthi's currently supported executable fragment is implemented end-to-end: an OCaml DSL elaborates surface programs through a higher-order Core IR to executable quantum circuits via pytket. The language directly supports the pure-unitary quantum switch for explicitly supplied operations; closed instances compile to static circuits. It also supports interference on control-flow history and structured finite control, all within the purely unitary fragment

Explore related subjects

Keep this discovery

BibTeXRIS

Samson Abramsky, Radha Jagadeesan. 2026-09-08. Granthi: Higher-Order Quantum Programming via Unitary Wiring. https://arxiv.org/abs/2608.20443

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

The maximum entropy state

We give an algorithm for calculating the maximum entropy state as the least fixed point of a Scott continuous mapping on the domain of classical states in their Bayesian order.

math.PR

A brief history of quantum vs classical computational advantage

In this review article we summarize all experiments claiming quantum computational advantage to date. Our review highlights challenges, loopholes, and refutations appearing in subsequent work to provide a complete picture of the current statuses of these experiments. In addition, we also discuss theoretical computational advantage in example problems such as approximate optimization and recommendation systems. Finally, we review recent experiments in quantum error correction -- the biggest frontier to reach experimental quantum advantage in Shor's algorithm.

quant-ph

Mutually unbiased bases as extremal probes of isotropic random Hamiltonians

Mutually unbiased bases (MUBs) are central finite structures in quantum information. We ask whether complete MUB systems have an extremal probing property beyond their projective \(2\)-design identities. For an isotropic Gaussian traceless Hamiltonian, we prove that, among labeled unions of \(d+1\) orthonormal bases, a complete MUB union has the stochastically largest sampled maximum. Each basis induces the same regular-simplex Gaussian block; mutual unbiasedness eliminates cross-block covariance, joint Gaussianity yields independence, and a centered-convex Gaussian correlation inequality makes this independent coupling extremal. We also derive a radial-mixture extension and prove exact MUB-family collapse for fully matched diagonal-cost constructions.

quant-ph