SearcharxivSearch

arXiv subjects

Marius Junge

Publications and source records attributed to Marius Junge.

At least 19 recordsLinked to original sources

Selfless C*-correspondences, operator valued C*-probability spaces and completely positive maps

We develop a general theory of selflessness for C*-correspondences, with several applications. Specializing this theory to completely positive maps, in particular to conditional expectations, gives rise to a novel notion of relative selflessness. Among applications, the machinery developed here yields new examples of selfless C*-algebras, for instance among minimal tensor products and reduced crossed products, new examples of MF C*-algebras arising as reduced amalgamated free products, a conceptually new proof of Kirchberg's $\mathcal{O}_{\infty}$-absorption theorem, and the lack of ``phantom'' traces on ultrapowers.

math.OA

No-signaling values of quantum games--an operator algebra perspective

The aim of this work is to study two-prover quantum games (i.e., games with quantum inputs and outputs) from an operator-algebraic and operator-space point of view. We characterize several notions of the value of such games by formulating them in terms of tensor norms in the category of operator spaces. The main results of the paper concern the description of the so-called no-signalling value of these games, for which we not only provide a precise operator-space formulation, but also establish close connections between this study and some problems in operator algebras. In particular, we show how the recent counterexample to Grothendieck's theorem for operator spaces given in \cite{Ara} can be understood as a direct consequence of results in quantum information theory. We also obtain new upper bounds on the gap between the no-signalling value and the quantum value of two-prover quantum games, improving the best previously known estimates.

quant-ph

The Hidden Nature of Non-Markovianity

The theory of open quantum systems served as a tool to prepare entanglement at the beginning stage of quantum technology and more recently provides an important tool for state preparation. Dynamics given by time dependent Lindbladians are Markovian and lead to decoherence, decay of correlation and convergence to equilibrium. In contrast Non-Markovian evolutions can outperform their Markovian counterparts by enhancing memory. In this letter we compare the trajectories of Markovian and Non-Markovian evolutions starting from a fixed initial value. It turns out that under mild assumptions every trajectory can be obtained from a family of time dependent Lindbladians. Hence Non-Markovianity is invisible if single trajectories are concerned.

quant-ph

Generalized Poincar\'e inequality for quantum Markov semigroups

We prove a noncommutative $p$-Poincar\'e inequality for GNS-detailed-balance quantum Markov semigroups (QMSs) on non-tracial $\sigma$-finite von Neumann algebras, assuming only the existence of a spectral gap. Extending the semi-commutative results of Huang and Tropp, we first establish the inequality for tracial von Neumann algebras. We use Markov dilations to obtain chain-rule estimates for Dirichlet forms and amalgamated free products to define an appropriate noncommutative derivation. We then extend the result to QMSs satisfying GNS detailed balance on non-tracial $\sigma$-finite von Neumann algebras, using Haagerup's reduction and Kosaki's interpolation theorem. As applications, we recover sub-exponential concentration inequalities and estimate the Lipschitz and completely bounded Lipschitz diameters of the QMSs.

math.OA

Operator Algebras and Third Quantization

In quantum gravity, the gravitational path integral involves a sum over topologies, representing the joining and splitting of multiple universes. To account for topology change, one is led to allow the creation and annihilation of closed and open universes in a framework often called third quantization or universe field theory. We argue that since topology change in gravity is a rare event, its contribution to exponentially late-time physics is universally described by a Poisson process. This universal Poisson process is responsible for the plateau in the multi-boundary generalization of the spectral form factor at late times. In the Fock space of closed baby universes, this universality implies that the statistics of the total number of baby universes is captured by a coherent state. Allowing for the creation of asymptotic open universes calls for a noncommutative generalization of a Poisson process. We propose such an operator algebraic framework, called Poissonization, which takes as input the observable algebra and a (unnormalized) state of a quantum system and outputs a von Neumann algebra of a many-body theory represented on its symmetric Fock space. Physically, Poissonization is a generalization of the coherent state vacua of bipartite quantum systems or matrix quantum mechanics. The multi-boundary correlators of the Marolf-Maxfield toy model of baby universes, and the sum over bordisms of closed-open 2D topological quantum field theory, are entirely captured by Poissonization. In the Jackiew-Teitelboim gravity, the universal Poisson process reproduces the late-time correlators in the $\tau$-scaling limit.

