Searcharxiv⌕ Search

arXiv subjects

Andre Kornell

Publications and source records attributed to Andre Kornell.

At least 19 recordsLinked to original sources
arXiv2026

Localizing quantum information

The idea that information can be localized is pervasive in physics. In thermodynamics, entropy flows from one reservoir to another, and in quantum gravity, the entropy content of some spatial regions is bounded. In quantum information theory, information is transmitted from one place to another, and entanglement can provide an advantage when there are constraints on such transmission. Shannon entropy quantifies localizable information in the sense that marginalization defines an outer measure on the set of parts of a classical multipartite system. In contrast, von Neumann entropy does not quantify localizable information in this sense. However, a variant of von Neumann entropy, which originates in noncommutative geometry, does. We prove that this adjusted von Neumann entropy is the minimum quantum entropy that quantifies localizable information. We also prove that this is the unique quantum entropy that characterizes Bell states in terms of redundant information, directly generalizing the classical case. We work with finite-dimensional $C^*$-algebras throughout, modeling finite quantum systems that may have superselection sectors.

quant-ph↗
arXiv2026

Vertex-transitive quantum graphs

We define a quantum graph to be vertex-transitive if the join of its automorphism group is the maximum quantum relation on its quantum vertex set, in direct analogy with the classical case. All simple quantum graphs in $M_2(\mathbb C)$ are vertex-transitive, but many simple quantum graphs in $M_3(\mathbb C)$ are not vertex-transitive. We provide a complete classification of vertex-transitive quantum graphs in $M_3(\mathbb C)$ up to isomorphism. To do this, we introduce a polynomial invariant for quantum graphs in $M_n(\mathbb C)$, which we call the panoramic polynomial.

math.OA↗
arXiv2026

Quantum graphs of homomorphisms

We introduce a category $\mathsf{qGph}$ of quantum graphs, whose definition is motivated entirely from noncommutative geometry. For all quantum graphs $G$ and $H$ in $\mathsf{qGph}$, we then construct a quantum graph $[G,H]$ of homomorphisms from $G$ to $H$, making $\mathsf{qGph}$ a closed symmetric monoidal category. We prove that for all finite graphs $G$ and $H$, the quantum graph $[G,H]$ is nonempty iff the $(G,H)$-homomorphism game has a winning quantum strategy, directly generalizing the classical case. The finite quantum graphs in $\mathsf{qGph}$ are tracial, real, and self-adjoint, and the morphisms between them are CP morphisms that are adjoint to a unital $*$-homomorphism. We prove that Weaver's two notions of a CP morphism coincide in this context. We also include a short proof that every finite reflexive quantum graph is the confusability quantum graph of a quantum channel.

quant-ph↗
arXiv2025

A new characterization of Kac-type discrete quantum groups

We obtain two related characterizations of discrete quantum groups and discrete quantum groups of Kac type as allegorical group objects in the symmetric monoidal dagger category of quantum sets and relations, of interest to quantum predicate logic and quantum information theory. Specifically, we characterize discrete quantum groups by the existence of an inversion relation and discrete quantum groups of Kac type by the existence of an inversion function. This confirms a conjectured description of discrete quantum groups of Kac type and brings them within the purview of category-internal universal algebra.

math.QA↗
arXiv2025

The quantum Ramsey numbers $QR(2,k)$

Operator systems of matrices can be viewed as quantum analogues of finite graphs. This analogy suggests many natural combinatorial questions in linear algebra. We determine the quantum Ramsey numbers $QR(2,k)$ and the lower quantum Turán numbers $T^\downarrow(n, m)$ with $m \geq n/4$. In particular, we conclude that $QR(2,2) = 4$ and confirm Weaver's conjecture that $T^\downarrow(4, 1) = 4$. We also obtain a new result for the existence of anticliques in quantum graphs of low dimension.

math.OA↗
arXiv2025

Some improvements to product formula circuits for Hamiltonian simulation

We provide three improvements to the product formula implementation of the ground state energy estimation algorithm via Trotter-Suzuki decomposition. These consist of smaller circuit templates for each Hamiltonian term, parallelization of commuting controlled rotations, and more efficient parallel scheduling. These improvements may be regarded separately, and we anticipate that they may be combined with other improvements to the product formula implementation.

quant-ph↗
arXiv2025

On the structure of modal and tense operators on a boolean algebra

We study the poset NO(B) of necessity operators on a boolean algebra B. We show that NO(B) is a meet-semilattice that need not be distributive. However, when B is complete, NO(B) is necessarily a frame, which is spatial iff B is atomic. In that case, NO(B) is a locally Stone frame. Dual results hold for the poset PO(B) of possibility operators. We also obtain similar results for the posets TNO(B) and TPO(B) of tense necessity and possibility operators on B. Our main tool is Jonsson-Tarski duality, by which such operators correspond to continuous and interior relations on the Stone space of B.

math.LO↗
arXiv2025

Characterizations of homomorphisms among unital completely positive maps

