Search

A southwest region of the Carina nebula was observed with the Suzaku observatory for 47 ks in 2010 December. This region shows distinctively soft X-ray emission in the Chandra campaign observations. Suzaku clearly detects the diffuse emission above known foreground and background components between 0.4-5 keV at the surface brightness of 3.3x10^-14 erg s^{-1} arcmin^{-2}. The spectrum requires two plasma emission components with kT~0.2 and 0.5 keV, which suffer interstellar absorption of N_H~1.9x10^{21} cm^{-2}. Multiple absorption models assuming two temperature plasmas at ionization equilibrium or non-equilibrium are tested but there is no significant difference in terms of chi^2/d.o.f.. These plasma temperatures are similar to those of the central and eastern parts of the Carina nebula measured in earlier Suzaku observations, but the surface brightness of the hot component is significantly lower than those of the other regions. This means that these two plasma components are physically separated and have different origins. The elemental abundances of O, Ne and Mg with respect to Fe favor that the diffuse plasma originates from core-collapsed supernovae or massive stellar winds., Comment: 26 pages, 11 figures, accepted for publication in PASJ

There are different inequivalent ways to define the R\'enyi capacity of a channel for a fixed input distribution $P$. In a 1995 paper Csisz\'ar has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of R\'enyi capacity, defined in terms of the sandwiched quantum R\'enyi divergences, has the same operational interpretation in the strong converse problem of classical-quantum channel coding. Denoting the constant composition strong converse exponent for a memoryless classical-quantum channel $W$ with composition $P$ and rate $R$ as $sc(W,R,P)$, our main result is that \[ sc(W,R,P)=\sup_{\alpha>1}\frac{\alpha-1}{\alpha}\left[R-\chi_{\alpha}^*(W,P)\right], \] where $\chi_{\alpha}^*(W,P)$ is the $P$-weighted sandwiched R\'enyi divergence radius of the image of the channel., Comment: 46 pages. V7: Added the strong converse exponent with cost constraint

We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily in tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglement concentration and dilution of general sequences of pure states.

To reconstruct thermodynamics based on the microscopic laws is one of the most important unfulfilled goals of statistical physics. Here, we show that the first law and the second law for adiabatic processes are derived from an assumption that "probability distributions of energy in Gibbs states satisfy large deviation", which is widely accepted as a property of thermodynamic equilibrium states. We define an adiabatic transformation as a randomized energy-preserving unitary transformations on the many-body systems and the work storage. As the second law, we show that an adiabatic transformation from a set of Gibbs states to another set of Gibbs states is possible if and only if the regularized von Neumann entropy becomes large. As the first law, we show that the energy loss of the thermodynamic systems during the adiabatic transformation is stored in the work storage as "work," in the following meaning; (i) the energy of the work storage takes certain values macroscopically, in the initial state and the final state. (ii) the entropy of the work storage in the final state is macroscopically equal to the entropy of the initial state. As corollaries, our results give the principle of maximam work and the first law for the isothermal processes., Comment: 18pages, 1 figure: in the present version, we make the formulation simpler than that of the previous version

We determine the exact strong converse exponent of classical-quantum channel coding, for every rate above the Holevo capacity. Our form of the exponent is an exact analogue of Arimoto's, given as a transform of the Renyi capacities with parameters alpha>1. It is important to note that, unlike in the classical case, there are many inequivalent ways to define the Renyi divergence of states, and hence the R\'enyi capacities of channels. Our exponent is in terms of the Renyi capacities corresponding to a version of the Renyi divergences that has been introduced recently in [M\"uller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013)], and [Wilde, Winter, Yang, Commun. Math. Phys. 331, (2014)]. Our result adds to the growing body of evidence that this new version is the natural definition for the purposes of strong converse problems., Comment: v6: New section on entanglement breaking, and covariant channels. v7: Added Appendix B on the concavity of various versions of the auxiliary function. v8: Updated references

We present two general approaches to obtain the strong converse rate of quantum hypothesis testing for correlated quantum states. One approach requires that the states satisfy a certain factorization property; typical examples of such states are the temperature states of translation-invariant finite-range interactions on a spin chain. The other approach requires the differentiability of a regularized R\'enyi $\alpha$-divergence in the parameter $\alpha$; typical examples of such states include temperature states of non-interacting fermionic lattice systems, and classical irreducible Markov chains. In all cases, we get that the strong converse exponent is equal to the Hoeffding anti-divergence, which in turn is obtained from the regularized R\'enyi divergences of the two states., Comment: v3:21 pages, essentialy the published version

