【摘 要】
：
The stability theorem of the depolarizing channel in terms of the maximal output purity provides us with various applications in quantum information science
论文部分内容阅读
The stability theorem of the depolarizing channel in terms of the maximal output purity provides us with various applications in quantum information science,which bridge seemingly disconnected research areas,quantum information theory and quantum complexity theory.In particular,as an application of the stability theorem,the complexity class QMA(k)is equal to QMA(2)for k(?)2.In this work,we show that the stability theorem holds for the same channel for the minimal output Renyi entropies.
其他文献
An kinetic scheme is developed to solve the Baer-Nunziato model of compressible two-phase flows.Based on the kinetic theory,the conservative flux function o
We first review some typical mathematical models for compressible multiphase flows and point out some mathematical and numerical difficulties,such as hyperb
In this talk,we will be interested in the problem of statistical analysis and classification on populations of functional shapes,i.e geometrical shapes that
We have developed a front-tracking method for compressible fluids(described by the Euler system),which is within the ALE framework,runs on general quadrangu
We tackle the reconstruction problem of density images from indirect measurements with a novel variational approach: By implementing an appropriate modellin
We investigate conditions for unique signal recovery based on sparse and cosparse signal models from few tomographic projections.Although certain industrial
I first discuss how to impose positivity constraint in the variational total variation model for restoration of images with noise and blur,highlighting our
We consider Abel transform based density reconstruction for axially symmetric objects from a single radiograph by fan-beam x-rays.All contemporary methods a
Consider the sum rate maximization problem for MIMO relay networks in wireless communications.A new approach is proposed as the lower bound of achievable su
We investigate a parallel subspace correction framework for composite convex optimization.The variables are divided into blocks.At each iteration,the algori