We prove that a unital completely positive map between finite-dimensional C*-algebras is a homomorphism if and only if it is completely entropy-nonincreasing, where the relevant notion of entropy is a variant of von Neumann entropy. This adjusted von Neumann entropy is the negative of the relative entropy with respect to the uniform state on the C*-algebra, up to an additive constant. As an intermediate step, we prove that a unital completely positive map between finite-dimensional C*-algebras is a homomorphism if and only if its adjusted Choi operator is a projection. Both equivalences generalize familiar facts about stochastic maps between finite sets.

math.OA↗
arXiv2024

Completely hereditarily atomic OMLs

An irreducible complete atomic OML of infinite height cannot both be algebraic and have the covering property. However, Kalmbach's construction provides an example of such an OML that is algebraic and has the 2-covering property, and Keller's construction provides an example of such an OML that has the covering property and is completely hereditarily atomic. Completely hereditarily atomic OMLs generalize algebraic OMLs suitably to quantum predicate logic.

quant-ph↗
arXiv2024

Categories of quantum cpos

This paper unites two research lines. The first involves finding categorical models of quantum programming languages and their type systems. The second line concerns the program of quantization of mathematical structures, which amounts to finding noncommutative generalizations (also called quantum generalizations) of these structures. Using a quantization method called discrete quantization, which essentially amounts to the internalization of structures in a category of von Neumann algebras and quantum relations, we find a noncommutative generalization of $\omega$-complete partial orders (cpos), called quantum cpos. Cpos are central in domain theory, and are widely used to construct categorical models of programming languages. We show that quantum cpos have similar categorical properties to cpos and are therefore suitable for the construction of categorical models for quantum programming languages, which is illustrated with some examples. For this reason, quantum cpos may form the backbone of a future quantum domain theory.

math-ph↗
arXiv2022

Axioms for the category of Hilbert spaces

We provide axioms that guarantee a category is equivalent to that of continuous linear functions between Hilbert spaces. The axioms are purely categorical and do not presuppose any analytical structure. This addresses a question about the mathematical foundations of quantum theory raised in reconstruction programmes such as those of von Neumann, Mackey, Jauch, Piron, Abramsky, and Coecke.

math.CT↗
arXiv2022

Discrete quantum structures

A majority of established quantum generalizations of discrete structures are shown to be instances of a single quantum generalization. In particular, the quantum graphs of Duan, Severini and Winter, the quantum metric spaces of Kuperberg and Weaver, the quantum isomorphisms of Atserias, Mančinska, Roberson, Šámal, Severini and Varvitsiotis and the quantum groups of Woronowicz that are all discrete in the sense that the underlying von Neumann algebra is hereditarily atomic are shown to be subclasses of a single class of discrete quantum structures. Such a discrete quantum structure is defined to be a discrete quantum space equipped with relations and functions of various arities. Weaver's quantum predicate logic, a generalization of the quantum propositional logic of Birkhoff and von Neumann, provides canonical quantum generalizations for a large class of properties. The equality relation on discrete quantum spaces that is introduced here plays a central role in this approach to mathematical quantization.

math.OA↗
arXiv2021

A natural deduction system for orthomodular logic

Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. Orthomodular logic is shown to be a nonlinear noncommutative logic. Sequents are given a physically motivated semantics that is consistent with exactly one semantics for propositional formulas that use negation, conjunction, and implication. In particular, implication must be interpreted as the Sasaki arrow, which satisfies the deduction theorem in this logic. As an application, this deductive system is extended to two systems of predicate logic: the first is sound for Takeuti's quantum set theory, and the second is sound for a variant of Weaver's quantum logic.

math.LO↗
arXiv2021

Quantum sets

A quantum set is defined to be simply a set of nonzero finite-dimensional Hilbert spaces. Together with binary relations, essentially the quantum relations of Weaver, quantum sets form a dagger compact category. Functions between quantum sets are certain binary relations that can be characterized in terms of this dagger compact structure, and the resulting category of quantum sets and functions generalizes the category of ordinary sets and functions in the manner of noncommutative mathematics. In particular, this category is dual to a subcategory of von Neumann algebras. The basic properties of quantum sets are presented thoroughly, with the noncommutative dictionary in mind, and with an eye to convenient application. As a motivating example, a notion of quantum graph coloring is derived within this framework, and it is shown to be equivalent to the notion that appears in the quantum information theory literature.

math.OA↗
arXiv2021

Quantum CPOs

We introduce the monoidal closed category qCPO of quantum cpos, whose objects are "quantized" analogs of omega-complete partial orders (cpos). The category qCPO is enriched over the category CPO of cpos, and contains both CPO, and the opposite of the category FdAlg of finite-dimensional von Neumann algebras as monoidal subcategories. We use qCPO to construct a sound model for the quantum programming language Proto-Quipper-M (PQM) extended with term recursion, as well as a sound and computationally adequate model for the Linear/Non-Linear Fixpoint Calculus (LNL-FPC), which is both an extension of the Fixpoint Calculus (FPC) with linear types, and an extension of a circuit-free fragment of PQM that includes recursive types.

cs.PL↗