English
Related papers

Related papers: Second-Order Converses via Reverse Hypercontractiv…

200 papers

In this paper, we introduce and study the conformal mean curvature flow of submanifolds of higher codimension in the Euclidean space $\bbr^n$. This kind of flow is a special case of a general modified mean curvature flow which is of various…

Differential Geometry · Mathematics 2018-02-13 Xingxiao Li , Di Zhang

A distributed binary hypothesis testing (HT) problem over a noisy (discrete and memoryless) channel studied previously by the authors is investigated from the perspective of the strong converse property. It was shown by Ahlswede and…

Information Theory · Computer Science 2020-06-09 Sreejith Sreekumar , Deniz Gündüz

It has been shown recently that predictions from Mode-Coupling Theory for the glass transition of hard-spheres become increasingly bad when dimensionality increases, whereas replica theory predicts a correct scaling. Nevertheless if one…

Statistical Mechanics · Physics 2013-02-27 Hugo Jacquin , Francesco Zamponi

In this study, we investigate the Shallow Water Equations incorporating source terms accounting for Manning friction and a non-flat bottom topology. Our primary focus is on developing and validating numerical schemes that serve a dual…

Numerical Analysis · Mathematics 2023-10-24 Guanlan Huang , Sebastiano Boscarino , Tao Xiong

A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of…

Quantum Physics · Physics 2014-07-31 Mark M. Wilde , Andreas Winter , Dong Yang

We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of…

Quantum Physics · Physics 2019-05-06 Xin Wang , Kun Fang , Runyao Duan

The problem of inferring pair-wise and higher-order interactions in complex systems involving large numbers of interacting variables, from observational data, is fundamental to many fields. Known to the statistical physics community as the…

Methodology · Statistics 2021-01-01 Sjoerd Viktor Beentjes , Ava Khamseh

A strong direct product theorem (SDPT) states that solving n instances of a problem requires Omega(n) times the resources for a single instance, even to achieve success probability exp(-Omega(n)). We prove that quantum communication…

Computational Complexity · Computer Science 2010-11-23 Alexander A. Sherstov

Training conversational question-answering (QA) systems requires a substantial amount of in-domain data, which is often scarce in practice. A common solution to this challenge is to generate synthetic data. Traditional methods typically…

Machine Learning · Computer Science 2025-04-22 Kun Qian , Maximillian Chen , Siyan Li , Arpit Sharma , Zhou Yu

The Lie-Trotter formula, together with its higher-order generalizations, provides a direct approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly…

Quantum Physics · Physics 2021-02-05 Andrew M. Childs , Yuan Su , Minh C. Tran , Nathan Wiebe , Shuchen Zhu

A general conversion strategy by involving a shifted parameter $\theta$ is proposed to construct high-order accuracy difference formulas for fractional calculus operators. By converting the second-order backward difference formula with such…

Numerical Analysis · Mathematics 2022-04-13 Baoli Yin , Guoyu Zhang , Yang Liu , Hong Li

For the prescribed scalar curvature equation on $S^n$ ($n \ge 6$), we consider the situation where the number of bubbles tends to infinity in the Lyapunov-Schmidt (finite dimension) reduction method. In an outstanding paper by Wei and Yan,…

Analysis of PDEs · Mathematics 2021-07-19 Man Chun Leung

In modern communication systems such as the Internet, random losses of information can be mitigated by oversampling the source. This is equivalent to expanding the source using overcomplete systems of vectors (frames), as opposed to the…

Functional Analysis · Mathematics 2025-10-20 Roman Vershynin

We present a controlled rare-weak-link theory of the superfluid-to-Bose/Mott glass transition in one-dimensional disordered systems. The transition has Kosterlitz-Thouless critical properties but may occur at an arbitrary large value of the…

Statistical Mechanics · Physics 2015-06-17 Lode Pollet , Nikolay V. Prokof'ev , Boris V. Svistunov

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…

Quantum Physics · Physics 2025-07-18 Marius Junge , Nicholas Laracuente

Set-disjointness problems are one of the most fundamental problems in communication complexity and have been extensively studied in past decades. Given its importance, many lower bound techniques were introduced to prove communication lower…

Computational Complexity · Computer Science 2023-09-26 Guangxu Yang , Jiapeng Zhang

We construct a monotone quantity for the classical obstacle problem with non-smooth obstacle, and show that the blow-ups are homogeneous functions of degree $\alpha<2$.

Analysis of PDEs · Mathematics 2019-10-17 Aram Karakhanyan

A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit…

Quantum Physics · Physics 2013-03-14 Naresh Sharma , Naqueeb Ahmad Warsi

A classical (or quantum) superintegrable system on an n-dimensional Riemannian manifold is an integrable Hamiltonian system with potential that admits 2n-1 functionally independent constants of the motion that are polynomial in the momenta,…

Exactly Solvable and Integrable Systems · Physics 2008-04-24 Willard Miller

Three decades of research in communication complexity have led to the invention of a number of techniques to lower bound randomized communication complexity. The majority of these techniques involve properties of large submatrices…

Computational Complexity · Computer Science 2012-05-07 Amit Chakrabarti , Ranganath Kondapally , Zhenghui Wang