A min-entropy uncertainty relation for finite size cryptography

Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are thereby relations in terms of the smooth min-entropy for BB84 and six-state encodings. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove a new uncertainty relation in terms of the smooth min-entropy that is only marginally less strong, but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Renyi entropies that may be of independent interest.Comment: 5+6 pages, 1 figure, revtex. new version changed author's name from Huei Ying Nelly Ng to Nelly Huei Ying Ng, for consistency with other publication

The Parity Bit in Quantum Cryptography

An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $\rho_0^{(n)}$ and $\rho_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string in the case where the single bit states are almost fully overlapping. We believe this result will be useful in proving the ultimate security of quantum crytography in the presence of noise.Comment: 19 pages, RevTe

The quantum dynamic capacity formula of a quantum channel

The dynamic capacity theorem characterizes the reliable communication rates of a quantum channel when combined with the noiseless resources of classical communication, quantum communication, and entanglement. In prior work, we proved the converse part of this theorem by making contact with many previous results in the quantum Shannon theory literature. In this work, we prove the theorem with an "ab initio" approach, using only the most basic tools in the quantum information theorist's toolkit: the Alicki-Fannes' inequality, the chain rule for quantum mutual information, elementary properties of quantum entropy, and the quantum data processing inequality. The result is a simplified proof of the theorem that should be more accessible to those unfamiliar with the quantum Shannon theory literature. We also demonstrate that the "quantum dynamic capacity formula" characterizes the Pareto optimal trade-off surface for the full dynamic capacity region. Additivity of this formula simplifies the computation of the trade-off surface, and we prove that its additivity holds for the quantum Hadamard channels and the quantum erasure channel. We then determine exact expressions for and plot the dynamic capacity region of the quantum dephasing channel, an example from the Hadamard class, and the quantum erasure channel.Comment: 24 pages, 3 figures; v2 has improved structure and minor corrections; v3 has correction regarding the optimizatio

Factoring in a Dissipative Quantum Computer

We describe an array of quantum gates implementing Shor's algorithm for prime factorization in a quantum computer. The array includes a circuit for modular exponentiation with several subcomponents (such as controlled multipliers, adders, etc) which are described in terms of elementary Toffoli gates. We present a simple analysis of the impact of losses and decoherence on the performance of this quantum factoring circuit. For that purpose, we simulate a quantum computer which is running the program to factor N = 15 while interacting with a dissipative environment. As a consequence of this interaction randomly selected qubits may spontaneously decay. Using the results of our numerical simulations we analyze the efficiency of some simple error correction techniques.Comment: plain tex, 18 pages, 8 postscript figure

A de Finetti representation theorem for infinite dimensional quantum systems and applications to quantum cryptography

According to the quantum de Finetti theorem, if the state of an N-partite system is invariant under permutations of the subsystems then it can be approximated by a state where almost all subsystems are identical copies of each other, provided N is sufficiently large compared to the dimension of the subsystems. The de Finetti theorem has various applications in physics and information theory, where it is for instance used to prove the security of quantum cryptographic schemes. Here, we extend de Finetti's theorem, showing that the approximation also holds for infinite dimensional systems, as long as the state satisfies certain experimentally verifiable conditions. This is relevant for applications such as quantum key distribution (QKD), where it is often hard - or even impossible - to bound the dimension of the information carriers (which may be corrupted by an adversary). In particular, our result can be applied to prove the security of QKD based on weak coherent states or Gaussian states against general attacks.Comment: 11 pages, LaTe

Purification of Mixed State with Closed Timelike Curve is not Possible

In ordinary quantum theory any mixed state can be purified in an enlarged Hilbert space by bringing an ancillary system. The purified state does not depend on the state of any extraneous system with which the mixed state is going to interact and on the physical interaction. Here, we prove that it is not possible to purify a mixed state that traverses a closed time like curve (CTC) and allowed to interact in a consistent way with a causality-respecting (CR) quantum system in the same manner. Thus, in general for arbitrary interactions between CR and CTC systems there is no universal 'Church of the larger Hilbert space' for mixed states with CTC. This shows that in quantum theory with CTCs there can exist 'proper' and 'improper' mixtures.Comment: Latex2e, No Figs, 4 + pages, An error corrected, Results unchange

A discrete time relativistic Toda lattice

Four integrable symplectic maps approximating two Hamiltonian flows from the relativistic Toda hierarchy are introduced. They are demostrated to belong to the same hierarchy and to examplify the general scheme for symplectic maps on groups equiped with quadratic Poisson brackets. The initial value problem for the difference equations is solved in terms of a factorization problem in a group. Interpolating Hamiltonian flows are found for all the maps.Comment: 32 pages, LaTe

Schumacher's quantum data compression as a quantum computation

An explicit algorithm for performing Schumacher's noiseless compression of quantum bits is given. This algorithm is based on a combinatorial expression for a particular bijection among binary strings. The algorithm, which adheres to the rules of reversible programming, is expressed in a high-level pseudocode language. It is implemented using $O(n^3)$ two- and three-bit primitive reversible operations, where $n$ is the length of the qubit strings to be compressed. Also, the algorithm makes use of $O(n)$ auxiliary qubits; however, space-saving techniques based on those proposed by Bennett are developed which reduce this workspace to $O(\sqrt{n})$ while increasing the running time by less than a factor of two.Comment: 37 pages, no figure

Indeterminate-length quantum coding

The quantum analogues of classical variable-length codes are indeterminate-length quantum codes, in which codewords may exist in superpositions of different lengths. This paper explores some of their properties. The length observable for such codes is governed by a quantum version of the Kraft-McMillan inequality. Indeterminate-length quantum codes also provide an alternate approach to quantum data compression.Comment: 32 page

Separability and distillability in composite quantum systems -a primer-

Quantum mechanics is already 100 years old, but remains alive and full of challenging open problems. On one hand, the problems encountered at the frontiers of modern theoretical physics like Quantum Gravity, String Theories, etc. concern Quantum Theory, and are at the same time related to open problems of modern mathematics. But even within non-relativistic quantum mechanics itself there are fundamental unresolved problems that can be formulated in elementary terms. These problems are also related to challenging open questions of modern mathematics; linear algebra and functional analysis in particular. Two of these problems will be discussed in this article: a) the separability problem, i.e. the question when the state of a composite quantum system does not contain any quantum correlations or entanglement and b) the distillability problem, i.e. the question when the state of a composite quantum system can be transformed to an entangled pure state using local operations (local refers here to component subsystems of a given system). Although many results concerning the above mentioned problems have been obtained (in particular in the last few years in the framework of Quantum Information Theory), both problems remain until now essentially open. We will present a primer on the current state of knowledge concerning these problems, and discuss the relation of these problems to one of the most challenging questions of linear algebra: the classification and characterization of positive operator maps.Comment: 11 pages latex, 1 eps figure. Final version, to appear in J. Mod. Optics, minor typos corrected, references adde