We show that the new quantum extension of Renyi's \alpha-relative entropies, introduced recently by Muller-Lennert, Dupuis, Szehr, Fehr and Tomamichel, J. Math. Phys. 54, 122203, (2013), and Wilde, Winter, Yang, Commun. Math. Phys. 331, (2014), have an operational interpretation in the strong converse problem of quantum hypothesis testing. Together with related results for the direct part of quantum hypothesis testing, known as the quantum Hoeffding bound, our result suggests that the operationally relevant definition of the quantum Renyi relative entropies depends on the parameter \alpha: for \alpha<1, the right choice seems to be the traditional definition, whereas for \alpha>1 the right choice is the newly introduced version. As a sideresult, we show that the new Renyi \alpha-relative entropies are asymptotically attainable by measurements for \alpha>1, and give a new simple proof for their monotonicity under completely positive trace-preserving maps., Comment: v5: Added Appendix A on monotonicity and attainability properties

We study various error exponents in a binary hypothesis testing problem and extend recent results on the quantum Chernoff and Hoeffding bounds for product states to a setting when both the null-hypothesis and the counter-hypothesis can be correlated states on a spin chain. Our results apply to states satisfying a certain factorization property; typical examples are the global Gibbs states of translation-invariant finite-range interactions as well as certain finitely correlated states., Comment: 26 pages; discussions extended, 2 figures added

In this paper we extend the results of Lenci and Rey-Bellet on the large deviation upper bound of the distribution measures of local Hamiltonians with respect to a Gibbs state, in the setting of translation-invariant finite-range interactions. We show that a certain factorization property of the reference state is sufficient for a large deviation upper bound to hold and that this factorization property is satisfied by Gibbs states of the above kind as well as finitely correlated states. As an application of the methods the Chernoff bound for correlated states with factorization property is studied. In the specific case of the distributions of the ergodic averages of a one-site observable with respect to an ergodic finitely correlated state the spectral theory of positive maps is applied to prove the full large deviation principle., Comment: some typos corrected, short proof of Lemma A.2 added

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity $C_S$, which is usually smaller than the channel capacity $C$. In order to remove the loss $C - C_S$, we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multiplex coding scheme can attain the channel capacity as the total rate of the plural messages and the perfect secrecy for each message. The coding theorem is proved by extending Hayashi's proof, in which the coding of the channel resolvability is applied to wiretap channels., Comment: 15 pages, submitted to the IEEE Transactions on Information Theory

A simple and unifying method to show the perfect error-correcting condition is provided based on the quantum mutual information. The one-to-one parameterization of quantum operations and the properties of the quantum relative entropy are used effectively in this paper, where the equivalence between the subspace transmission and the entanglement transmission is clearly presented. We also revisit a variant of the no-cloning and no-deleting theorem based on an information-theoretical tradeoff between two parties for the reversibility of quantum operations, and demonstrate that the no-cloning and no-deleting theorem leads to the perfect error-correcting condition on Kraus operators., Comment: 8 pages

Quantum secret sharing schemes encrypting a quantum state into a multipartite entangled state are treated. The lower bound on the dimension of each share given by Gottesman [Phys. Rev. A \textbf{61}, 042311 (2000)] is revisited based on a relation between the reversibility of quantum operations and the Holevo information. We also propose a threshold ramp quantum secret sharing scheme and evaluate its coding efficiency., Comment: 8 pages

A new proof of the direct part of the quantum channel coding theorem is shown based on a standpoint of quantum hypothesis testing. A packing procedure of mutually noncommutative operators is carried out to derive an upper bound on the error probability, which is similar to Feinstein's lemma in classical channel coding. The upper bound is used to show the proof of the direct part along with a variant of Hiai-Petz's theorem in quantum hypothesis testing., Comment: 11 pages

In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and its pinching. Concerning the error exponents, the upper bounds lead to a noncommutative analogue of the Hoeffding bound, which is identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. The upper bounds also provide a simple proof of the direct part of the quantum Stein's lemma., Comment: 13 pages, 2 figures, submitted to IEEE trans. Inform. Theory

The direct part of Stein's lemma in quantum hypothesis testing is revisited based on a key operator inequality between a density operator and its pinching. The operator inequality is used to show a simple proof of the direct part of Stein's lemma without using Hiai-Petz's theorem, along with an operator monotone function, and in addition it is also used to show a new proof of Hiai-Petz's theorem., Comment: 6 pages, submitted to ISIT2002

The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein's lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entropy, and the bound yields the strong converse in the quantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi in the classical hypothesis testing., Comment: LaTeX, 12 pages, submitted to IEEE Trans. Inform. Theory

A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept for the difficulty due to non-commutativity., Comment: LaTeX, 11 pages, submitted to IEEE Trans. Inform. Theory