scholarly journals Strong converse result for uniform approximation by Meyer-König and Zeller operator

2015 ◽  
Vol 428 (1) ◽  
pp. 32-42 ◽  
Author(s):  
Ivan Gadjev
Entropy ◽  
2019 ◽  
Vol 21 (12) ◽  
pp. 1171 ◽  
Author(s):  
Daming Cao ◽  
Lin Zhou ◽  
Vincent Y. F. Tan

By proving a strong converse theorem, we strengthen the weak converse result by Salehkalaibar, Wigger and Wang (2017) concerning hypothesis testing against independence over a two-hop network with communication constraints. Our proof follows by combining two recently-proposed techniques for proving strong converse theorems, namely the strong converse technique via reverse hypercontractivity by Liu, van Handel, and Verdú (2017) and the strong converse technique by Tyagi and Watanabe (2018), in which the authors used a change-of-measure technique and replaced hard Markov constraints with soft information costs. The techniques used in our paper can also be applied to prove strong converse theorems for other multiterminal hypothesis testing against independence problems.


2014 ◽  
Vol 51 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Dawei Hong ◽  
Shushuang Man ◽  
Jean-Camille Birget ◽  
Desmond S. Lun

We construct a wavelet-based almost-sure uniform approximation of fractional Brownian motion (FBM) (Bt(H))_t∈[0,1] of Hurst index H ∈ (0, 1). Our results show that, by Haar wavelets which merely have one vanishing moment, an almost-sure uniform expansion of FBM for H ∈ (0, 1) can be established. The convergence rate of our approximation is derived. We also describe a parallel algorithm that generates sample paths of an FBM efficiently.


2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Bartosz Regula ◽  
Ryuji Takagi

AbstractQuantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels, expressed in the form of no-go theorems and quantitative bounds for the manipulation of general quantum channel resources under the most general transformation protocols. Focusing on the class of distillation tasks — which can be understood either as the purification of noisy channels into unitary ones, or the extraction of state-based resources from channels — we develop fundamental restrictions on the error incurred in such transformations, and comprehensive lower bounds for the overhead of any distillation protocol. In the asymptotic setting, our results yield broadly applicable bounds for rates of distillation. We demonstrate our results through applications to fault-tolerant quantum computation, where we obtain state-of-the-art lower bounds for the overhead cost of magic state distillation, as well as to quantum communication, where we recover a number of strong converse bounds for quantum channel capacity.


1990 ◽  
Vol 152 (1) ◽  
pp. 240-251 ◽  
Author(s):  
S.E Weinstein ◽  
Yuesheng Xu

1980 ◽  
Vol 253 (2) ◽  
pp. 139-144 ◽  
Author(s):  
Akira Sakai

Sign in / Sign up

Export Citation Format

Share Document