arXiv subjects

Anna Jenčová

Publications and source records attributed to Anna Jenčová.

At least 19 recordsLinked to original sources

arXiv2026

Sufficient positive maps between von Neumann algebras: Rényi divergences

We prove recovery theorems for $α$-$z$ Rényi divergences under normal unital positive maps between von Neumann algebras. Previous results in this setting required 2-positivity, while recent finite dimensional work showed that this assumption can be relaxed to mere positivity. Our proof uses sufficiency for JW*-subalgebras and $L^p$-spaces over them to characterize equality in the data processing inequality. As a further application of our methods, we solve a problem discussed by Haagerup and Stormer: Every conditional expectation of a von Neumann algebra onto a JW*-subalgebra factors through a conditional expectation onto the generated von Neumann subalgebra.

quant-ph↗

arXiv2026

Demultiplexing Generalized Information via Quantum Transmission Lines

Demultiplexers are the fundamental primitives of network architecture, enabling perfect routing of an input classical signal to a designated one, among multiple output ports. Quantum transmission lines, having access to the quantum systems directly, are able to transmit both the classical and quantum information encoded in quantum systems. A natural question therefore emerges that whether the scrambled classical and quantum information in a quantum system can be perfectly demultiplexed in the designated classical and quantum output ports? Here we answer this question by introducing a quantum to quantum-classical device, namely the quantum demultiplexer (Q-DEMUX). We characterize the class of Q-DEMUXs enabling perfect routing of both the classical and the quantum information along with their simple circuit realizations. Our results highlight an explicit connection between the strength of a Q-DEMUX with the incompatibility of quantum instruments. Finally, we extend the notion in a stronger variant where the sender is oblivious regarding the nature of the data to be transmitted through the Q-DEMUX.

quant-ph↗

arXiv2026

On the structure of higher order quantum maps

We study higher order quantum maps in the context of a *-autonomous category of affine subspaces. We show that types of higher order maps can be identified with certain Boolean functions that we call type functions. By an extension of this identification, the algebraic structure of Boolean functions is inherited by some sets of quantum objects including higher order maps. Using the Möbius transform, we assign to each type function a poset whose elements are labelled by subsets of indices of the involved spaces. We then show that the type function corresponds to a comb type if and only if the poset is a chain. We also devise a procedure for decomposition of the poset to a set of basic chains from which the type function is constructed by taking maxima and minima of concatenations of the basic chains in different orders. On the level of higher order maps, maxima and minima correspond to affine mixtures and intersections, respectively.

quant-ph↗

arXiv2026

Order structure and signalling in higher order quantum maps

We study the signalling structure of higher order quantum maps from an order-theoretic perspective, building on the combinatorial characterization of higher order types by Bisio and Perinotti. We have shown in a previous work arxiv:2411.09256 that types are represented by boolean functions called type functions, and that each such function is characterized by a related structure poset. We characterize the distributive lattice generated by all type functions with fixed indices of input and output systems - whose elements we call regular subtypes - by a monotonicity condition. Unlike the set of type functions, the lattice of regular subtypes is closed under the one-way signalling product, moreover, it is generated by a specific family of causally ordered types. We then study signalling relations for maps belonging to a regular subtype, showing that the no-signalling conditions between an input and an output system are determined by a single evaluation of the corresponding function. For higher order types specifically, we show that all signalling relations can be read off directly from the structure poset via a rank parity condition. Finally, we study relations between the structure poset of a type and its normal forms, that is, expressions of the type in terms of causally ordered types. We illustrate construction of normal forms on some examples, demonstrating the possibility that the normal form can be systematically derived from maximal chains of the poset and signalling relations between them.

quant-ph↗

arXiv2025

Coherent configurations and Frobenius structures

We prove that coherent configurations can be represented as modules over Frobenius structures in the category of real nonnegative matrices. We generalize the notion of admissible morphism from association schemes to coherent configurations. We show that the Frobenius structure associated to a coherent configuration can be modified to become a dagger Frobenius structure, and use this to connect the coherent configurations to groupoids and $H^*$-algebras. We examine the properties of the dagger Frobenius structure with respect to admissible morphisms. We introduce the matrix $O$ obtained as the composition of comultiplication and multiplication of the dagger Frobenius structure and prove that we may obtain the valencies of colors, and thus recover the original coherent configuration, as an eigenvector of $O$. In the last part of the paper, we examine the spectrum of $O$ and apply it to generalize the Lagrange theorem from groups to association schemes.

math.CO↗

arXiv2025

Belavkin-Staszewski Quantum Markov Chains