hep-th

Strong converse rate for asymptotic hypothesis testing in type III

We extend from the hyperfinite setting to general von Neumann algebras Mosonyi and Ogawa's (2015) and Mosonyi and Hiai's (2023) results showing the operational interpretation of sandwiched relative R\'enyi entropy in the strong converse of hypothesis testing. The specific task is to distinguish between two quantum states given many copies. We use a reduction method of Haagerup, Junge, and Xu (2010) to approximate relative entropy inequalities in an arbitrary von Neumann algebra by those in finite von Neumann algebras. Within these finite von Neumann algebras, it is possible to approximate densities via finite spectrum operators, after which the quantum method of types reduces them to effectively commuting subalgebras. Generalizing beyond the hyperfinite setting shows that the operational meaning of sandwiched R\'enyi entropy is not restricted to the matrices but is a more fundamental property of quantum information. Furthermore, applicability in general von Neumann algebras opens potential new connections to random matrix theory and the quantum information theory of fundamental physics.

quant-ph

Transportation cost and contraction coefficient for channels on von Neumann algebras

We present a noncommutative optimal transport framework for quantum channels acting on von Neumann algebras. Our central object is the Lipschitz cost measure, a transportation-inspired quantity that evaluates the minimal cost required to move between quantum states via a given channel. Accompanying this is the Lipschitz contraction coefficient, which captures how much the channel contracts the Wasserstein-type distance between states. We establish foundational properties of these quantities, including continuity, dual formulations, and behavior under composition and tensorization. Applications include recovery of several mathematical quantities including expected group word length and Carnot-Carath\'eodory distance, via transportation cost. Moreover, we show that if the Lipschitz contraction coefficient is strictly less than one, one can get entropy contraction and mixing time estimates for certain classes of non-symmetric channels.

math.OA

How Far do Lindbladians Go?

We study controllability of finite-dimensional open quantum systems under a general Markovian control model combining full coherent (unitary) control with tunable dissipative channels. Assuming the Hamiltonian controls is a H\"ormander system that generate $\mathfrak{su}(n)$, we ask how little dissipation suffices to make the full state space $\mathcal{D}(\mathcal{H})$ controllable. We show that minimal non-unital noise can break unitary-orbit invariants and, in many cases, a very small set of jump operators yields transitivity on $\mathcal{D}(\mathcal{H})$. For multi-qubit systems we prove explicit transitivity results for natural resources such as a single-qubit amplitude-damping jump together with a dephasing channel, and we identify obstructions when only self-adjoint jump operators are available (yielding only unital evolutions). We further develop a geometric viewpoint and ask the ``lifting'' question: when can a path of densities be obtained from applying a time-dependent family of Lindbladian to an initial state? For this, we have to analyze the tangent structure of the ``manifold with corners'' and how this tangent structure reflects Lindbldian evolution. Building on this framework, we derive reachability criteria and no-go results based on a norm-decrease alignment condition, including a geometric obstruction arising from the incompatibility between admissible tangent directions and dissipative contraction.

quant-ph

Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach

Simulating quantum dynamics is one of the most promising applications of quantum computers. While the upper bound of the simulation cost has been extensively studied through various quantum algorithms, much less work has focused on establishing the lower bound, particularly for the simulation of open quantum system dynamics. In this work, we present a general framework to calculate the lower bound for simulating a broad class of quantum Markov semigroups. Given a fixed accessible unitary set, we introduce the concept of convexified circuit depth to quantify the quantum simulation cost and analyze the necessary circuit depth to construct a quantum simulation scheme that achieves a specific order. Our framework can be applied to both unital and non-unital quantum dynamics, and the tightness of our lower bound technique is illustrated by showing that the upper and lower bounds coincide in several examples.

quant-ph

On a question of Blecher, Pisier, Shlyakhtenko

We show the failure of a matricial version of Grothendieck's theorem for operator spaces, thereby resolving a long-standing open question in the field. Moreover, by showing that such a counterexample can occur in the simplest context of commutative $C^*$-algebras, we address some other open questions in operator algebras. Our constructions, completely explicit and fairly simple, are inspired by some techniques in quantum information theory.

math.OA

Noncommutative Poisson Random Measure and Its Applications

