In this dissertation we present results for various quantum and stochastic processes. First, we bound separations between the entangled and classical values for several classes of nonlocal t-player games. We show that for many general classes of such games, the entangled winning probability can not be much higher than the classical one. The proofs use semidefinite-programming techniques and hypergraph norms. Next, we study so-called quasirandom properties of graphs, and extend this to the quantum realm. For a certain class of quantum channels we generalize several results on equivalence between different quasirandom properties, using the non-commutative Grothendieck inequality. We also look at methods for sampling random graphs with power-law degree distributions, using Markov Chain switching methods. Using these samples we present a conjecture on the asymptotic number of triangles in the uniform random graph model. Next we study a class of stochastic processes on graphs that include the discrete Bak-Sneppen process and the contact process. These processes exhibit a phenomenon which we call the Power Light Cone, that has been used in the physics community for a long time but had not yet been proven. We provide this proof, which allows for numerical computations that estimate critical exponents. Finally, we consider a quantum version of Pascal's triangle. When Pascal's triangle is plotted modulo 2, the Sierpinski triangle appears. We prove that when the quantum version of this triangle is plotted modulo 3, a fractal known as the Sierpinski carpet emerges.
This thesis studies the capacities of quantum channels under repeated noisy evolution, with a focus on the long-time behavior of classical and quantum information transmission. The main goal is to understand how much information can still be preserved or recovered when a quantum channel is applied many times, and to develop structural, analytic, and algorithmic tools for characterizing these capacities.The core results are presented in Chapter 2. First, the thesis investigates the infinite-time regime and shows that the asymptotic capacities of quantum channels are determined by the structure of their peripheral subspace. This leads to explicit characterizations of the infinite-time classical capacity and bounds on the infinite-time quantum capacity, together with results on additivity and extensions to more general settings. The thesis then studies the finite-time behavior for GNS-symmetric channels and proves explicit exponential convergence bounds, showing that the capacities approach their infinite-time values rapidly. In addition, algorithmic methods are developed for computing the peripheral structure and the associated capacity quantities efficiently.Chapter 3 explores a related optimization-based direction motivated by Sum-of-Squares methods and semidefinite programming. Using ideas inspired by separability and SDP hierarchies, this part investigates whether machine-learning-assisted ansatz discovery can help construct more efficient SOS certificates. Although this direction is not yet complete in the specific capacity setting, it provides promising intermediate results and suggests new computational approaches for related problems in quantum information theory. Overall, this thesis provides a structural and quantitative understanding of the long-time information-carrying capabilities of noisy quantum dynamical systems, while also opening new perspectives through optimization and machine-learning-based methods.
This thesis presents a comprehensive study of phase-space measurements, decoherence, and the emergence of classicality in quantum systems. Motivated by limitations of position-based localisation in standard decoherence models, we develop a phase-space decoherence formalism using coherent-state positive operator-valued measures (POVMs). These generalised measurements, constructed from overcomplete sets of coherent states, provide a natural and physically motivated framework for modelling coarse-grained quantum observations. We develop an iterative measurement scheme for phase-space decoherence in systems with Heisenberg-Weyl,
SU(2),
SU(1,1), and
SU(N) symmetries. In each case, repeated weak measurements gradually suppress quantum interference, driving the system toward a maximally mixed state. A universal structure is shown to emerge: a single iteration maps the Wigner function to the Husimi
Q-function, removing negativity, while full decoherence maps the singular Glauber-Sudarshan
P-function to the
Q-function, eliminating all singularities. This establishes a group-independent mechanism by which phase-space measurements induce classicality. We compare this model to Lindblad-type dynamics, which describe open quantum systems via completely positive, trace-preserving semigroups. For Heisenberg-Weyl and tomographic
SU(N) systems, the measurement channel coincides exactly with isotropic Lindblad evolution. In
SU(2) and
SU(1,1) cases, the correspondence is only partial, with exact agreement in asymptotic regimes. A universal decoherence timescale,
t∗, emerges beyond which quasi-probability distributions become strictly positive. We then construct a stochastic unravelling based on Brownian motion on phase space, offering a geometric alternative to standard stochastic Schr\"odinger equations. This reveals that decoherence occurs without GKSL-type dynamics in noncompact systems. Such unravellings preserve the intrinsic phase-space symmetry and provide a natural setting for studying semiclassical limits and quantum-to-classical transitions. Finally, we extend the framework to relativistic quantum systems by defining a covariant coherent-state POVM on the future tube and constructing a Bargmann transform to the forward light cone. Preliminary results on relativistic phase-space decoherence are presented, along with possible directions for future research.
Abstract The max-relative entropy and the conditional min-entropy of a quantum state plays a central role in one-shot and zero-error quantum information theory. One attractive feature of this quantity is that it can be expressed as an optimization over the cone of positive semidefinite operators. Recently, it was shown that when replacing this cone with the cone of separable operators, a new type of conditional min-entropy emerges that admits an operational interpretation in terms of communicating classical information over a quantum channel. In this work, we explore more deeply the idea of building information-theoretic quantities from different base cones and determine which results in quantum information theory rely upon the positive semidefinite cone and which can be generalized. In terms of asymptotic information processing, we find that the standard equipartition properties break down if a given cone fails to approximate the positive semidefinite cone sufficiently well. We also show that the near-equivalence of the smooth max and Hartley entropies breaks down in this setting. We present parallel results for the extended conditional min-entropy, which requires extending the notion of k-superpositive channels to superchannels. On the other hand, we show that for classical-quantum states the separable cone is sufficient to re-cover the asymptotic theory, thereby drawing a strong distinction between the fully and partial quantum settings. We also present operational uses of this framework. We show that the cone restricted min-entropy of a Choi operator captures a measure of entanglement-assisted noiseless classical communication using restricted measurements. We also introduce a novel min-entropy-like quantity that captures the conditions for when one quantum channel can be transformed into another using bistochastic pre-processing. Lastly, we relate this framework to general conic norms and their non-additivity. Throughout this work, we concretely study generalized entropies in resource theories that capture locality and resource theories of coherence/Abelian symmetries.
The main goal of these notes is to give an introduction to the mathematics of quantum noise and some of its applications in non-equilibrium statistical mechanics. We start with some reminders from the theory of classical stochastic processes. We then provide a brief overview of quantum mechanics and quantum field theory, from the viewpoint of quantum probability and adopting the language of Hudson and Parthasarathy. We introduce quantum stochastic processes on a boson Fock space and their calculus. Whenever possible, we make connections with the relevant concepts in classical probability theory. As an application of the theory, we introduce the theory of open quantum systems, with emphasis on the physics and modeling aspects of these systems.