Quick Navigation

Topics

Quantum Algorithms

Higher-order circuits

arXiv
Authors: Matt Wilson

Year

2026

Paper ID

15761

Status

Preprint

Abstract Read

~2 min

Abstract Words

94

Citations

N/A

Abstract

We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order bipartite processes and higher-order bipartite states. In category-theoretic terms, these laws are expressed using enrichment and cotensors in symmetric polycategories, along with a frobenius-like coherence between them. We describe how these laws capture the salient features of higher-order quantum theory, and discover an upper bound for higher-order circuits: any higher-order circuit theory embeds into the theory of strong profunctors.

Why This Paper Matters

  • It adds a 2026 reference point for readers tracking recent quantum research.
  • We write down a series of basic laws for (strict) higher-order circuit diagrams.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #15761 #69983 Spectral Leakage and Masking Ef... #69982 Dimensionality Reduction of QAO... #69981 A Hybrid Quantum-Classical Appr... #69980 Complexity Inequalities for Qua...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.