Probability · Cross-listed from eess.SY
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 17 March
We develop LENORI, a Large Event Number of Outages Resilience Index measuring distribution system resilience with the number of forced line outages observed in large extreme events. LENORI is calculated from standard utility outage data. The statistical accuracy of LENORI is ensured by taking the logarithm of the outage data. A related Average Large Event Number of Outages metric ALENO is also developed, and both metrics are applied to a distribution system to quantify the power grid strength relative to the extreme events stressing the grid. The metrics can be used to track resilience and quantify the contributions of various types of hazards to the overall resilience.
Statistics Theory · Cross-listed from stat.ML
Conditional Distributional Treatment Effects: Doubly Robust Estimation and Testing
Beyond conditional average treatment effects, treatments may impact the entire outcome distribution in covariate-dependent ways, for example, by altering the variance or tail risks for specific subpopulations. We propose a novel estimand to capture such conditional distributional treatment effects, and develop a doubly robust estimator that is minimax optimal in the local asymptotic sense. Using this, we develop a test for the global homogeneity of conditional potential outcome distributions that accommodates discrepancies beyond the maximum mean discrepancy (MMD), has provably valid type 1 error, and is consistent against fixed alternatives—the first test, to our knowledge, with such guarantees in this setting. We then provide a test that aggregates evidence across a grid of kernel-bandwidth choices. Furthermore, we derive exact closed-form expressions for two natural discrepancies (including the MMD), and provide a computationally efficient, permutation-free algorithm for our test.
Read the full abstract
Complex Variables
The Hilbert matrix on analytic tent spaces
We study for the first time the action of the Hilbert matrix $$\mathcal H=(c_{n,k})_{n,k\geq 0}, \quad c_{n,k}=\frac{1}{n+k+1}$$ on the analytic tent spaces $AT^q_p, 1<p,q <\infty,$ of the unit disc $\mathbb D$ of the complex plane. They were proposed by Triebel as the natural analytic version of the tent spaces of measurable functions defined by Coifman, Meyer and Stein. The $AT_p^q$ spaces are consisted of those analytic functions $f$ in $\mathbb D$ such that $$ \|f\|_{AT_{p}^{q}}= \left\{\int_{\mathbb T} \left(\int_{\Gamma_{1/2}(\xi)} |f(z)|^p \ \frac{dA(z)}{1-|z|^2} \right)^{q/p}\ |d\xi|\right \}^{1/q}<+\infty, $$ where $$ \Gamma_{1/2}(\xi) =\bigl\{ z\in \mathbb{D} : |z|< 1/2 \bigr\} \cup \bigcup_{|z|<1/2}[z,\xi), $$ $dA(z)$ is the normalized area Lebesgue measure in $\mathbb D$ and $|d\xi|$ is the arc length in the unit circle $\mathbb T$. The Bergman spaces $A^p, p>1,$ stand among the $AT_{p}^{q}$ and correspond to the case $p=q$. The multiplication of the Hilbert matrix with the column matrix with entries the Taylor coefficients of an $f(z)=\sum_{k\geq 0} a_k z^k $ analytic in $\mathbb D$ introduces the series $$ \mathcal H (f)(z)= \sum_{n=0}^{\infty}\left(\sum_{k=0}^{\infty} \frac{a_k}{n+k+1}\right)z^n\,, \quad z\in \mathbb D\,\, $$ known in the literature as Hilbert operator. We prove that it is a bounded operator on the $AT_{p}^{q}$ when $1/p + 1/q <1,\, p>2$. This is a natural range for the values of the indices $p,q$ compared to what is known in the special case of the Bergman spaces. We confront the question under discussion through a more general point of view by studying an associated integral operator defined with respect to a positive Borel measure $\mu$ on $[0,1)$. Finally, we provide an estimation of the norm of the Hilbert operator. Our work extends in a non-trivially way previous results on the Bergman spaces to the analytic tent spaces.
Read the full abstract
Probability
Age-dependent random connection models with arc reciprocity: clustering and connectivity
We introduce a model for directed spatial networks. Starting from an age-based preferential attachment model in which all arcs point from younger to older vertices, we add reciprocal connections whose probabilities depend on the age difference between their end-vertices. This yields a directed graph with reciprocal correlations, a power-law indegree distribution, and a tunable outdegree distribution. We consider two versions of the model: an infinite version embedded in $\mathbb{R}^d$, which can be constructed as a weight-dependent random connection model with a non-symmetric kernel, and a growing sequence of graphs on the unit torus that converges locally to the infinite model. Besides establishing the local limit result linking the two models, we investigate degree distributions, various directed clustering metrics, and directed percolation.
Read the full abstract
Group Theory
Inadmissible representations of the tree automorphism group
The automorphism group of a regular locally finite tree is shown to admit irreducible Banach representations that are not admissible. The dense subspace of smooth vectors contains no algebraically irreducible component.
Group Theory
Revisiting fully residually free Demushkin groups
We establish new examples and non-examples of pro-p limit groups among the class of Demushkin groups, that is, pro-p Poincaré duality groups of dimension 2.
Optimization and Control
Exponential stability of data-driven nonlinear MPC based on input/output models
We consider nonlinear model predictive control (MPC) schemes without stabilizing terminal conditions, where the model used in the optimization step is generated based on input-output data only. We establish exponential stability for sufficiently long prediction horizons assuming exponential stabilizability and a proportional error bound. Moreover, we verify the imposed condition on the approximation using kernel interpolation and demonstrate the practical applicability to nonlinear systems by numerical simulations.
Read the full abstract
Logic
Computability of the Hahn-Banach Theorem Revisited
Computational properties of the Hahn-Banach theorem have been studied in computable, constructive and reverse mathematics and in all these approaches the theorem is equivalent to weak Kőnig's lemma. Gherardi and Marcone proved that this is also true in the uniform sense of Weihrauch complexity. However, their result requires the underlying space to be variable. We prove that the Hahn-Banach theorem attains its full complexity already for the Banach space $\ell^1$. We also prove that the one-step Hahn-Banach theorem for this space is Weihrauch equivalent to the intermediate value theorem. This also yields a new and very simple proof of the reduction of the Hahn-Banach theorem to weak Kőnig's lemma using infinite products. Finally, we show that the Hahn-Banach theorem for $\ell^1$ in the two-dimensional case is Weihrauch equivalent to the lesser limited principle of omniscience.
Read the full abstract
Mathematical Physics
The weakly interacting tenfold way
The tenfold way is a classification scheme for the building blocks of free fermion systems. More precisely, it classifies the isomorphism classes of spaces of equivariant free Hamiltonians in irreducible fermion systems with symmetries. This classification scheme naturally leads to the K-theoretical classification of topological phases of matter, known as the periodic table of topological insulators and superconductors. Topological K-theory is represented by spectra $KU$ and $KO$, and in this article we present realizations of these spectra in terms of time evolution operators of irreducible free fermion systems with symmetries, with explicit formulas for the structural suspension maps. We introduce a geometric definition of the space of weakly interacting time evolution operators, as the complement of the cut locus of the subspace of free operators. Our main result is that spectra $KU^{wi}$ and $KO^{wi}$ of weakly interacting time evolution operators deformation retract to $KU$ and $KO$. We thus have a stable homotopy theoretical proof that the tenfold way is stable to weak interactions.
Read the full abstract
Statistics Theory · Cross-listed from cs.LG
High-Dimensional Gaussian Mean Estimation under Realizable Contamination
We study mean estimation for a Gaussian distribution with identity covariance in $\mathbb{R}^d$ under a missing data scheme termed realizable $\epsilon$-contamination model. In this model an adversary can choose a function $r(x)$ between 0 and $\epsilon$ and each sample $x$ goes missing with probability $r(x)$. Recent work Ma et al., 2024 proposed this model as an intermediate-strength setting between Missing Completely At Random (MCAR) – where missingness is independent of the data – and Missing Not At Random (MNAR) – where missingness may depend arbitrarily on the sample values and can lead to non-identifiability issues. That work established information-theoretic upper and lower bounds for mean estimation in the realizable contamination model. Their proposed estimators incur runtime exponential in the dimension, leaving open the possibility of computationally efficient algorithms in high dimensions. In this work, we establish an information-computation gap in the Statistical Query model (and, as a corollary, for Low-Degree Polynomials and PTF tests), showing that algorithms must either use substantially more samples than information-theoretically necessary or incur exponential runtime. We complement our SQ lower bound with an algorithm whose sample-time tradeoff nearly matches our lower bound. Together, these results qualitatively characterize the complexity of Gaussian mean estimation under $\epsilon$-realizable contamination.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Boosted linear-optical measurements on single-rail qubits with unentangled ancillas
Any quantum state of the radiation field, sliced in small non-overlapping space-time bins is a collection of single-rail qubits, each spanning the vacuum and single-photon Fock state of a mode. Quantum logic on these qubits would enable arbitrary measurements on information-bearing light, but is hard due to the lack of strong nonlinearities. With unentangled ancilla single-rail qubits, an $8$-port interferometer and photon detection, we show any single-rail qubit measurement in the $XY$ Bloch plane is realizable with success probability $147/256$, which beats the prior-known $1/2$ limit.
Read the full abstract
Number Theory
Fractional parts of powers of negative rationals
We prove that for any real number $\xi\neq 0$ and any coprime integers $p>q\ge1$ such that $\xi$ is irrational or $q>1$, the image in $\mathbb{R}/\mathbb{Z}$ of the sequence $(\xi (-p/q)^n)_{n\ge 0}$ is not contained in any interval of length less than $(1+q/p-q^2/p^2)/p$.
Functional Analysis
A note on Pisier's method in interpolation of abstract Hardy spaces
In his approach to Jones theorem on the interpolation of Hardy spaces on the torus, Pisier introduced an original method allowing the computation of complex interpolation spaces by means of real interpolation techniques. This approach has been successfully extended to noncommutative analytic Hardy spaces arising from subdiagonal algebras. In this paper, we formulate and prove an abstract version of Pisier s method in a more general setting. The method is then applied in the study of noncommutative martingale transforms.
Read the full abstract
Analysis of PDEs
Stabilization of solutions to a model of Langmuir-Blodgett films
We show stabilisation of solutions to one-dimensional advective Cahn-Hilliard equation modeling the Langmuir-Blodgett thin films. This problem has the structure of a gradient flow perturbed by a linear term $\beta u_x$. Through application of an abstract result by Carvalho-Langa-Robinson, we show that for small $\beta$ the equation has the structure of gradient flow in a weak sense. Combining this with the finite number of steady states implies stabilization of solutions.
Read the full abstract
Statistics Theory
Local asymptotic normality for mixed fractional Ornstein-Uhlenbeck process under high-frequency observation
This paper consider the LAN property for the mixed O-U process under high-frequency observation when H>3/4. As considered in mixed fractional Brownian motion, we will also use the projection step to get the non-diagonal rate matrix.
Optimization and Control
Quantum-Enabled Probabilistic Optimal Power Flow with Built-in Differential Privacy
Quantum computing has been regarded as a promising approach to accelerate power system optimization. However, challenges such as limited qubits and inherent noise hinder their widespread adoption in power systems. In this paper, we propose a qubit-efficient framework for solving a crucial power system optimization problem, the probabilistic optimal power flow (POPF). We demonstrate that quantum noise, traditionally viewed as a drawback, can in fact be leveraged to provide a built-in differential privacy (DP) guarantee. Specifically, we first linearize POPF into a multi-parametric linear program (MP-LP) with renewable uncertainties being the parameters. This decomposes the parameter space into critical regions with precomputed solution maps. Second, a variational quantum circuit (VQC) classifies the critical region based on each uncertainty realization and then recovers the final solution. In this way, the required qubits scale with the uncertain parameters instead of the network size, with only 5 qubits versus 600+ for direct quantum OPF in a 69-bus system. Moreover, we prove the depolarizing noise of VQC provides DP guarantees and characterize the privacy-cost tradeoff. Case studies validate the proposed VQC achieves 2.1$\times$ smaller privacy budgets compared to its classical counterpart. At matched privacy levels, the VQC also maintains lower infeasibility and prediction error.
Read the full abstract
Complex Variables
Associative algebras in $CR$-geometry
A procedure for the algebraization of a $CR$-manifold and its holomorphic automorphisms is described. Examples of the application of algebraization are considered. Questions arising in connection with the algebraization of a $CR$-manifold are formulated. The possibilities of extending this procedure to other branches of geometry and analysis are discussed.
Read the full abstract
Geometric Topology
Tree-like is not a transitive relation on paths
The notions of tree-like loop and Lipschitz tree-like loop were introduced by Hambly and Lyons in their 2010 Annals of Mathematics paper. They showed that the Lipschitz tree-like property determines an equivalence relation on the set of paths of bounded variation in a given metric space and then asked if this notion could be extended to paths without the Lipschitz requirement. We show that after eliminating the Lipschitz requirement, the resulting relation is no longer transitive and thus is not an equivalence relation. The counterexample is obtained by analyzing an explicit fractal construction in the plane.
Read the full abstract
Group Theory
Commuting probability of skew left braces
We introduce a concept of the commuting probability of a skew left brace analogous to group theory. We establish upper and lower bounds for the commuting probability and prove that, for finite non-trivial skew left braces, it is always at most $\frac{3}{4}$. Interestingly, there is no skew left brace with commuting probability in the open interval $(5/8, 1)$, except $\frac{3}{4}$, for which we construct an explicit example. A characterization of skew left braces having commuting probability $\frac{3}{4}$ or $\frac{5}{8}$ is presented. We further show that the finite skew left braces with commuting probability larger than $\frac{65}{128}$ are necessarily nilpotent. We prove that the commuting probability remains invariant under isoclinism of skew braces. We introduce a concept of a compact Hausdorff topological skew left brace $B$, where we prove that the set of all elements of $B$ having finite centraliser index in $B$ is a Borel subgroup. For such infinite non-trivial skew left braces too $\frac{3}{4}$ is the upper bound for the commuting probability, and $\frac{3}{4}$ is the only rational number which occurs as commuting probability in the open interval $(5/8, 1)$.
Read the full abstract
Analysis of PDEs
Nonlinear Landau damping for the two-species screened Vlasov-Poisson system with large initial distributions
We investigate nonlinear Landau damping for the two-species screened Vlasov-Poisson system with large initial distributions on the phase space $\mathbb{R}^d \times \mathbb{R}^d$ (where $d \geq 3$). Under a structural quasi-neutrality condition, we establish the existence and uniqueness of global strong solutions to the two-species system with arbitrarily large initial distributions. Furthermore, we prove the time-asymptotic stability of Penrose-stable equilibria and establish the optimal decay rate $t^{-d}$ for the net charge density, thereby verifying the nonlinear Landau damping effect for the two-species screened Vlasov-Poisson system in the whole space. To the best of our knowledge, this represents the first result on Landau damping for the two-species Vlasov-Poisson system with large initial distributions that are significantly far from equilibrium.
Read the full abstract
Rings and Algebras
General multi-Novikov algebras, multi-differential algebras and their free constructions
Motivated by the recent development of noncommutative Novikov algebras and multi-Novikov algebras from the study of regularity structures of stochastic PDEs, this paper gives a general approach to study various multi-Novikov algebras and multi-differential algebras, with close connection with Poisson algebras. The construction of S. Gelfand of Novikov algebras from differential commutative algebras is generalized to this context. Free noncommuting multi-Novikov algebras are constructed from typed decorated rooted trees and from noncommuting multi-differential polynomials with populated conditions.
Read the full abstract
Group Theory
Coherent RFRS groups
We prove that a finitely generated virtually RFRS group of cohomological dimension at most $2$ is coherent if and only if its second $L^{2}$-Betti number vanishes if and only if it is virtually free-by-cyclic. The non-vanishing of the second $L^{2}$-Betti number provides the first known global obstruction to coherence in any reasonably wide class of groups, allowing for proofs of incoherence without needing to exhibit explicit witnesses to incoherence. As applications of this result, we completely characterise coherence among two-dimensional Coxeter groups, confirming conjectures of Jankiewicz and Wise, and show that incoherence is generic in groups of nonpositive deficiency, confirming a conjecture of Wise. We also find that, among virtually compact special groups of virtual cohomological dimension two, coherence is algorithmically decidable and is a quasi-isometry, measure equivalence, and profinite invariant. In an appendix, Marco Linton applies one of the main results to prove that cubulated locally quasi-convex hyperbolic groups are virtually free-by-cyclic, solving problems of Abdenbi–Wise and Wise in the cubulated case.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
An asymmetry lower bound on fermionic non-Gaussianity
Fermionic Gaussian states are a fundamental tool in many-body physics, faithfully representing non-interacting quantum systems and allowing for efficient numerical simulations. Given a many-body wave function, it is therefore interesting to ask how much it differs from that of a Gaussian state, as quantified by the notion of non-Gaussianity. In this work, we relate measures of non-Gaussianity with the Shannon entropy of the particle-number distribution, coinciding with the particle-number asymmetry for pure states. We derive a lower bound on the relative entropy of non-Gaussianity in terms of the exponential of the Shannon entropy, and study numerically its tightness for large system sizes. Our bound is non-trivial for large values of the asymmetry and relies on the concentration of the particle-number distribution of (mixed) fermionic Gaussian states. Since the Shannon entropy of the particle-number distribution is often efficient to compute or experimentally measure, our results can be viewed as a practical way to lower bound non-Gaussianity, highlighting a non-trivial interplay with particle-number asymmetry.
Read the full abstract
Logic
Ultrafilter Extensions for Veltman Semantics
In this paper, we present a first-order frame condition for interpretability logic and show that the condition is not modally definable. Yet, the frame condition holds both on ILM and on ILP frames and, hence, is of potential importance for the long-standing open problem about the interpretability logic of all reasonable arithmetical theories. In the light of the Goldblatt-Thomason Theorem, the modally inexpressible frame condition serves as motivation to develop ultrafilter extensions for interpretability logic. We develop the necessary algebraic tools to define these ultrafilter extensions and prove the main properties about both the tools and the ultrafilter extensions.
Read the full abstract
Optimization and Control
Constructing Deployment Scenarios for Reserve Deliverability via Adaptive Robust Optimization
Network congestion often hinders the deployment of reserves needed to balance forecast errors during real-time operations. A pertinent idea to tackle this challenge involves adding deployment scenarios of spatial distributions of forecast errors as contingencies to the day-ahead problem. However, current approaches disregard the effect of grid topology and the day-ahead schedule on the induced congestion and, consequently, reserve deliverability. In this work, we formulate a two-stage adaptive robust optimization problem to jointly consider interactions between day-ahead and real-time operations and forecast errors. Using a column-and-constraint algorithm, we iteratively construct deployment scenarios by finding the worst-case forecast error for reserve deliverability. Simulations on the RTS-GMLC system show that adding these scenarios to the day-ahead problem significantly reduces the frequency of congestion-driven reserve undeliverability. Notably, the choice and number of scenarios dynamically adapt to the day-ahead schedule.
Read the full abstract
Dynamical Systems
Data-driven forced response analysis with min-max representations of nonlinear restoring forces
This paper discusses a novel data-driven nonlinearity identification method for mechanical systems with nonlinear restoring forces such as polynomial, piecewise-linear, and general displacement-dependent nonlinearities. The proposed method is built upon the universal approximation theorem that states that a nonlinear function can be approximated by a linear combination of activation functions in artificial neural network framework. The proposed approach utilizes piecewise linear springs with initial gaps to act as the activation functions of the neurons of artificial neural networks. A library of piecewise linear springs with initial gaps are constructed, and the contributions of the springs on the nonlinear restoring force are determined by solving the linear regression problems. The piecewise linear springs are realized by combinations of min and max functions with biases. The proposed method is applied to a Duffing oscillator with cubic stiffness, and a piecewise linear oscillator with a gap and their nonlinearities are successfully determined from their free responses. The obtained models are then used for conducting forced response analysis and the results match well with those of the original system. The method is then applied to experimentally-obtained free response data of a cantilevered plate that is subjected to magnetic restoring force, and successfully finds the piecewise linear representation of the magnetic force. It is also shown that the obtained model is capable of accurately capturing the steady-state response of the system subject to harmonic base excitation.
Read the full abstract
Analysis of PDEs
Exact number of positive solutions and existence of sign-changing solutions with prescribed mass for NLS on bounded domains
Given $\mu > 0$, we study the elliptic problem: \begin{align*} \text{ find } (u,\lambda) \in H_0^1(\Omega) \times \mathbb{R} \text{ such that } -\Delta u + \lambda u = |u|^{p-2}u \text{ in } \Omega \text{ and } \int_\Omega|u|^2dx = \mu, \end{align*} where $\Omega \subset \mathbb{R}^N$ is a bounded domain and $p > 2$ is Sobolev-subcritical. When $p$ is $L^2$-subcritical, i.e. $2 < p < 2 + 4/N$, we show that the problem admits infinitely many sign-changing solutions whose energies are unbounded for every fixed $\mu > 0$. Moreover, we give the limit behavior for both the parameter $\lambda$ and the energy of the solutions as $\mu \to 0^+$ and $\mu \to +\infty$ respectively. Such a multiplicity result also holds when $p$ is $L^2$-critical, i.e. $p = 2 + 4/N$, for each small $\mu > 0$, and we describe precisely what happen when $\mu \to 0^+$. In the $L^2$-supercritical case, i.e. $2+4/N < p < 2^*$, we find as many sign-changing solutions as we want at the expense of possibly reducing the mass $\mu$. As $\mu$ tends to $0$, the energy of these solutions goes to $0$ and the limit of the parameter $\lambda$ is a Dirichlet eigenvalue of $-\Delta$ on $\Omega$ multiplying $-1$. When $\Omega = B_1$, the unitary ball, and the nonlinear term is $\tau |u|^{p-2}u$ with $\tau \in [1/2,1]$ fixed, in the $L^2$-supercritical regime, we prove that the problem admits exactly two positive solutions for small $\mu > 0$ and how small $\mu > 0$ must be does not depend on the value of $\tau$. Moreover, sending $\mu$ to $0$ we get that the energy of one positive solution tends to $0$ and the parameter tends to $-\lambda_1(B_1)$, where $\lambda_1(B_1)$ is the first Dirichlet eigenvalue of $-\Delta $ on the unit ball $B_1$, while both the energy of the other positive solution and the parameter $\lambda$ go to infinity uniformly with respect to $\tau$.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
GeMA: Learning Latent Manifold Frontiers for Benchmarking Complex Systems
Benchmarking the performance of complex systems such as rail networks, renewable generation assets and national economies is central to transport planning, regulation and macroeconomic analysis. Classical frontier methods, notably Data Envelopment Analysis (DEA) and Stochastic Frontier Analysis (SFA), estimate an efficient frontier in the observed input-output space and define efficiency as distance to this frontier, but rely on restrictive assumptions on the production set and only indirectly address heterogeneity and scale effects. We propose Geometric Manifold Analysis (GeMA), a latent manifold frontier framework implemented via a productivity-manifold variational autoencoder (ProMan-VAE). Instead of specifying a frontier function in the observed space, GeMA represents the production set as the boundary of a low-dimensional manifold embedded in the joint input-output space. A split-head encoder learns latent variables that capture technological structure and operational inefficiency. Efficiency is evaluated with respect to the learned manifold, endogenous peer groups arise as clusters in latent technology space, a quotient construction supports scale-invariant benchmarking, and a local certification radius, derived from the decoder Jacobian and a Lipschitz bound, quantifies the geometric robustness of efficiency scores. We validate GeMA on synthetic data with non-convex frontiers, heterogeneous technologies and scale bias, and on four real-world case studies: global urban rail systems (COMET), British rail operators (ORR), national economies (Penn World Table) and a high-frequency wind-farm dataset. Across these domains GeMA behaves comparably to established methods when classical assumptions hold, and provides additional insight in settings with pronounced heterogeneity, non-convexity or size-related bias.
Read the full abstract
Analysis of PDEs
Maximal regularity for time-fractional Schrödinger equations and application to nonlinear equations
We study the maximal regularity problem for abstract time-fractional Schrödinger equations $\partial_t^\alpha(u-u_0) -\mathrm{i} A u=f$, with a fractional derivative $\partial_t^\alpha$ of order $\alpha \in (0,1)$. We assume that $A$ is a self-adjoint operator with compact resolvent on a Hilbert space $H$. First, we prove the maximal $L^2$-regularity by leveraging properties of Mittag-Leffler functions with an imaginary argument. Compared to existing results for the subdiffusion equations, our proof avoids using the complete monotonicity of Mittag-Leffler functions, which seems difficult to prove within the setting of an imaginary argument. Then, we prove the maximal $L^p$-regularity for $p\in (1,\infty)$ using the operator-valued version of Mikhlin's multiplier theorem. Finally, we apply the maximal regularity results to prove the local well-posedness of quasilinear and semilinear time-fractional Schrödinger equations.
Read the full abstract
Functional Analysis · Cross-listed from quant-ph
Completely Bounded Qusi-Norms, Their Mutiplicativity, and New Additivity Results of Quantum Channels
We obtain two new additivity results of quantum channels. The first one is the additivity of the channel Rényi information associated with the sandwiched Rényi divergence of order $\alpha\in[\frac{1}{2},1)$. To prove this, we introduce the completely bounded $1\to\alpha$ quasi-norms for completely positive maps, with $\alpha\in[\frac{1}{2},1)$, and show that it is multiplicative. The additivity/multiplicativity derived here extends and complements the results of Devetak et al (Commun Math Phys 266:37-63, 2006) and Gupta and Wilde (Commun Math Phys 334:867-887, 2015), which deal with the case $\alpha>1$. The second one is the additivity of the channel dispersion, which is a quantity related to the second-order behavior of quantum information tasks.