We introduce a noncommutative Poisson random measure on a von Neumann algebra. This is a noncommutative generalization of the classical Poisson random measure. We call this construction Poissonization. Poissonization is a functor from the category of von Neumann algebras with normal semifinite faithful weights to the category of von Neumann algebras with normal faithful states. Poissonization is a natural adaptation of the second quantization to the context of von Neumann algebras. The construction is compatible with normal (weight-preserving) homomorphisms and unital normal completely positive (weight-preserving) maps. We present two main applications of Poissonization. First Poissonization provides a new framework to construct algebraic quantum field theories that are not generalized free field theories. Second Poissonization permits straight-forward calculations of quantum relative entropies (and other quantum information quantities) in the case of type III von Neumann algebras.

math.OA

Resource-Dependent Complexity of Quantum Channels

We introduce a new framework for quantifying the complexity of quantum channels, grounded in a suitably chosen resource set. This class of convex functions is designed to analyze the complexity of both open and closed quantum systems. By leveraging Lipschitz norms inspired by quantum optimal transport theory, we rigorously establish the fundamental properties of this complexity measure. The flexibility in selecting the resource set allows us to derive effective lower bounds for gate complexities and simulation costs of both Hamiltonian simulations and dynamics of open quantum systems. Additionally, we demonstrate that this complexity measure exhibits linear growth for random quantum circuits and finite-dimensional quantum simulations, up to the Brown-Susskind threshold.

quant-ph

On the power of quantum entanglement in multipartite quantum XOR games

In this paper we show that, given $k\geq 3$, there exist $k$-player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that the entangled bias is always upper bounded by a universal constant times the one-way classical communication bias.

quant-ph

Entropy Uncertainty Relations and Strong Sub-additivity of Quantum Channels

We prove an entropic uncertainty relation for two quantum channels, extending the work of Frank and Lieb for quantum measurements. This is obtained via a generalized strong super-additivity (SSA) of quantum entropy. Motivated by Petz's algebraic SSA inequality, we also obtain a generalized SSA for quantum relative entropy. As a special case, it gives an improved data processing inequality.

quant-ph

Stability property for the quantum jump operators of an open system

We show the continuity property of spectral gaps and complete Logarithmic constants in terms of the jump operators of Lindblad generators in finite dimensional setting. Our method is based on the bimodule structure of the derivation space and the technique developed in [Paulsen09]. Using the same trick, we also show the continuity of the $g^2(0)$ constant used to distinguish quantum and classical lights in quantum optics.

math.OA

Entropy Decay Estimates For Collective Noise Models

One of the challenges in quantum information science is to control open quantum systems with a large number of qubits. An important aspect of many-body systems is the emergence of collective phenomena. One collective noise model is an open atomic system in an electromagnetic environment. This model was considered by Dicke in the 50's Dicke. In this paper, we study the entropic decay in Dicke's model and other related collective noise models. Specifically, we develop a general framework to estimate the spectral gap and modified logarithmic Sobolev constant of these collective noise models. In addition, we study the necessary mixing conditions a general Dicke's model must satisfy in order to have a unique equilibrium state. The combination of representation theory and entropy estimates could be a guideline to study more general collective noise models.

quant-ph

Relative entropy decay and complete positivity mixing time

We prove that the complete modified logarithmic Sobolev constant of a quantum Markov semigroup is bounded by the inverse of its complete positivity mixing time. For classical Markov semigroups, this implies that every sub-Laplacian given by a H\"ormander system on a compact manifold satisfies a uniform modified log-Sobolev inequality for matrix-valued functions. For quantum Markov semigroups, we obtain that the complete modified logarithmic Sobolev constant is comparable to spectral gap up to a constant as logarithm of dimension constant. This estimate is asymptotically tight for a quantum birth-death process. Our results and the consequence of concentration inequalities apply to GNS-symmetric semigroups on general von Neumann algebras.

quant-ph

On the relation between completely bounded and $(1,cb)$-summing maps with applications to quantum XOR games

In this work we show that, given a linear map from a general operator space into the dual of a C$^*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(1,cb)$-summing norm. This problem is motivated by the study of quantum XOR games in the field of quantum information theory. In particular, our results imply that for such games entangled strategies cannot be arbitrarily better than those strategies using one-way classical communication.

math.FA