Skip to content
Preprint

The Quantum Composition Paradox

Sep 2026 · 0 citations
Physics Mathematics

Abstract

Quantum theory does not generally permit the probability laws obtained from individual unitary steps by the Born rule to be sewn into a consistent genealogy; we classify the exceptions and show that faithful composition can hold from an initial boundary yet fail after an internal restart. For finite-dimensional, composition-closed unitary families, universal composition holds exactly for unitary monomials, the phase-dressed permutations whose Born kernels realize reversible deterministic state machines. Prescribed sequences evade this obstruction. We classify all pairs of qubit unitary steps, give a necessary-and-sufficient criterion for pairs of qutrit unitary steps, and prove that a boundary-stable unitary sequence on a $d$-dimensional Hilbert space contains at most $d$ fully mixing steps, with equality in every prime dimension. We also construct arbitrarily long genuinely mixing sequences that compose from their initial boundary but fail after an internal restart, and a qutrit-controlled two-qubit realization with active interference. We define a Born--Chapman--Kolmogorov current that vanishes exactly when coherent and stepwise-checked endpoint laws agree, together with an associated measure of how many bits the endpoint reveals about the intermediate checking schedule. This state-machine connection provides a foundation for a quantum theory of music, in which unitary operations are notes and temporal boundaries are cues. Musical-transition prediction is proved PromiseBQP-complete, and the stepwise patterns that preserve a genealogy specify rules for rhythm, whereas the exceptional failure of that genealogy from an internal cue is the quantum music paradox.

View source

Similar papers

Preprint Oct 2026

Pairwise detection, chiral conversion: Resource theory of quantum multistates

Basis-independent coherence of a quantum multistate is fixed by whether its constituent states commute, and for qubits it is detected by pairwise state overlaps alone. What governs its deterministic transformation has been open. We give the exact resource-conversion theory of quantum multistates under common commutativ...

Yuan-Hong Tao, Yu-Xin Wu, Bing Xie et al. · 0 citations
Preprint Sep 2026

Characterizing unitaries via quasi-process functions

It is well-known that every n-qubit unitary can be decomposed into a product of controlled single-qubit unitaries. We show that the control conditions in such a decomposition naturally define a quasi-process function, an object that originally came up in the study of indefinite causal order. Here quasi-process function...

Nasra Daher Ahmed, Ravi Kunjwal · 0 citations
Preprint Sep 2026

Bargmann Invariants Are Insufficient for Complete Local-Unitary Orbit Discrimination

Bargmann invariants constructed from a bipartite density operator and its two lifted marginals are polynomial invariants of local-unitary conjugation. We determine the precise information encoded in these invariants. Whenever one subsystem is a qubit, the ordinary marginal-word family determines the full spectrum of th...

Lin Zhang, Bing Xie · 0 citations
Preprint Sep 2026

Demailly's Conjecture in Quantum Language and Its Solution

We give an exact translation between fat-point interpolation in complex projective space and a dark-state problem for fixed-particle-number bosons. Under the unitary Fischer--Bargmann realization, homogeneous degree becomes particle number, the Veronese lift becomes a bosonic symmetric product state, and order-$m$ vani...

T. Dinh · 0 citations
Preprint Oct 2026

On the pseudorandomness of simple quantum processes

Can simple processes appear highly complex? Gowers (Comb. Prob. Comp.'96) conjectured that repeatedly composing local random reversible operations can yield global permutations that are indistinguishable from random. In this work, we study the unitary quantum analog of this question, in an attempt to make new progress...

Jesko Dujmovic, Jonas Haferkamp, Alexander Poremba · 0 citations
Preprint Oct 2026

Pauli Flat Quantum States Mimicking Maximal Magic

Quantum magic is a necessary resource for fault-tolerant quantum computing, capturing the departure of quantum states from the classically simulable stabiliser set. Motivated by its role in quantum information processing, we investigate the correlation structure of states that maximize the R\'enyi stabiliser entropies,...

Paweł Cieśliński · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.