Quantum data compression, quantum information generation, and the density-matrix renormalization group method

We have studied quantum data compression for finite quantum systems where the site density matrices are not independent, i.e., the density matrix cannot be given as direct product of site density matrices and the von Neumann entropy is not equal to the sum of site entropies. Using the density-matrix renormalization group (DMRG) method for the 1-d Hubbard model, we have shown that a simple relationship exists between the entropy of the left or right block and dimension of the Hilbert space of that block as well as of the superblock for any fixed accuracy. The information loss during the RG procedure has been investigated and a more rigorous control of the relative error has been proposed based on Kholevo's theory. Our results are also supported by the quantum chemistry version of DMRG applied to various molecules with system lengths up to 60 lattice sites. A sum rule which relates site entropies and the total information generated by the renormalization procedure has also been given which serves as an alternative test of convergence of the DMRG method.Comment: 8 pages, 7 figure

Improving zero-error classical communication with entanglement

Given one or more uses of a classical channel, only a certain number of messages can be transmitted with zero probability of error. The study of this number and its asymptotic behaviour constitutes the field of classical zero-error information theory, the quantum generalisation of which has started to develop recently. We show that, given a single use of certain classical channels, entangled states of a system shared by the sender and receiver can be used to increase the number of (classical) messages which can be sent with no chance of error. In particular, we show how to construct such a channel based on any proof of the Bell-Kochen-Specker theorem. This is a new example of the use of quantum effects to improve the performance of a classical task. We investigate the connection between this phenomenon and that of ``pseudo-telepathy'' games. The use of generalised non-signalling correlations to assist in this task is also considered. In this case, a particularly elegant theory results and, remarkably, it is sometimes possible to transmit information with zero-error using a channel with no unassisted zero-error capacity.Comment: 6 pages, 2 figures. Version 2 is the same as the journal version plus figure 1 and the non-signalling box exampl

Abstract composition rule for relativistic kinetic energy in the thermodynamical limit

We demonstrate by simple mathematical considerations that a power-law tailed distribution in the kinetic energy of relativistic particles can be a limiting distribution seen in relativistic heavy ion experiments. We prove that the infinite repetition of an arbitrary composition rule on an infinitesimal amount leads to a rule with a formal logarithm. As a consequence the stationary distribution of energy in the thermodynamical limit follows the composed function of the Boltzmann-Gibbs exponential with this formal logarithm. In particular, interactions described as solely functions of the relative four-momentum squared lead to kinetic energy distributions of the Tsallis-Pareto (cut power-law) form in the high energy limit.Comment: Submitted to Europhysics Letters. LaTeX, 3 eps figure

Classical Correlations and Entanglement in Quantum Measurements

We analyze a quantum measurement where the apparatus is initially in a mixed state. We show that the amount of information gained in a measurement is not equal to the amount of entanglement between the system and the apparatus, but is instead equal to the degree of classical correlations between the two. As a consequence, we derive an uncertainty-like expression relating the information gain in the measurement and the initial mixedness of the apparatus. Final entanglement between the environment and the apparatus is also shown to be relevant for the efficiency of the measurement.Comment: to appear in Physical Review Letter

An improved perturbation approach to the 2D Edwards polymer -- corrections to scaling

We present the results of a new perturbation calculation in polymer statistics which starts from a ground state that already correctly predicts the long chain length behaviour of the mean square end--to--end distance $\langle R_N^2 \rangle\$, namely the solution to the 2~dimensional~(2D) Edwards model. The $\langle R_N^2 \rangle$ thus calculated is shown to be convergent in $N$, the number of steps in the chain, in contrast to previous methods which start from the free random walk solution. This allows us to calculate a new value for the leading correction--to--scaling exponent~$\Delta$. Writing $\langle R_N^2 \rangle = AN^{2\nu}(1+BN^{-\Delta} + CN^{-1}+...)$, where $\nu = 3/4$ in 2D, our result shows that $\Delta = 1/2$. This value is also supported by an analysis of 2D self--avoiding walks on the {\em continuum}.Comment: 17 Pages of Revtex. No figures. Submitted to J. Phys.

Information-theoretic temporal Bell inequality and quantum computation

An information-theoretic temporal Bell inequality is formulated to contrast classical and quantum computations. Any classical algorithm satisfies the inequality, while quantum ones can violate it. Therefore, the violation of the inequality is an immediate consequence of the quantumness in the computation. Furthermore, this approach suggests a notion of temporal nonlocality in quantum computation.Comment: v2: 5 pages, refereces added, discussion slightly revised, main result unchanged. v3: typos correcte

Co - Ed : March - Two Step

https://digitalcommons.library.umaine.edu/mmb-ps/2445/thumbnail.jp

Swanee Rose

https://digitalcommons.library.umaine.edu/mmb-vp/2544/thumbnail.jp

A strong converse for classical channel coding using entangled inputs

A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of channel uses, even when we allow code states which are entangled across several uses of the channel. Such a statement was previously only known for classical channels and the quantum identity channel. By relating the problem to the additivity of minimum output entropies, we show that a strong converse holds for a large class of channels, including all unital qubit channels, the d-dimensional depolarizing channel and the Werner-Holevo channel. This further justifies the interpretation of the classical capacity as a sharp threshold for information-transmission.Comment: 9 pages, revte