arXiv subjects

Marius Junge

Publications and source records attributed to Marius Junge.

At least 19 recordsLinked to original sources

arXiv2026

Noncommutative $L_p$-Poincaré inequalities

We derive $L_p$-Poincaré inequalities for quantum Markov semigroups on finite von Neumann algebras, from a spectral gap (PI) or from a modified logarithmic Sobolev inequality (MLSI). For $p\ge2$, the corresponding coefficients have optimal order $O(p)$ and $O(\sqrt p)$, respectively. Both estimates follow from Beckner inequalities by integration along semigroups. We also establish a non-tracial extension to quantum Markov semigroups satisfying GNS detailed balance. As a direct byproduct, we apply $L_p$-Poincaré inequalities to Schatten-valued functions on graphs in order to obtain the Schatten distortion of expanders.

math.OA↗

arXiv2026

Compatibility of quantum instruments

Measurement compatibility asks whether a family of quantum measurements can be simulated by one parent measurement followed by classical post-processing. We extend this measurement compatibility to the notion of \emph{$d$-compatibility} for measurements, channels, and instruments whose parent passes a $d$-dimensional quantum system and unlimited classical information to the post-processing. We formulate $d$-compatibility as a common linear factorization of operator spaces and operator systems and show that $d$-compatible families form a closed set, even with infinitely many settings and a separable infinite-dimensional input. To certify $d$-incompatibility, we define the compatibility functional as the smallest product of completely bounded norms over common factorizations through a $d$-dimensional register. Using factorization theory of operator spaces, we show that measure-and-prepare channels defined in terms of mutually unbiased bases and pinching channels defined in terms of Heisenberg-Weyl operators are $d$-incompatible in certain regimes of $d$. We also link $d$-compatibility of multi-instruments to the preparability of Choi assemblages using channel-state duality, and use this connection to show that for bipartite states the (in)compatibility of instruments can be used to certify Schmidt numbers and the implementability of the instrument using one-way LOCC protocols. Finally, our compatibility functional also bounds the generalized robustness of compatibility, which we interpret through a memory-bounded nontransient preparation game.

quant-ph↗

arXiv2026

Driven-Dissipative Ground State Preparation: Mixing Time and Randomness

Dissipative protocols offer a route to ground state preparation that does not require a large initial overlap with the ground state. To move beyond time independent Lindbladians and randomized Lindbladians sampled from a fixed distribution, we study driven-dissipative protocols in which the generator varies over time. Our construction uses a family of randomized Lindbladians whose jump operators are obtained by averaging the unitary evolution of random matrices under a fixed target Hamiltonian. We show that empirical averages of these Lindbladians drive arbitrary initial density matrices to low energy states. The resulting mixing time bounds depend on the Hamiltonian only through its eigenvalue distribution and remain valid even for cold starts.

quant-ph↗

arXiv2026

Avoiding Exponentially Large Groups with Open Quantum System Technology

We propose a novel approach to state preparation by embracing the full power of open quantum systems. Instead of working with the whole unitary group in $n$ qubits, we identify a small Lie group $G$ in $(n+3)$ qubits. The dimension of its Lie algebra is $\text{poly}(n)$. Every state can be approximated starting from any fixed input state by repeatedly using partial trace and state preparation in the environment alongside group operations. Moreover, we also identify a single (open system magic) interaction Hamiltonian whose unitary group can be combined with open system quantum technology mentioned above to achieve transitivity on the space of all densities. Similarly, we show that all channels on $n$ qubits can be approximated by using a larger environment, achieving channel universality. The interesting small groups we identify are derived from Lie algebras of local Pauli strings and lead to a new landscape of cheap and expensive states, densities, and channels.

quant-ph↗

arXiv2026

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↗

arXiv2026

Universal computation with magic Hamiltonians

In the conventional theory of quantum computation, universality is discussed in terms of properties of unitary gate sets. In many experimental setups, however, we instead have access to a parametrized set of Hamiltonians, which can be exponentiated for any desired time. Accordingly, we formulate a continuous analogue of universality, where adding one expensive Hamiltonian control to a cheap set of local control operators allows for universal computation. We find several concrete sets of 1- or 2-local Pauli generators $S$ and $n$-qubit ``magic" Hamiltonians $H$ that together generate the full Lie algebra $\mathfrak{su}(2^n)$, with a special focus on the Ising Hamiltonian $J$. We propose a method to directly implement any unitary by exponentiating these generator sets, and give bounds on the needed time of application of the magic Hamiltonian $H$. We find that the number of applications of $H$ needed to approximate any unitary up to accuracy $ε$ scales exponentially in the number of qubits as expected from the standard application of the Solovay-Kitaev theorem. We also find phase transitions in the size of the generated Lie algebras as the parameters of the Ising Hamiltonian are varied. We find an algorithmic application of the Chow/Rashevskii technique to implement unitaries corresponding to iterated commutators.

quant-ph↗

arXiv2026

Generalized Poincaré inequality for quantum Markov semigroups

We prove a noncommutative $p$-Poincaré inequality for GNS-detailed-balance quantum Markov semigroups (QMSs) on non-tracial $σ$-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 $σ$-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↗

arXiv2026

Isometric embeddings of noncommutative $L_p$-spaces into noncommutative symmetric spaces

We establish a noncommutative version of a familiar Johnson--Maurey--Schechtman--Tzafriri Theorem, by showing that for any $0 <p<2$ and a (not necessarily semifinite) von Neumann algebra $\mathcal{M}$ on a separable Hilbert space, if a symmetric quasi-Banach function space $E(0,1) $ containing the function $t\mapsto t^{-1/p}$, $0<t\le 1, $ then there exists a noncommutative probability space $(\mathcal{N},σ)$ such that $L_p(\mathcal{M})$ is isometric to a subspace of $E(\mathcal{N},σ)$. In particular, this answers two questions raised by Randrianantoanina in 2006.

math.OA↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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 $τ$-scaling limit.

hep-th↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2025

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örmander 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↗

arXiv2025

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ényi 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ényi 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↗

arXiv2025

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éodory 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↗

arXiv2024

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↗

arXiv2023

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örmander 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↗