It is well-known that the conditional mutual information of a quantum state is zero if, and only if, the quantum state is a quantum Markov chain. Replacing the Umegaki relative entropy in the definition of the conditional mutual information by the Belavkin-Staszewski (BS) relative entropy, we obtain the BS-conditional mutual information, and we call the states with zero BS-conditional mutual information Belavkin-Staszewski quantum Markov chains. In this article, we establish a correspondence which relates quantum Markov chains and BS-quantum Markov chains. This correspondence allows us to find a recovery map for the BS-entropy in the spirit of the Petz recovery map. Furthermore, we show that, over the set of BS-quantum Markov chains, this correspondence constitutes an entanglement-breaking map. Moreover, we prove a structural decomposition of the Belavkin-Staszewski quantum Markov chains and also study states for which the BS-conditional mutual information is only approximately zero. We subsequently extend the aforementioned correspondence, structural decomposition and recovery map to arbitrary pairs of states and conditional expectations. As an application of the correspondence, we find the first family of states with non-vanishing conditional mutual information for which it decays superexponentially fast with the size of the middle system.

quant-ph↗

arXiv2024

$α$-$z$-Rényi divergences in von Neumann algebras: data-processing inequality, reversibility, and monotonicity properties in $α,z$

We study the $α$-$z$-Rényi divergences $D_{α,z}(ψ\|φ)$ where $α,z>0$ ($α\ne1$) for normal positive functionals $ψ,φ$ on general von Neumann algebras, introduced in [S.~Kato and Y.~Ueda, arXiv:2307.01790] and [S.~Kato, arXiv:2311.01748]. We prove the variational expressions and the data processing inequality (DPI) for the $α$-$z$-Rényi divergences. We establish the sufficiency theorem for $D_{α,z}(ψ\|φ)$, saying that for $(α,z)$ inside the DPI bounds, the equality $D_{α,z}(ψ\circγ\|φ\circγ)=D_{α,z}(ψ\|φ)<\infty$ in the DPI under a quantum channel (or a normal $2$-positive unital map) $γ$ implies the reversibility of $γ$ with respect to $ψ,φ$. Moreover, we show the monotonicity properties of $D_{α,z}(ψ\|φ)$ in the parameters $α,z$ and their limits to the normalized relative entropy as $α\nearrow1$ and $α\searrow1$.

quant-ph↗

arXiv2023

Spectrality in convex sequential effect algebras

For convex and sequential effect algebras, we study spectrality in the sense of Foulis. We show that under additional conditions (strong archimedeanity, closedness in norm and a certain monotonicity property of the sequential product), such effect algebra is spectral if and only if every maximal commutative subalgebra is monotone $σ$-complete. Two previous results on existence of spectral resolutions in this setting are shown to require stronger assumptions.

quant-ph↗

arXiv2023

Recoverability of quantum channels via hypothesis testing

A quantum channel is sufficient with respect to a set of input states if it can be reversed on this set. In the approximate version, the input states can be recovered within an error bounded by the decrease of the relative entropy under the channel. Using a new integral representation of the relative entropy in arXiv:2208.12194, we present an easy proof of a characterization of sufficient quantum channels and recoverability by preservation of optimal success probabilities in hypothesis testing problems, equivalently, by preservation of $L_1$-distance.

quant-ph↗

arXiv2023

Dispensing of quantum information beyond no-broadcasting theorem -- is it possible to broadcast anything genuinely quantum?

No-broadcasting theorem is one of the most fundamental results in quantum information theory; it guarantees that the simplest attacks on any quantum protocol, based on eavesdropping and copying of quantum information, are impossible. Due to the fundamental importance of the no-broadcasting theorem, it is essential to understand the exact boundaries of this limitation. We generalize the standard definition of broadcasting by restricting the set of states which we want to broadcast and restricting the sets of measurements which we use to test the broadcasting. We show that in some of the investigated cases broadcasting is equivalent to commutativity, while in other cases commutativity is not necessary.

quant-ph↗

arXiv2023

The exponential Orlicz space in quantum information geometry

We review the construction of a quantum version of the exponential statistical manifold over the set of all faithful normal positive functionals on a von Neumann algebra. The construction is based on the relative entropy approach to state perturbation. We construct a quantum version of the exponential Orlicz space and discuss the properties of this space and its dual with respect to Kosaki $L_p$-spaces. We show that the constructed manifold admits a canonical divergence satisfying a Pythagorean relation. We also prove that the manifold structure is invariant under sufficient channels.

quant-ph↗

arXiv2022

Spectral resolutions in effect algebras

Effect algebras were introduced as an abstract algebraic model for Hilbert space effects representing quantum mechanical measurements. We study additional structures on an effect algebra $E$ that enable us to define spectrality and spectral resolutions for elements of $E$ akin to those of self-adjoint operators. These structures, called compression bases, are special families of maps on $E$, analogous to the set of compressions on operator algebras, order unit spaces or unital abelian groups. Elements of a compression base are in one-to-one correspondence with certain elements of $E$, called projections. An effect algebra is called spectral if it has a distinguished compression base with two special properties: the projection cover property (i.e., for every element $a$ in $E$ there is a smallest projection majorizing $a$), and the so-called b-comparability property, which is an analogue of general comparability in operator algebras or unital abelian groups. It is shown that in a spectral archimedean effect algebra $E$, every $a\in E$ admits a unique rational spectral resolution and its properties are studied. If in addition $E$ possesses a separating set of states, then every element $a\in E$ is determined by its spectral resolution. It is also proved that for some types of interval effect algebras (with RDP, archimedean divisible), spectrality of $E$ is equivalent to spectrality of its universal group and the corresponding rational spectral resolutions are the same. In particular, for convex archimedean effect algebras, spectral resolutions in $E$ are in agreement with spectral resolutions in the corresponding order unit space.

quant-ph↗

arXiv2022

Spectral order unit spaces and JB-algebras

Order unit spaces with comparability and spectrality properties as introduced by Foulis are studied. We define continuous functional calculus for order unit spaces with the comparability property and Borel functional calculus for spectral order unit spaces. Applying the conditions of Alfsen and Schultz, we characterize order unit spaces with comparability property that are JB-algebras. We also prove a characterization of Rickart JB-algebras as those JB-algebras for which every maximal associative subalgebra is monotone $σ$-complete, extending an analogous result of Saitô and Wright for C*-algebras.

quant-ph↗

arXiv2022

Incompatibility in general probabilistic theories, generalized spectrahedra, and tensor norms

In this work, we investigate measurement incompatibility in general probabilistic theories (GPTs). We show several equivalent characterizations of compatible measurements. The first is in terms of the positivity of associated maps. The second relates compatibility to the inclusion of certain generalized spectrahedra. For this, we extend the theory of free spectrahedra to ordered vector spaces. The third characterization connects the compatibility of dichotomic measurements to the ratio of tensor crossnorms of Banach spaces. We use these characterizations to study the amount of incompatibility present in different GPTs, i.e. their compatibility regions. For centrally symmetric GPTs, we show that the compatibility degree is given as the ratio of the injective and the projective norm of the tensor product of associated Banach spaces. This allows us to completely characterize the compatibility regions of several GPTs, and to obtain optimal universal bounds on the compatibility degree in terms of the 1-summing constants of the associated Banach spaces. Moreover, we find new bounds on the maximal incompatibility present in more than three qubit measurements.

quant-ph↗

arXiv2022

Assemblages and steering in general probabilistic theories

We study steering in the framework of general probabilistic theories. We show that for dichotomic assemblages, steering can be characterized in terms of a certain tensor cross norm, which is also related to a steering degree given by steering robustness. Another contribution is the observation that steering in GPTs can be conveniently treated using Choquet theory for probability measures on the state space. In particular, we find a variational expression for universal steering degree for dichotomic assemblages and obtain conditions characterizing unsteerable states analogous to some conditions recently found for the quantum case. The setting also enables us to rather easily extend the results to infinite dimensions and arbitrary numbers of measurements with arbitrary outcomes.

quant-ph↗

arXiv2021

A general theory of comparison of quantum channels (and beyond)

We present a general theory of comparison of quantum channels, concerning with the question of simulability or approximate simulability of a given quantum channel by allowed transformations of another given channel. We introduce a modification of conditional min-entropies, with respect to the set F of allowed transformations, and show that under some conditions on F, these quantities characterize approximate simulability. If F is the set of free superchannels in a quantum resource theory of processes, the modified conditional min-entropies form a complete set of resource monotones. If the transformations in F consist of a preprocessing and a postprocessing of specified forms, approximate simulability is also characterized in terms of success probabilities in certain guessing games, where a preprocessing of a given form can be chosen and the measurements are restricted. These results are applied to several specific cases of simulability of quantum channels, including postprocessings, preprocessings and processing of bipartite channels by LOCC superchannels and by partial superchannels, as well as simulability of sets of quantum measurements. These questions are first studied in a general setting that is an extension of the framework of general probabilistic theories (GPT), suitable for dealing with channels. Here we prove a general theorem that shows that approximate simulability can be characterized by comparing outcome probabilities in certain tests. This result is inspired by the classical Le Cam randomization criterion for statistical experiments and contains its finite dimensional version as a special case.

quant-ph↗

arXiv2021

Geometric and algebraic aspects of spectrality in order unit spaces: a comparison

Two approaches to spectral theory of order unit spaces are compared: the spectral duality of Alfsen and Shultz and the spectral compression bases due to Foulis. While the former approach uses the geometric properties of an order unit space in duality with a base norm space, the latter notion is purely algebraic. It is shown that the Foulis approach is strictly more general and contains the Alfsen-Shultz approach as a special case. This is demonstrated on two types of examples: the JB-algebras which are Foulis spectral if and only if they are Rickart, and the centrally symmetric state spaces, which may be Foulis spectral while not necessarily Alfsen-Shultz spectral.

quant-ph↗

arXiv2020

Structure of quantum and classical implementations of Popescu-Rohrlich box

We construct implementations of the PR-box using quantum and classical channels as state spaces. In both cases our constructions are very similar and they share the same idea taken from general probabilistic theories and the square state space model. We construct all quantum qubit channels that maximally violate a given CHSH inequality, we show that they all are entanglement-breaking channels, that they have certain block-diagonal structure and we present some examples of such channels.

quant-ph↗