## Biography

I am an Australian Research Council (ARC) Discovery Early Career Researcher Award (DECRA) fellow and Senior Lecturer with the Centre for Quantum Software and Information at the University of Technology Sydney. I received a Master of Science degree from the Department of Electrical Engineering and Information Technology at ETH Zurich, and a doctorate in Theoretical Physics also from ETH Zurich. Before joining the University of Sydney as a University of Sydney Postdoctoral Fellow, I have worked as a Research Fellow and Senior Research Fellow at the Centre for Quantum Technologies in Singapore.

## Professional

I am a senior member of the IEEE Information Theory Society.

### Links

#### Can supervise: YES

#### Research Interests

My research interests lie in the intersection of information theory, cryptography and quantum mechanics. My main focus is on the mathematical foundations of quantum information theory, for example the study of entropy and other information measures, as well as theoretical questions that arise in quantum communication and cryptography when the available resources are limited.

#### Publications

Tomamichel, M 2016, *Quantum Information Processing with Finite Resources - Mathematical Foundations*, Springer, Cham, Switzerland.View/Download from: UTS OPUS or Publisher's site

#### View description

One of the predominant challenges when engineering future quantum information processors is that large quantum systems are notoriously hard to maintain and control accurately. It is therefore of immediate practical relevance to investigate quantum information processing with limited physical resources, for example to ask: How well can we perform information processing tasks if we only have access to a small quantum device? Can we beat fundamental limits imposed on information processing with classical resources? This book will introduce the reader to the mathematical framework required to answer such questions. A strong emphasis is given to information measures that are essential for the study of devices of finite size, including R\'enyi entropies and smooth entropies. The presentation is self-contained and includes rigorous and concise proofs of the most important properties of these measures. The first chapters will introduce the formalism of quantum mechanics, with particular emphasis on norms and metrics for quantum states. This is necessary to explore quantum generalizations of R\'enyi divergence and conditional entropy, information measures that lie at the core of information theory. The smooth entropy framework is discussed next and provides a natural means to lift many arguments from information theory to the quantum setting. Finally selected applications of the theory to statistics and cryptography are discussed.

Berta, M, Scholz, VB & Tomamichel, M 2018, 'Rényi Divergences as Weighted Non-commutative Vector-Valued Lp-Spaces', *Annales Henri Poincaré*, vol. 19, no. 6, pp. 1843-1867.View/Download from: Publisher's site

#### View description

© 2018, Springer International Publishing AG, part of Springer Nature. We show that Araki and Masuda's weighted non-commutative vector-valued Lp-spaces (Araki and Masuda in Publ Res Inst Math Sci Kyoto Univ 18:339–411, 1982) correspond to an algebraic generalization of the sandwiched Rényi divergences with parameter =p2. Using complex interpolation theory, we prove various fundamental properties of these divergences in the setup of von Neumann algebras, including a data-processing inequality and monotonicity in . We thereby also give new proofs for the corresponding finite-dimensional properties. We discuss the limiting cases {12,1,} leading to minus the logarithm of Uhlmann's fidelity, Umegaki's relative entropy, and the max-relative entropy, respectively. As a contribution that might be of independent interest, we derive a Riesz–Thorin theorem for Araki–Masuda Lp-spaces and an Araki–Lieb–Thirring inequality for states on von Neumann algebras.

Chapman, RJ, Karim, A, Huang, Z, Flammia, ST, Tomamichel, M & Peruzzo, A 2018, 'Beating the classical limits of information transmission using a quantum decoder', *Physical Review A*, vol. 97, no. 1.View/Download from: Publisher's site

#### View description

© 2018 American Physical Society. Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance in data transmission by encoding a message in quantum states; however, most proposals to date have focused on the regime of a large number of uses of the noisy channel, which is unfeasible with current quantum technology. We experimentally demonstrate quantum enhanced communication over an amplitude damping noisy channel with only two uses of the channel per bit and a single entangling gate at the decoder. By simulating the channel using a photonic interferometric setup, we experimentally increase the reliability of transmitting a data bit by greater than 20% for a certain damping range over classically sending the message twice. We show how our methodology can be extended to larger systems by simulating the transmission of a single bit with up to eight uses of the channel and a two-bit message with three uses of the channel, predicting a quantum enhancement in all cases.

Pfister, C, Rol, MA, Mantri, A, Tomamichel, M & Wehner, S 2018, 'Capacity estimation and verification of quantum channels with arbitrarily correlated errors.', *Nature communications*, vol. 9, no. 1, pp. 27-27.View/Download from: Publisher's site

#### View description

The central figure of merit for quantum memories and quantum communication devices is their capacity to store and transmit quantum information. Here, we present a protocol that estimates a lower bound on a channel's quantum capacity, even when there are arbitrarily correlated errors. One application of these protocols is to test the performance of quantum repeaters for transmitting quantum information. Our protocol is easy to implement and comes in two versions. The first estimates the one-shot quantum capacity by preparing and measuring in two different bases, where all involved qubits are used as test qubits. The second verifies on-the-fly that a channel's one-shot quantum capacity exceeds a minimal tolerated value while storing or communicating data. We discuss the performance using simple examples, such as the dephasing channel for which our method is asymptotically optimal. Finally, we apply our method to a superconducting qubit in experiment.

Tomamichel, M & Hayashi, M 2018, 'Operational interpretation of Rényi information measures via composite hypothesis testing against product and markov distributions', *IEEE Transactions on Information Theory*, vol. 64, no. 2, pp. 1064-1082.View/Download from: Publisher's site

#### View description

© 1963-2012 IEEE. We revisit the problem of asymmetric binary hypothesis testing against a composite alternative hypothesis. We introduce a general framework to treat such problems when the alternative hypothesis adheres to certain axioms. In this case, we find the threshold rate, the optimal error and strong converse exponents (at large deviations from the threshold), and the second order asymptotics (at small deviations from the threshold). We apply our results to find the operational interpretations of various Rényi information measures. In case the alternative hypothesis is comprised of bipartite product distributions, we find that the optimal error and strong converse exponents are determined by the variations of Rényi mutual information. In case the alternative hypothesis consists of tripartite distributions satisfying the Markov property, we find that the optimal exponents are determined by the variations of Rényi conditional mutual information. In either case, the relevant notion of Rényi mutual information depends on the precise choice of the alternative hypothesis. As such, this paper also strengthens the view that different definitions of Rényi mutual information, conditional entropy, and conditional mutual information are adequate depending on the context in which the measures are used.

Berta, M, Fawzi, O & Tomamichel, M 2017, 'On variational expressions for quantum relative entropies', *Letters in Mathematical Physics*, vol. 107, no. 12, pp. 2239-2265.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017, Springer Science+Business Media B.V. Distance measures between quantum states like the trace distance and the fidelity can naturally be defined by optimizing a classical distance measure over all measurement statistics that can be obtained from the respective quantum states. In contrast, Petz showed that the measured relative entropy, defined as a maximization of the Kullback–Leibler divergence over projective measurement statistics, is strictly smaller than Umegaki's quantum relative entropy whenever the states do not commute. We extend this result in two ways. First, we show that Petz' conclusion remains true if we allow general positive operator-valued measures. Second, we extend the result to Rényi relative entropies and show that for non-commuting states the sandwiched Rényi relative entropy is strictly larger than the measured Rényi relative entropy for (12,) and strictly smaller for [0,12). The latter statement provides counterexamples for the data processing inequality of the sandwiched Rényi relative entropy for <12. Our main tool is a new variational expression for the measured Rényi relative entropy, which we further exploit to show that certain lower bounds on quantum conditional mutual information are superadditive.

Cheng, HC, Hsieh, MH & Tomamichel, M 2017, 'Exponential decay of matrix -entropies on Markov semigroups with applications to dynamical evolutions of quantum ensembles', *Journal of Mathematical Physics*, vol. 58, no. 9.View/Download from: UTS OPUS or Publisher's site

#### View description

In this work, we extend the theory of quantum Markov processes on a single quantum state to a broader theory that covers Markovian evolution of an ensemble of quantum states, which generalizes Lindblad's formulation of quantum dynamical semigroups. Our results establish the equivalence between an exponential decrease of the matrix -entropies and the -Sobolev inequalities, which allows us to characterize the dynamical evolution of a quantum ensemble to its equilibrium. In particular, we study the convergence rates of two special semigroups, namely, the depolarizing channel and the phase-damping channel. In the former, since there exists a unique equilibrium state, we show that the matrix -entropy of the resulting quantum ensemble decays exponentially as time goes on. Consequently, we obtain a stronger notion of monotonicity of the Holevo quantity-the Holevo quantity of the quantum ensemble decays exponentially in time and the convergence rate is determined by the modified log-Sobolev inequalities. However, in the latter, the matrix -entropy of the quantum ensemble that undergoes the phase-damping Markovian evolution generally will not decay exponentially. There is no classical analogy for these different equilibrium situations. Finally, we also study a statistical mixing of Markov semigroups on matrix-valued functions. We can explicitly calculate the convergence rate of a Markovian jump process defined on Boolean hypercubes and provide upper bounds to the mixing time. Published by AIP Publishing.

Chubb, CT, Tan, VYF & Tomamichel, M 2017, 'Moderate Deviation Analysis for Classical Communication over Quantum Channels', *Communications in Mathematical Physics*, vol. 355, no. 3, pp. 1283-1315.View/Download from: Publisher's site

#### View description

© 2017, Springer-Verlag GmbH Germany. We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff between decoding error, code rate and code length for such codes we introduce a quantum generalisation of the moderate deviation analysis proposed by Altŭg and Wagner as well as Polyanskiy and Verdú. We derive such a tradeoff for classical-quantum (as well as image-additive) channels in terms of the channel capacity and the channel dispersion, giving further evidence that the latter quantity characterises the necessary backoff from capacity when transmitting finite blocks of classical data. To derive these results we also study asymmetric binary quantum hypothesis testing in the moderate deviations regime. Due to the central importance of the latter task, we expect that our techniques will find further applications in the analysis of other quantum information processing tasks.

Coles, PJ, Berta, M, Tomamichel, M & Wehner, S 2017, 'Entropic uncertainty relations and their applications', *Reviews of Modern Physics*, vol. 89, no. 1, pp. 1-58.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017 American Physical Society. Heisenberg's uncertainty principle forms a fundamental element of quantum mechanics. Uncertainty relations in terms of entropies were initially proposed to deal with conceptual shortcomings in the original formulation of the uncertainty principle and, hence, play an important role in quantum foundations. More recently, entropic uncertainty relations have emerged as the central ingredient in the security analysis of almost all quantum cryptographic protocols, such as quantum key distribution and two-party quantum cryptography. This review surveys entropic uncertainty relations that capture Heisenberg's idea that the results of incompatible measurements are impossible to predict, covering both finite- and infinite-dimensional measurements. These ideas are then extended to incorporate quantum correlations between the observed object and its environment, allowing for a variety of recent, more general formulations of the uncertainty principle. Finally, various applications are discussed, ranging from entanglement witnessing to wave-particle duality to quantum cryptography.

Hiai, F, König, R & Tomamichel, M 2017, 'Generalized Log-Majorization and Multivariate Trace Inequalities', *Annales Henri Poincaré*, vol. 18, no. 7, pp. 2499-2521.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017, Springer International Publishing. We show that recent multivariate generalizations of the Araki–Lieb–Thirring inequality and the Golden–Thompson inequality (Sutter et al. in Commun Math Phys, 2016. doi:10.1007/s00220-016-2778-5) for Schatten norms hold more generally for all unitarily invariant norms and certain variations thereof. The main technical contribution is a generalization of the concept of log-majorization which allows us to treat majorization with regard to logarithmic integral averages of vectors of singular values.

Sutter, D, Berta, M & Tomamichel, M 2017, 'Multivariate Trace Inequalities', *Communications in Mathematical Physics*, vol. 352, no. 1, pp. 37-58.View/Download from: UTS OPUS or Publisher's site

Tomamichel, M & Leverrier, A 2017, 'A largely self-contained and complete security proof for quantum key distribution', *Quantum*, vol. 1, pp. 14-52.View/Download from: UTS OPUS or Publisher's site

#### View description

In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and prepare-and-measure protocols. The goal of this paper is twofold: 1) to review and clarify the stateof-the-art security analysis based on entropic uncertainty relations, and 2) to provide an accessible resource for researchers interested in a security analysis of quantum cryptographic protocols that takes into account finite resource effects. For this purpose we collect and clarify several arguments spread in the literature on the subject with the goal of making this treatment largely self-contained.

More precisely, we focus on a class of prepare-and-measure protocols based on the Bennett-Brassard (BB84) protocol as well as a class of entanglement-based protocols similar to the Bennett-Brassard-Mermin (BBM92) protocol. We carefully formalize the different steps in these protocols, including randomization, measurement, parameter estimation, error correction and privacy amplification, allowing us to be mathematically precise throughout the security analysis. We start from an operational definition of what it means for a quantum key distribution protocol to be secure and derive simple conditions that serve as sufficient condition for secrecy and correctness. We then derive and eventually discuss tradeoff relations between the block length of the classical computation, the noise tolerance, the secret key length and the security parameters for our protocols. Our results significantly improve upon previously reported tradeoffs.

Tomamichel, M, Martinez-Mateo, J, Pacher, C & Elkouss, D 2017, 'Fundamental finite key limits for one-way information reconciliation in quantum key distribution', *Quantum Information Processing*, vol. 16, no. 11.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017, Springer Science+Business Media, LLC. The security of quantum key distribution protocols is guaranteed by the laws of quantum mechanics. However, a precise analysis of the security properties requires tools from both classical cryptography and information theory. Here, we employ recent results in non-asymptotic classical information theory to show that one-way information reconciliation imposes fundamental limitations on the amount of secret key that can be extracted in the finite key regime. In particular, we find that an often used approximation for the information leakage during information reconciliation is not generally valid. We propose an improved approximation that takes into account finite key effects and numerically test it against codes for two probability distributions, that we call binary–binary and binary–Gaussian, that typically appear in quantum key distribution protocols.

Tomamichel, M, Wilde, MM & Winter, A 2017, 'Strong Converse Rates for Quantum Communication', *IEEE Transactions on Information Theory*, vol. 63, no. 1, pp. 715-727.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2016 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it is possible to transmit quantum information at a rate exceeding the channel capacity if we allow for a non-vanishing probability of decoding error. Here we establish that the Rains information of any quantum channel is a strong converse rate for quantum communication: For any sequence of codes with rate exceeding the Rains information of the channel, we show that the fidelity vanishes exponentially fast as the number of channel uses increases. This remains true even if we consider codes that perform classical post-processing on the transmitted quantum data. As an application of this result, for generalized dephasing channels we show that the Rains information is also achievable, and thereby establish the strong converse property for quantum communication over such channels. Thus we conclusively settle the strong converse question for a class of quantum channels that have a non-trivial quantum capacity.

Wilde, MM, Tomamichel, M & Berta, M 2017, 'Converse bounds for private communication over quantum channels', *IEEE Transactions on Information Theory*, vol. 63, no. 3, pp. 1792-1817.View/Download from: UTS OPUS or Publisher's site

#### View description

© 1963-2012 IEEE. This paper establishes several converse bounds on the private transmission capabilities of a quantum channel. The main conceptual development builds firmly on the notion of a private state, which is a powerful, uniquely quantum method for simplifying the tripartite picture of privacy involving local operations and public classical communication to a bipartite picture of quantum privacy involving local operations and classical communication. This approach has previously led to some of the strongest upper bounds on secret key rates, including the squashed entanglement and the relative entropy of entanglement. Here, we use this approach along with a 'privacy test' to establish a general meta-converse bound for private communication, which has a number of applications. The meta-converse allows for proving that any quantum channel's relative entropy of entanglement is a strong converse rate for private communication. For covariant channels, the meta-converse also leads to second-order expansions of relative entropy of entanglement bounds for private communication rates. For such channels, the bounds also apply to the private communication setting in which the sender and the receiver are assisted by unlimited public classical communication, and as such, they are relevant for establishing various converse bounds for quantum key distribution protocols conducted over these channels. We find precise characterizations for several channels of interest and apply the methods to establish converse bounds on the private transmission capabilities of all phase-insensitive bosonic channels.

Wilde, MM, Tomamichel, M, Lloyd, S & Berta, M 2017, 'Gaussian Hypothesis Testing and Quantum Illumination', *Physical Review Letters*, vol. 119, no. 12.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017 American Physical Society. Quantum hypothesis testing is one of the most basic tasks in quantum information theory and has fundamental links with quantum communication and estimation theory. In this paper, we establish a formula that characterizes the decay rate of the minimal type-II error probability in a quantum hypothesis test of two Gaussian states given a fixed constraint on the type-I error probability. This formula is a direct function of the mean vectors and covariance matrices of the quantum Gaussian states in question. We give an application to quantum illumination, which is the task of determining whether there is a low-reflectivity object embedded in a target region with a bright thermal-noise bath. For the asymmetric-error setting, we find that a quantum illumination transmitter can achieve an error probability exponent stronger than a coherent-state transmitter of the same mean photon number, and furthermore, that it requires far fewer trials to do so. This occurs when the background thermal noise is either low or bright, which means that a quantum advantage is even easier to witness than in the symmetric-error setting because it occurs for a larger range of parameters. Going forward from here, we expect our formula to have applications in settings well beyond those considered in this paper, especially to quantum communication tasks involving quantum Gaussian channels.

Pfister, C., Kaniewski, J., Tomamichel, M., Mantri, A., Schmucker, R., McMahon, N., Milburn, G. & Wehner, S. 2016, 'A universal test for gravitational decoherence', *Nature Communications*, vol. 7, pp. 13022-13022.View/Download from: Publisher's site

Datta, N, Tomamichel, M & Wilde, MM 2016, 'On the second-order asymptotics for entanglement-assisted communication', *Quantum Information Processing*, vol. 15, no. 6, pp. 2569-2591.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2016, Springer Science+Business Media New York. The entanglement-assisted classical capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms of the quantum mutual information and does not increase in the presence of a noiseless quantum feedback channel from receiver to sender. In this work, we investigate second-order asymptotics of the entanglement-assisted classical communication task. That is, we consider how quickly the rates of entanglement-assisted codes converge to the entanglement-assisted classical capacity of a channel as a function of the number of channel uses and the error tolerance. We define a quantum generalization of the mutual information variance of a channel in the entanglement-assisted setting. For covariant channels, we show that this quantity is equal to the channel dispersion and thus completely characterize the convergence toward the entanglement-assisted classical capacity when the number of channel uses increases. Our results also apply to entanglement-assisted quantum communication, due to the equivalence between entanglement-assisted classical and quantum communication established by the teleportation and super-dense coding protocols.

Berta, M & Tomamichel, M 2016, 'The fidelity of recovery is multiplicative', *IEEE Transactions on Information Theory*, vol. 62, no. 4, pp. 1758-1763.View/Download from: UTS OPUS or Publisher's site

#### View description

© 1963-2012 IEEE. Fawzi and Renner recently established a lower bound on the conditional quantum mutual information (CQMI) of tripartite quantum states $ABC$ in terms of the fidelity of recovery (FoR), i.e., the maximal fidelity of the state $ABC$ with a state reconstructed from its marginal $BC$ by acting only on the $C$ system. The FoR measures quantum correlations by the local recoverability of global states and has many properties similar to the CQMI. Here, we generalize the FoR and show that the resulting measure is multiplicative by utilizing semi-definite programming duality. This allows us to simplify an operational proof by Brandão et al. of the above-mentioned lower bound that is based on quantum state redistribution. In particular, in contrast to the previous approaches, our proof does not rely on de Finetti reductions.

Hayashi, M & Tomamichel, M 2016, 'Correlation detection and an operational interpretation of the Rï¿½nyi mutual information', *Journal of Mathematical Physics*, vol. 57, no. 10.View/Download from: UTS OPUS or Publisher's site

#### View description

A variety of new measures of quantum Rï¿½nyi mutual information and quantum Rï¿½nyi conditional entropy have recently been proposed, and some of their mathematical properties explored. Here, we show that the Rï¿½nyi mutual information attains operational meaning in the context of composite hypothesis testing, when the null hypothesis is a fixed bipartite state and the alternative hypothesis consists of all product states that share one marginal with the null hypothesis. This hypothesis testing problem occurs naturally in channel coding, where it corresponds to testing whether a state is the output of a given quantum channel or of a "useless" channel whose output is decoupled from the environment. Similarly, we establish an operational interpretation of Rï¿½nyi conditional entropy by choosing an alternative hypothesis that consists of product states that are maximally mixed on one system. Specialized to classical probability distributions, our results also establish an operational interpretation of Rï¿½nyi mutual information and Rï¿½nyi conditional entropy.

Pfister, C, Kaniewski, J, Tomamichel, M, Mantri, A, Schmucker, R, McMahon, N, Milburn, G & Wehner, S 2016, 'A universal test for gravitational decoherence.', *Nature Communications*, vol. 7, pp. 13022-13022.View/Download from: UTS OPUS or Publisher's site

#### View description

Quantum mechanics and the theory of gravity are presently not compatible. A particular question is whether gravity causes decoherence. Several models for gravitational decoherence have been proposed, not all of which can be described quantum mechanically. Since quantum mechanics may need to be modified, one may question the use of quantum mechanics as a calculational tool to draw conclusions from the data of experiments concerning gravity. Here we propose a general method to estimate gravitational decoherence in an experiment that allows us to draw conclusions in any physical theory where the no-signalling principle holds, even if quantum mechanics needs to be modified. As an example, we propose a concrete experiment using optomechanics. Our work raises the interesting question whether other properties of nature could similarly be established from experimental observations alone-that is, without already having a rather well-formed theory of nature to make sense of experimental data.

Sutter, D, Tomamichel, M & Harrow, AW 2016, 'Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map', *IEEE Transactions on Information Theory*, vol. 62, no. 5, pp. 2907-2913.View/Download from: UTS OPUS or Publisher's site

#### View description

The quantum relative entropy between two states

satisfies a monotonicity property meaning that applying the same

quantum channel to both states can never increase their relative

entropy. It is known that this inequality is only tight when there

is a recovery map that exactly reverses the effects of the quantum

channel on both states. In this paper, we strengthen this inequality

by showing that the difference of relative entropies is bounded

below by the measured relative entropy between the first state

and a recovered state from its processed version. The recovery

map is a convex combination of rotated Petz recovery maps and

perfectly reverses the quantum channel on the second state. As a

special case, we reproduce recent lower bounds on the conditional

mutual information, such as the one proved by Fawzi and Renner.

Our proof only relies on the elementary properties of pinching

maps and the operator logarithm

Tomamichel, M, Berta, M & Renes, JM 2016, 'Quantum coding with finite resources.', *Nature communications*, vol. 7, p. 11419.View/Download from: UTS OPUS or Publisher's site

#### View description

The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should instead focus on the optimal trade-off between three parameters: the rate of the code, the size of the quantum devices at the encoder and decoder, and the fidelity of the transmission. We find approximate and exact characterizations of this trade-off for various channels of interest, including dephasing, depolarizing and erasure channels. In each case, the trade-off is parameterized by the capacity and a second channel parameter, the quantum channel dispersion. In the process, we develop several bounds that are valid for general quantum channels and can be computed for small instances.

Lin, MS & Tomamichel, M 2015, 'Investigating Properties of a Family of Quantum Renyi Divergences', *Quantum Information Processing*, vol. 14, no. 4, pp. 1501-1512.View/Download from: UTS OPUS or Publisher's site

#### View description

Audenaert and Datta recently introduced a two-parameter family of relative

R\'{e}nyi entropies, known as the $\alpha$-$z$-relative R\'{e}nyi entropies.

The definition of the $\alpha$-$z$-relative R\'{e}nyi entropy unifies all

previously proposed definitions of the quantum R\'{e}nyi divergence of order

$\alpha$ under a common framework. Here we will prove that the

$\alpha$-$z$-relative R\'{e}nyi entropies are a proper generalization of the

quantum relative entropy by computing the limit of the $\alpha$-$z$ divergence

as $\alpha$ approaches one and $z$ is an arbitrary function of $\alpha$. We

also show that certain operationally relevant families of R\'enyi divergences

are differentiable at $\alpha = 1$. Finally, our analysis reveals that the

derivative at $\alpha = 1$ evaluates to half the relative entropy variance, a

quantity that has attained operational significance in second-order quantum

hypothesis testing.

Lunghi, T, Kaniewski, J, Bussières, F, Houlmann, R, Tomamichel, M, Wehner, S & Zbinden, H 2015, 'Practical Relativistic Bit Commitment.', *Physical review letters*, vol. 115, no. 3, p. 030502.View/Download from: UTS OPUS or Publisher's site

#### View description

Bit commitment is a fundamental cryptographic primitive in which Alice wishes to commit a secret bit to Bob. Perfectly secure bit commitment between two mistrustful parties is impossible through an asynchronous exchange of quantum information. Perfect security is, however, possible when Alice and Bob each split into several agents exchanging classical information at times and locations suitably chosen to satisfy specific relativistic constraints. In this Letter we first revisit a previously proposed scheme [C. Crépeau et al., Lect. Notes Comput. Sci. 7073, 407 (2011)] that realizes bit commitment using only classical communication. We prove that the protocol is secure against quantum adversaries for a duration limited by the light-speed communication time between the locations of the agents. We then propose a novel multiround scheme based on finite-field arithmetic that extends the commitment time beyond this limit, and we prove its security against classical attacks. Finally, we present an implementation of these protocols using dedicated hardware and we demonstrate a 2 ms-long bit commitment over a distance of 131 km. By positioning the agents on antipodal points on the surface of Earth, the commitment time could possibly be extended to 212 ms.

Tan, VYF & Tomamichel, M 2015, 'The Third-Order Term in the Normal Approximation for the AWGN Channel', *IEEE Transactions on Information Theory*, vol. 61, no. 5, pp. 2430-2438.View/Download from: UTS OPUS or Publisher's site

#### View description

© 1963-2012 IEEE. This paper shows that, under the average error probability formalism, the third-order term in the normal approximation for the additive white Gaussian noise channel with a maximal or equal power constraint is at least (1/2) log n + O(1). This improves on the lower bound by Polyanskiys-Poor-Verdú (2010) and matches the upper bound proved by the same authors.

Tomamichel, M & Tan, VYF 2015, 'Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels', *Communications in Mathematical Physics*, vol. 338, no. 1, pp. 103-137.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2015, Springer-Verlag Berlin Heidelberg. We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite number of times and a fixed, non-vanishing average error is permissible. In this work we consider the classical capacity of quantum channels that are image-additive, including all classical to quantum channels, as well as the product state capacity of arbitrary quantum channels. In both cases we show that the non-asymptotic fundamental limit admits a second-order approximation that illustrates the speed at which the rate of optimal codes converges to the Holevo capacity as the blocklength tends to infinity. The behavior is governed by a new channel parameter, called channel dispersion, for which we provide a geometrical interpretation.

Dupuis, F, Szehr, O & Tomamichel, M 2014, 'A decoupling approach to classical data transmission over quantum channels', *IEEE Transactions on Information Theory*, vol. 60, no. 3, pp. 1562-1572.View/Download from: UTS OPUS or Publisher's site

#### View description

Most coding theorems in quantum Shannon theory can be proven using the decoupling technique. To send data through a channel, one guarantees that the environment gets no information about it. Uhlmann's theorem then ensures that the receiver must be able to decode. While a wide range of problems can be solved this way, one of the most basic coding problems remains impervious to a direct application of this method, sending classical information through a quantum channel. We will show that this problem can, in fact, be solved using decoupling ideas, specifically by proving a dequantizing theorem, which ensures that the environment is only classically correlated with the sent data. Our techniques naturally yield a generalization of the Holevo-Schumacher- Westmoreland theorem to the one-shot scenario, where a quantum channel can be applied only once. © 1963-2012 IEEE.

Furrer, F, Berta, M, Tomamichel, M, Scholz, VB & Christandl, M 2014, 'Position-momentum uncertainty relations in the presence of quantum memory', *Journal of Mathematical Physics*, vol. 55, no. 12.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2014 AIP Publishing LLC. A prominent formulation of the uncertainty principle identifies the fundamental quantum feature that no particle may be prepared with certain outcomes for both position and momentum measurements. Often the statistical uncertainties are thereby measured in terms of entropies providing a clear operational interpretation in information theory and cryptography. Recently, entropic uncertainty relations have been used to show that the uncertainty can be reduced in the presence of entanglement and to prove security of quantum cryptographic tasks. However, much of this recent progress has been focused on observables with only a finite number of outcomes not including Heisenberg's original setting of position and momentum observables. Here, we show entropic uncertainty relations for general observables with discrete but infinite or continuous spectrum that take into account the power of an entangled observer. As an illustration, we evaluate the uncertainty relations for position and momentum measurements, which is operationally significant in that it implies security of a quantum key distribution scheme based on homodyne detection of squeezed Gaussian states.

Furrer, F, Franz, T, Berta, M, Leverrier, A, Scholz, VB, Tomamichel, M & Werner, RF 2014, 'Erratum: Continuous variable quantum key distribution: Finite-key analysis of composable security against coherent attacks (Physical Review Letters (2012) 109 (100502))', *Physical Review Letters*, vol. 112, no. 1.View/Download from: Publisher's site

Kaniewski, J, Tomamichel, M & Wehner, S 2014, 'Entropic uncertainty from effective anticommutators', *Physical Review A - Atomic, Molecular, and Optical Physics*, vol. 90, no. 1.View/Download from: UTS OPUS or Publisher's site

#### View description

We investigate entropic uncertainty relations for two or more binary measurements, for example, spin-12 or polarization measurements. We argue that the effective anticommutators of these measurements, i.e., the anticommutators evaluated on the state prior to measuring, are an expedient measure of measurement incompatibility. Based on the knowledge of pairwise effective anticommutators we derive a class of entropic uncertainty relations in terms of conditional Rényi entropies. Our uncertainty relations are formulated in terms of effective measures of incompatibility, which can be certified in a device-independent fashion. Consequently, we discuss potential applications of our findings to device-independent quantum cryptography. Moreover, to investigate the tightness of our analysis we consider the simplest (and very well studied) scenario of two measurements on a qubit. We find that our results outperform the celebrated bound due to Maassen and Uffink [Phys. Rev. Lett. 60, 1103 (1988)PRLTAO0031-900710.1103/PhysRevLett.60.1103] and provide an analytical expression for the minimum uncertainty which also outperforms some recent bounds based on majorization. © 2014 American Physical Society.

Tomamichel, M & Tan, VYF 2014, 'Second-order coding rates for channels with state', *IEEE Transactions on Information Theory*, vol. 60, no. 8, pp. 4427-4448.View/Download from: UTS OPUS or Publisher's site

#### View description

We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the -capacity as well as necessary and sufficient conditions for the strong converse property for such channels when the sequence of channel states is not necessarily stationary, memoryless, or ergodic. We then seek a finer characterization of these capacities in terms of second-order coding rates. The general results are supplemented by several examples including independent identically distributed and Markov states and mixed channels. © 2014 IEEE.

Tomamichel, M, Berta, M & Hayashi, M 2014, 'Relating different quantum generalizations of the conditional Rényi entropy', *Journal of Mathematical Physics*, vol. 55, no. 8.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2014 AIP Publishing LLC. Recently a new quantum generalization of the Rényi divergence and the corresponding conditional Rényi entropies was proposed. Here, we report on a surprising relation between conditional Rényi entropies based on this new generalization and conditional Rényi entropies based on the quantum relative Rényi entropy that was used in previous literature. Our result generalizes the well-known duality relation H(A|B) + H(A|C) = 0 of the conditional von Neumann entropy for tripartite pure states to Rényi entropies of two different kinds. As a direct application, we prove a collection of inequalities that relate different conditional Rényi entropies and derive a new entropic uncertainty relation.

Kaniewski, J, Tomamichel, M, Hänggi, E & Wehner, S 2013, 'Secure bit commitment from relativistic constraints', *IEEE Transactions on Information Theory*, vol. 59, no. 7, pp. 4687-4699.View/Download from: UTS OPUS or Publisher's site

#### View description

We investigate two-party cryptographic protocols that are secure under assumptions motivated by physics, namely special relativity and quantum mechanics. In particular, we discuss the security of bit commitment in the so-called split models, i.e., models in which at least one of the parties is not allowed to communicate during certain phases of the protocol. We find the minimal splits that are necessary to evade the Mayers-Lo-Chau no-go argument and present protocols that achieve security in these split models. Furthermore, we introduce the notion of local versus global command, a subtle issue that arises when the split committer is required to delegate noncommunicating agents to open the commitment. We argue that classical protocols are insecure under global command in the split model we consider. On the other hand, we provide a rigorous security proof in the global command model for Kent's quantum protocol [1]. The proof employs two fundamental principles of modern physics, the no-signaling property of relativity and the uncertainty principle of quantum mechanics. © 2013 IEEE.

Lim, CCW, Portmann, C, Tomamichel, M, Renner, R & Gisin, N 2013, 'Device-Independent Quantum Key Distribution with Local Bell Test', *Physical Review X*, vol. 3, pp. 1-11.View/Download from: UTS OPUS or Publisher's site

#### View description

Device-independent quantum key distribution (DIQKD) in its current design requires a violation of a

Bell's inequality between two parties, Alice and Bob, who are connected by a quantum channel. However,

in reality, quantum channels are lossy and current DIQKD protocols are thus vulnerable to attacks

exploiting the detection loophole of the Bell test. Here, we propose a novel approach to DIQKD that

overcomes this limitation. In particular, we propose a protocol where the Bell test is performed entirely on

two casually independent devices situated in Alice's laboratory. As a result, the detection loophole caused

by the losses in the channel is avoided

Lunghi, T, Kaniewski, J, Bussières, F, Houlmann, R, Tomamichel, M, Kent, A, Gisin, N, Wehner, S & Zbinden, H 2013, 'Experimental bit commitment based on quantum communication and special relativity.', *Physical review letters*, vol. 111, no. 18, p. 180504.View/Download from: UTS OPUS or Publisher's site

#### View description

Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information. Perfect security is however possible when Alice and Bob split into several agents exchanging classical and quantum information at times and locations suitably chosen to satisfy specific relativistic constraints. Here we report on an implementation of a bit commitment protocol using quantum communication and special relativity. Our protocol is based on [A. Kent, Phys. Rev. Lett. 109, 130501 (2012)] and has the advantage that it is practically feasible with arbitrary large separations between the agents in order to maximize the commitment time. By positioning agents in Geneva and Singapore, we obtain a commitment time of 15 ms. A security analysis considering experimental imperfections and finite statistics is presented.

Müller-Lennert, M, Dupuis, F, Szehr, O, Fehr, S & Tomamichel, M 2013, 'On quantum Rényi entropies: A new generalization and some properties', *Journal of Mathematical Physics*, vol. 54, no. 12.View/Download from: UTS OPUS or Publisher's site

#### View description

The Rényi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies, or mutual informationhave found many applications in information theory and beyond. Various generalizations of Rényi entropies to the quantum setting have been proposed, most prominently Petz's quasi-entropies and Renner's conditional min-, max-collision entropy. However, these quantum extensions are incompatible and thus unsatisfactory. We propose a new quantum generalization of the family of Rényi entropies that contains the von Neumann entropy, min-entropy, collision entropythe max-entropy as special cases, thus encompassing most quantum entropies in use today. We show several natural properties for this definition, including data-processing inequalities, a duality relationan entropic uncertainty relation. © 2013 AIP Publishing LLC.

Szehr, O, Dupuis, F, Tomamichel, M & Renner, R 2013, 'Decoupling with unitary approximate two-designs', *New Journal of Physics*, vol. 15.View/Download from: UTS OPUS or Publisher's site

#### View description

Consider a bipartite system, of which one subsystem, A, undergoes a physical evolution separated from the other subsystem, R. One may ask under which conditions this evolution destroys all initial correlations between the subsystems A and R, i.e. decouples the subsystems. A quantitative answer to this question is provided by decoupling theorems, which have been developed recently in the area of quantum information theory. This paper builds on preceding work, which shows that decoupling is achieved if the evolution on A consists of a typical unitary, chosen with respect to the Haar measure, followed by a process that adds sufficient decoherence. Here, we prove a generalized decoupling theorem for the case where the unitary is chosen from an approximate two-design. A main implication of this result is that decoupling is physical, in the sense that it occurs already for short sequences of random two-body interactions, which can be modeled as efficient circuits. Our decoupling result is independent of the dimension of the R system, which shows that approximate two-designs are appropriate for decoupling even if the dimension of this system is large. © IOP Publishing and Deutsche Physikalische Gesellschaft.

Tomamichel, M & Hänggi, E 2013, 'The link between entropic uncertainty and nonlocality', *Journal of Physics A: Mathematical and Theoretical*, vol. 46, no. 5.View/Download from: UTS OPUS or Publisher's site

#### View description

Two of the most intriguing features of quantum physics are the uncertainty principle and the occurrence of nonlocal correlations. The uncertainty principle states that there exist pairs of incompatible measurements on quantum systems such that their outcomes cannot both be predicted. On the other hand, nonlocal correlations of measurement outcomes at different locations cannot be explained by classical physics, but appear in the presence of entanglement. Here, we show that these two fundamental quantum effects are quantitatively related. Namely, we provide an entropic uncertainty relation for the outcomes of two binary measurements, where the lower bound on the uncertainty is quantified in terms of the maximum Clauser-Horne-Shimony-Holt value that can be achieved with these measurements. We discuss applications of this uncertainty relation in quantum cryptography, in particular, to certify quantum sources using untrusted devices. © 2013 IOP Publishing Ltd.

Tomamichel, M & Hayashi, M 2013, 'A hierarchy of information quantities for finite block length analysis of quantum tasks', *IEEE Transactions on Information Theory*, vol. 59, no. 11, pp. 7693-7710.View/Download from: UTS OPUS or Publisher's site

#### View description

We consider two fundamental tasks in quantum information theory, data compression with quantum side information, as well as randomness extraction against quantum side information. We characterize these tasks for general sources using so-called one-shot entropies. These characterizations - in contrast to earlier results - enable us to derive tight second-order asymptotics for these tasks in the i.i.d. limit. More generally, our derivation establishes a hierarchy of information quantities that can be used to investigate information theoretic tasks in the quantum domain: The one-shot entropies most accurately describe an operational quantity, yet they tend to be difficult to calculate for large systems. We show that they asymptotically agree (up to logarithmic terms) with entropies related to the quantum and classical information spectrum, which are easier to calculate in the i.i.d. limit. Our technique also naturally yields bounds on operational quantities for finite block lengths. © 1963-2012 IEEE.

Tomamichel, M & Tan, VYF 2013, 'A tight upper bound for the third-order asymptotics for most discrete memoryless channels', *IEEE Transactions on Information Theory*, vol. 59, no. 11, pp. 7041-7051.View/Download from: UTS OPUS or Publisher's site

#### View description

This paper shows that the logarithm of the -error capacity (average error probability) for n uses of a discrete memoryless channel (DMC) is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2log n +O(1) if the -dispersion of the channel is positive. This matches a lower bound by Y. Polyanskiy (2010) for DMCs with positive reverse dispersion. If the -dispersion vanishes, the logarithm of the -dispersion capacity is upper bounded by n times the capacity plus a constant term except for a small class of DMCs and 1/2. © 1963-2012 IEEE.

Tomamichel, M, Fehr, S, Kaniewski, J & Wehner, S 2013, 'A monogamy-of-entanglement game with applications to device-independent quantum cryptography', *New Journal of Physics*, vol. 15.View/Download from: UTS OPUS or Publisher's site

#### View description

We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the uncertainty principle and the monogamy of entanglement, the probability that both players simultaneously succeed in guessing the outcome correctly is bounded. We are interested in the question of how the success probability scales when many such games are performed in parallel. We show that any strategy that maximizes the probability to win every game individually is also optimal for the parallel repetition of the game. Our result implies that the optimal guessing probability can be achieved without the use of entanglement. We explore several applications of this result. Firstly, we show that it implies security for standard BB84 quantum key distribution when the receiving party uses fully untrusted measurement devices, i.e. we show that BB84 is one-sided device independent. Secondly, we show how our result can be used to prove security of a one-round position-verification scheme. Finally, we generalize a well-known uncertainty relation for the guessing probability to quantum side information. © IOP Publishing and Deutsche Physikalische Gesellschaft.

Vitanov, A, Dupuis, F, Tomamichel, M & Renner, R 2013, 'Chain rules for smooth min-and max-entropies', *IEEE Transactions on Information Theory*, vol. 59, no. 5, pp. 2603-2612.View/Download from: UTS OPUS or Publisher's site

#### View description

The chain rule for the Shannon and von Neumann entropy, which relates the total entropy of a system to the entropies of its parts, is of central importance to information theory. Here, we consider the chain rule for the more general smooth min-and max-entropies, used in one-shot information theory. For these entropy measures, the chain rule no longer holds as an equality. However, the standard chain rule for the von Neumann entropy is retrieved asymptotically when evaluating the smooth entropies for many identical and independently distributed states. © 1963-2012 IEEE.

Furrer, F, Franz, T, Berta, M, Leverrier, A, Scholz, VB, Tomamichel, M & Werner, RF 2012, 'Continuous variable quantum key distribution: finite-key analysis of composable security against coherent attacks.', *Physical review letters*, vol. 109, no. 10, p. 100502.View/Download from: UTS OPUS or Publisher's site

#### View description

We provide a security analysis for continuous variable quantum key distribution protocols based on the transmission of two-mode squeezed vacuum states measured via homodyne detection. We employ a version of the entropic uncertainty relation for smooth entropies to give a lower bound on the number of secret bits which can be extracted from a finite number of runs of the protocol. This bound is valid under general coherent attacks, and gives rise to keys which are composably secure. For comparison, we also give a lower bound valid under the assumption of collective attacks. For both scenarios, we find positive key rates using experimental parameters reachable today.

Tomamichel, M, Lim, CCW, Gisin, N & Renner, R 2012, 'Tight finite-key analysis for quantum cryptography', *Nature Communications*, vol. 3, pp. 1-6.View/Download from: UTS OPUS or Publisher's site

#### View description

Despite enormous theoretical and experimental progress in quantum cryptography, the security of most current implementations of quantum key distribution is still not rigorously established. One significant problem is that the security of the final key strongly depends on the number, M, of signals exchanged between the legitimate parties. Yet, existing security proofs are often only valid asymptotically, for unrealistically large values of M. Another challenge is that most security proofs are very sensitive to small differences between the physical devices used by the protocol and the theoretical model used to describe them. Here we show that these gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies.

Tomamichel, M & Renner, R 2011, 'Uncertainty relation for smooth entropies.', *Physical review letters*, vol. 106, no. 11, p. 110506.View/Download from: UTS OPUS or Publisher's site

#### View description

Uncertainty relations give upper bounds on the accuracy by which the outcomes of two incompatible measurements can be predicted. While established uncertainty relations apply to cases where the predictions are based on purely classical data (e.g., a description of the system's state before measurement), an extended relation which remains valid in the presence of quantum information has been proposed recently [Berta et al., Nature Phys. 6, 659 (2010)]. Here, we generalize this uncertainty relation to one formulated in terms of smooth entropies. Since these entropies measure operational quantities such as extractable secret key length, our uncertainty relation is of immediate practical use. To illustrate this, we show that it directly implies security of quantum key distribution protocols. Our security claim remains valid even if the implemented measurement devices deviate arbitrarily from the theoretical model.

Tomamichel, M, Schaffner, C, Smith, A & Renner, R 2011, 'Leftover hashing against quantum side information', *IEEE Transactions on Information Theory*, vol. 57, no. 8, pp. 5524-5535.View/Download from: UTS OPUS or Publisher's site

#### View description

The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, a strictly more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is shown. Our result applies to almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing. © 2011 IEEE.

Winkler, S, Tomamichel, M, Hengl, S & Renner, R 2011, 'Impossibility of growing quantum bit commitments.', *Physical review letters*, vol. 107, no. 9, p. 090502.View/Download from: UTS OPUS or Publisher's site

#### View description

Quantum key distribution (QKD) is often, more correctly, called key growing. Given a short key as a seed, QKD enables two parties, connected by an insecure quantum channel, to generate a secret key of arbitrary length. Conversely, no key agreement is possible without access to an initial key. Here, we consider another fundamental cryptographic task, commitments. While, similar to key agreement, commitments cannot be realized from scratch, we ask whether they may be grown. That is, given the ability to commit to a fixed number of bits, is there a way to augment this to commitments to strings of arbitrary length? Using recently developed information-theoretic techniques, we answer this question in the negative.

Tomamichel, M, Colbeck, R & Renner, R 2010, 'Duality between smooth min- and max-entropies', *IEEE Transactions on Information Theory*, vol. 56, no. 9, pp. 4674-4681.View/Download from: Publisher's site

#### View description

In classical and quantum information theory, operational quantities such as the amount of randomness that can be extracted from a given source or the amount of space needed to store given data are normally characterized by one of two entropy measures, called smooth min-entropy and smooth max-entropy, respectively. While both entropies are equal to the von Neumann entropy in certain special cases (e.g., asymptotically, for many independent repetitions of the given data), their values can differ arbitrarily in the general case. In this paper, a recently discovered duality relation between (nonsmooth) min- and max-entropies is extended to the smooth case. More precisely, it is shown that the smooth min-entropy of a system A conditioned on a system B equals the negative of the smooth max-entropy of A conditioned on a purifying system C. This result immediately implies that certain operational quantities (such as the amount of compression and the amount of randomness that can be extracted from given data) are related. We explain how such relations have applications in cryptographic security proofs. © 2010 IEEE.

Tomamichel, M, Colbeck, R & Renner, R 2009, 'A fully quantum asymptotic equipartition property', *IEEE Transactions on Information Theory*, vol. 55, no. 12, pp. 5840-5847.View/Download from: Publisher's site

#### View description

The classical asymptotic equipartition property is the statement that, in the limit of a large number of identical repetitions of a random experiment, the output sequence is virtually certain to come from the typical set, each member of which is almost equally likely. In this paper, a fully quantum generalization of this property is shown, where both the output of the experiment and side information are quantum. An explicit bound on the convergence is given, which is independent of the dimensionality of the side information. This naturally leads to a family of Rényi-like quantum conditional entropies, for which the von Neumann entropy emerges as a special case. © 2009 IEEE.

Witzigmann, B, Tomamichel, M, Steiger, S, Veprek, RG, Kojima, K & Schwarz, UT 2008, 'Analysis of gain and luminescence in violet and blue GaInN - GaN quantum wells', *IEEE Journal of Quantum Electronics*, vol. 44, no. 2, pp. 144-149.View/Download from: Publisher's site

#### View description

In this paper, gain in GaInN quantum wells with 8% and 19% indium is analyzed using a comparison of a microscopic model to experimental data. It is shown that localized valence states can explain the characteristics of the gain spectra, in particular the broadening features at the red side of the spectrum. From an analysis of experimental and simulation data, the nonradiative current component is extracted, and is shown to dominate the total current density at laser threshold operation. The increase of nonradiative current with density explains the drop in internal quantum efficiency in GaInN light-emitting diodes. © 2007 IEEE.

Wang, X, Fang, K & Tomamichel, M 2018, 'On Finite Blocklength Converse Bounds for Classical Communication over Quantum Channels', *IEEE International Symposium on Information Theory - Proceedings*, pp. 2157-2161.View/Download from: Publisher's site

#### View description

© 2018 IEEE. We explore several new converse bounds for classical communication over quantum channels in the finite blocklength regime. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new meta-converse on the amount of information unassisted codes can transmit over a single use of a quantum channel. We further show that this meta-converse can be evaluated via semidefinite programming. As an application, we provide a second-order analysis of classical communication over quantum erasure channels.

Chubb, CT, Tan, VYF & Tomamichel, M 2017, 'Moderate deviation analysis for classical communication over quantum channels', *IEEE International Symposium on Information Theory - Proceedings*, pp. 1544-1548.View/Download from: Publisher's site

#### View description

© 2017 IEEE. We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff between decoding error, code rate and code length for such codes we introduce a quantum generalisation of the moderate deviation analysis proposed by Altg and Wagner as well as Polyanskiy and Verdú. We derive such a tradeoff for classical-quantum (as well as image-additive) channels in terms of the channel capacity and the channel dispersion, giving further evidence that the latter quantity characterises the necessary backoff from capacity when transmitting finite blocks of classical data. To derive these results we also study asymmetric binary quantum hypothesis testing in the moderate deviations regime. Due to the central importance of the latter task, we expect that our techniques will find further applications in the analysis of other quantum information processing tasks.

Cheng, HC, Hsieh, MH & Tomamichel, M 2017, 'Sphere-packing bound for classical-quantum channels', *IEEE International Symposium on Information Theory - Proceedings*, IEEE Information Theory Workshop, IEEE, Kaohsiung, Taiwan, pp. 479-483.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017 IEEE. We study lower bounds on the optimal error probability in channel coding at rates below capacity, commonly termed sphere-packing bounds. In this work, we establish a sphere-packing bound for classical-quantum channels, which significantly improves previous prefactor from the order of subexponential to polynomial. Furthermore, the gap between the obtained error exponent for constant composition codes and the best known classical random coding exponent vanishes in the order of o(log n/n), indicating our sphere-packing bound is almost exact in the high rate regime. The main technical contributions are two converse Hoeffding bounds for quantum hypothesis testing and the saddle-point properties of error exponent functions.

Cheng, HC, Hsieh, MH & Tomamichel, M 2017, 'Sphere-packing bound for symmetric classical-quantum channels', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, IEEE, Aachen, Germany, pp. 286-290.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017 IEEE. "To be considered for the 2017 IEEE Jack Keil Wolf ISIT Student Paper Award." We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of the subexponential to the polynomial, This established pre-factor is arguably optimal because it matches the best known random coding upper bound in the classical case. Our approaches rely on a sharp concentration inequality in strong large deviation theory and crucial properties of the error-exponent function.

Sutter, D, Berta, M & Tomamichel, M 2017, 'Quantum Markov chains and logarithmic trace inequalities', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, IEEE, Aachen, Germany, pp. 1988-1992.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017 IEEE. A Markov chain is a tripartite quantum state ABCwhere there exists a recovery map RBBCsuch that ABC= RBBC(AB). More generally, an approximate Markov chain ABCis a state whose distance to the closest recovered state RBBC(AB) is small. Recently it has been shown that this distance can be bounded from above by the conditional mutual information I(A: C|B)of the state. We improve on this connection by deriving the first bound that is tight in the commutative case and features an explicit recovery map that only depends on the reduced state pBC. The key tool in our proof is a multivariate extension of the Golden-Thompson inequality, which allows us to extend logarithmic trace inequalities from two to arbitrarily many matrices.

Wilde, MM, Tomamichel, M & Berta, M 2017, 'A meta-converse for private communication over quantum channels', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, IEEE, Aachen, Germany, pp. 291-295.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2017 IEEE. We establish a converse bounds on the private transmission capabilities of a quantum channel. The main conceptual development builds firmly on the notion of a private state, which is a powerful, uniquely quantum method for simplifying the tripartite picture of privacy involving local operations and public classical communication to a bipartite picture of quantum privacy involving local operations and classical communication. This approach has previously led to some of the strongest upper bounds on secret key rates, including the squashed entanglement and the relative entropy of entanglement. Here we use this approach along with a "privacy test" to establish a general meta-converse bound for private communication.

Berta, M, Fawzi, O & Tomamichel, M 2016, 'Exploiting variational formulas for quantum relative entropy', *Proceedings IEEE International Symposium on Information Theory (ISIT 2016)*, IEEE International Symposium on Information Theory, IEEE, Barcelona, Spain, pp. 2844-2848.View/Download from: Publisher's site

#### View description

The relative entropy is the basic concept underlying various information measures like entropy, conditional entropy and mutual information. Here, we discuss how to make use of variational formulas for measured relative entropy and quantum relative entropy for understanding the additivity properties of various entropic quantities that appear in quantum information theory. In particular, we show that certain lower bounds on quantum conditional mutual information are superadditive.

Sutter, D, Tomamichel, M & Harrow, AW 2016, 'Strengthened monotonicity of relative entropy via pinched Petz recovery map', *Proceedings IEEE International Symposium on Information Theory (ISIT 2016)*, IEEE, Barcelona, pp. 760-764.View/Download from: Publisher's site

Tomamichel, M & Hayashi, M 2016, 'Operational interpretation of Rényi conditional mutual information via composite hypothesis testing against Markov distributions', *Proceedings IEEE International Symposium on Information Theory (ISIT 2016)*, IEEE International Symposium on Information Theory, IEEE, Barcelona, Spain, pp. 585-589.View/Download from: UTS OPUS or Publisher's site

#### View description

We revisit the problem of asymmetric binary hypothesis testing against a composite alternative hypothesis. We introduce a general framework to treat such problems when the alternative hypothesis adheres to certain axioms. In this case we find the threshold rate, the optimal error and strong converse exponents (at large deviations from the threshold) and the second-order asymptotics (at small deviations from the threshold). We apply our results to find operational interpretations of Renyi information measures. In particular, in case the alternative hypothesis consists of certain tripartite distributions satisfying the Markov property, we find that the optimal exponents are determined by the Renyi conditional mutual information

Datta, N, Tomamichel, M & Wilde, MM 2015, 'Second-order coding rates for entanglement-assisted communication', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, IEEE, Hong Kong, China, pp. 2772-2776.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2015 IEEE. The entanglement-assisted capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms of the quantum mutual information and does not increase in the presence of a noiseless quantum feedback channel from receiver to sender. In this work, we investigate second-order asymptotics of the entanglement-assisted communication task. That is, we consider how quickly the rates of entanglement-assisted codes converge to the entanglement-assisted capacity of a channel as a function of the number of channel uses and the error tolerance. We define a quantum generalization of the mutual information variance of a channel in the entanglement-assisted setting. For covariant channels, we show that this quantity is equal to the channel dispersion, and characterizes the convergence towards the entanglement-assisted capacity when the number of channel uses increases. More generally, we prove that the Gaussian approximation for a second-order coding rate is achievable for all quantum channels.

Hayashi, M & Tomamichel, M 2015, 'Correlation detection and an operational interpretation of the Rényi mutual information', *Proceedings IEEE International Symposium on Information Theory (ISIT 2015)*, IEEE, Hong Kong, China, pp. 1447-1451.View/Download from: Publisher's site

Tomamichel, M, Wilde, MM & Winter, A 2015, 'Strong converse rates for quantum communication', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, IEEE, Hong Kong, China, pp. 2386-2390.View/Download from: UTS OPUS or Publisher's site

#### View description

© 2015 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it is possible to transmit quantum information at a rate exceeding the channel capacity if we allow for a non-vanishing probability of decoding error. Here we establish that the Rains information of any quantum channel is a strong converse rate for quantum communication: For any code with a rate exceeding the Rains information of the channel, we show that the fidelity vanishes exponentially fast as the number of channel uses increases. This remains true even if we consider codes that perform classical post-processing on the transmitted quantum data. Our result has several applications. Most importantly, for generalized dephasing channels we show that the Rains information is also achievable, and thereby establish the strong converse property for quantum communication over such channels. This for the first time conclusively settles the strong converse question for a class of quantum channels that have a non-trivial quantum capacity.

Tan, VYF & Tomamichel, M 2014, 'The third-order term in the normal approximation for the AWGN channel', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, pp. 2077-2081.View/Download from: UTS OPUS or Publisher's site

#### View description

This paper shows that, under the average error probability formalism, the third-order term in the normal approximation for the additive white Gaussian noise channel with a maximal or equal power constraint is at least 1 over 2 log n+O(1). This improves on the lower bound by Polyanskiy-Poor-Verdú (2010) and matches the upper bound proved by the same authors. © 2014 IEEE.

Tomamichel, M & Tan, VYF 2014, 'Second order refinements for the classical capacity of quantum channels with separable input states', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, IEEE, Honolulu, USA, pp. 141-145.View/Download from: UTS OPUS or Publisher's site

#### View description

We study the non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of information that can be transmitted when the channel is used a finite number of times and a finite average decoding error is permissible. We show that, if we restrict the encoder to use ensembles of separable states, the non-asymptotic fundamental limit admits a Gaussian approximation that illustrates the speed at which the rate of optimal codes converges to the Holevo capacity as the number of channel uses tends to infinity. To do so, several important properties of quantum information quantities, such as the capacity-achieving output state, the divergence radius, and the channel dispersion, are generalized from their classical counterparts. Further, we exploit a close relation between classical-quantum channel coding and quantum binary hypothesis testing and rely on recent progress in the non-asymptotic characterization of quantum hypothesis testing and its Gaussian approximation. © 2014 IEEE.

Tomamichel, M, Berta, M & Hayashi, M 2014, 'A duality relation connecting different quantum generalizations of the conditional Rényi entropy', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, IEEE, Honolulu, USA, pp. 731-735.View/Download from: UTS OPUS or Publisher's site

#### View description

Recently a new quantum generalization of the Rényi divergence and the corresponding conditional Rényi entropies was proposed. Here we report on a surprising relation between conditional Rényi entropies based on this new generalization and conditional Rényi entropies based on the quantum relative Rényi entropy that was used in previous literature. This generalizes the well-known duality relation H(AB)+H(AC) = 0 for tripartite pure states to Rényi entropies of two different kinds. As a direct application, we prove a collection of inequalities that relate different conditional Rényi entropies. © 2014 IEEE.

Tomamichel, M, Martinez-Mateo, J, Pacher, C & Elkouss, D 2014, 'Fundamental Finite Key Limits for Information Reconciliation in Quantum Key Distribution', *Proceedings of the IEEE International Symposium on Information Theory (ISIT 2014)*, IEEE International Symposium on Information Theory, IEEE, USA, pp. 1469-1473.View/Download from: Publisher's site

#### View description

The security of quantum key distribution protocols is guaranteed by the laws

of quantum mechanics. However, a precise analysis of the security properties

requires tools from both classical cryptography and information theory. Here,

we employ recent results in non-asymptotic classical information theory to show

that information reconciliation imposes fundamental limitations on the amount

of secret key that can be extracted in the finite key regime. In particular, we

find that an often used approximation for the information leakage during

information reconciliation is flawed and we propose an improved estimate.

Tomamichel, M. & Tan, V.Y.F. 2013, '-Capacity and strong converse for channels with general state', *2013 IEEE Information Theory Workshop, ITW 2013*.View/Download from: Publisher's site

#### View description

We consider state-dependent memoryless channels with general state available at both encoder and decoder. We establish the -capacity and the optimistic -capacity. This allows us to prove a necessary and sufficient condition for the strong converse to hold. We also provide a simpler sufficient condition on the first- and second-order statistics of the state process that ensures that the strong converse holds. © 2013 IEEE.

Tomamichel, M & Tan, VYF 2013, 'A tight upper bound for the third-order asymptotics of discrete memoryless channels', *IEEE International Symposium on Information Theory - Proceedings*, IEEE International Symposium on Information Theory, pp. 1536-1540.View/Download from: UTS OPUS or Publisher's site

#### View description

This paper shows that the logarithm of the -error capacity (average error probability) for n uses of a discrete memoryless channel with positive conditional information variance at every capacity-achieving input distribution is upper bounded by the normal approximation plus a term that does not exceed 1/2 log n + O(1). © 2013 IEEE.

Tomamichel, M & Tan, VYF 2013, '-Capacity and strong converse for channels with general state', *Information Theory Workshop (ITW), 2013 IEEE*, IEEE Information Theory Workshop (ITW), IEEE, Seville, Spain.View/Download from: UTS OPUS or Publisher's site

#### View description

We consider state-dependent memoryless channels with general state available at both encoder and decoder. We establish the -capacity and the optimistic -capacity. This allows us to prove a necessary and sufficient condition for the strong converse to hold. We also provide a simpler sufficient condition on the first- and second-order statistics of the state process that ensures that the strong converse holds.

Tomamichel, M, Fehr, S, Kaniewski, J & Wehner, S 2013, 'One-sided device-independent QKD and position-based cryptography from monogamy games', *Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, International Conference on the Theory and Application of Cryptographic Techniques, Springer, Athens, Greece, pp. 609-625.View/Download from: UTS OPUS or Publisher's site

#### View description

A serious concern with quantum key distribution (QKD) schemes is that, when under attack, the quantum devices in a real-life implementation may behave differently than modeled in the security proof. This can lead to real-life attacks against provably secure QKD schemes. In this work, we show that the standard BB84 QKD scheme is one-sided device-independent. This means that security holds even if Bob's quantum device is arbitrarily malicious, as long as Alice's device behaves as it should. Thus, we can completely remove the trust into Bob's quantum device for free, without the need for changing the scheme, and without the need for hard-to-implement loophole-free violations of Bell inequality, as is required for fully (meaning two-sided) device-independent QKD. For our analysis, we introduce a new quantum game, called a monogamy-of-entanglement game, and we show a strong parallel repetition theorem for this game. This new notion is likely to be of independent interest and to find additional applications. Indeed, besides the application to QKD, we also show a direct application to position-based quantum cryptography: we give the first security proof for a one-round position-verification scheme that requires only single-qubit operations. © 2013 International Association for Cryptologic Research.

Tomamichel, M, Renner, R, Schaffner, C & Smith, A 2010, 'Leftover Hashing against quantum side information', *Proceedings of the IEEE Symposium on Information Theory (ISIT 2010)*, IEEE, Austin, USA, pp. 2703-2707.View/Download from: UTS OPUS or Publisher's site

Witzigmann, B, Steiger, S, Tomamichel, M, Veprek, R & Schwarz, UT 2007, 'Optical gain in 407nm and 470nm InGaN/GaN heterostructures: Signature of quantum-dot states', *Proceedings of SPIE - The International Society for Optical Engineering*.View/Download from: Publisher's site

#### View description

In this contribution, a detailed analysis of optical gain in InGaN/GaN quantum structures with Indium content of 10% and 20% is presented. Experimental data are obtained from Hakki-Paoli characterization of edge-emitting Fabry-Perot lasers. A gain model that includes many-particle effects on a microscopic level, as well as combined quantum-well and quantum-dot density of states, is used to explain the experimental findings. Inhomogeneous broadening arising from local Indium clusters is included via a statistical fluctuation of the electronic density of states. Excellent agreement is obtained for the characteristic gain spectra from structures emitting at 405nm (10% In content) and 470nm (20% In content), and a systematic analysis of the microscopic physics shows signature of quantum-dot states.

Memis, OG, Kong, SC, Katsnelson, A, Tomamichel, MP & Mohseni, H 2006, 'A novel avalanche free single photon detector', *2006 6th IEEE Conference on Nanotechnology, IEEE-NANO 2006*, pp. 742-745.

#### View description

We have conceived a novel single photon detector for IR wavelengths above 1 m. The detection mechanism is based on carrier focalization and nano-injection. Preliminary measured data from unpassivated devices show a very high internal gain and low dark current at 1.55 m at room temperature © 2006 IEEE.

Anshu, A, Berta, M, Jain, R & Tomamichel, M 2018, 'Partially smoothed information measures'.

#### View description

Smooth entropies are a tool for quantifying resource trade-offs in (quantum)

information theory and cryptography. In typical bi- and multi-partite problems,

however, some of the sub-systems are often left unchanged and this is not

reflected by the standard smoothing of information measures over a ball of

close states. We propose to smooth instead only over a ball of close states

which also have some of the reduced states on the relevant sub-systems fixed.

This partial smoothing of information measures naturally allows to give more

refined characterizations of various information-theoretic problems in the

one-shot setting. In particular, we immediately get asymptotic second-order

characterizations for tasks such as privacy amplification against classical

side information or classical state splitting. For quantum problems like state

merging the general resource trade-off is tightly characterized by partially

smoothed information measures as well. However, for quantum systems we can so

far only give the asymptotic first-order expansion of these quantities.

Fang, K, Wang, X, Tomamichel, M & Berta, M 2018, 'Quantum Channel Simulation and the Channel's Smooth Max-Information'.

#### View description

We study the general framework of quantum channel simulation, that is, the

ability of a quantum channel to simulate another one using different classes of

codes. First, we show that the minimum error of simulation and the one-shot

quantum simulation cost under no-signalling assisted codes are given by

semidefinite programs. Second, we introduce the channel's smooth

max-information, which can be seen as a one-shot generalization of the mutual

information of a quantum channel. We provide an exact operational

interpretation of the channel's smooth max-information as the one-shot quantum

simulation cost under no-signalling assisted codes. Third, we derive the

asymptotic equipartition property of the channel's smooth max-information,

i.e., it converges to the quantum mutual information of the channel in the

independent and identically distributed asymptotic limit. This implies the

quantum reverse Shannon theorem in the presence of no-signalling correlations.

Finally, we explore the simulation cost of various quantum channels.

Huber, S, Koenig, R & Tomamichel, M 2018, 'Jointly constrained semidefinite bilinear programming with an application to Dobrushin curves'.

#### View description

We propose a branch-and-bound algorithm for minimizing a bilinear functional

of the form \[ f(X,Y) = \mathrm{tr}((X\otimes

Y)Q)+\mathrm{tr}(AX)+\mathrm{tr}(BY) , \] of pairs of Hermitian matrices

$(X,Y)$ restricted by joint semidefinite programming constraints. The

functional is parametrized by self-adjoint matrices $Q$, $A$ and $B$. This

problem generalizes that of a bilinear program, where $X$ and $Y$ belong to

polyhedra. The algorithm converges to a global optimum and yields upper and

lower bounds on its value in every step. Various problems in quantum

information theory can be expressed in this form. As an example application, we

compute Dobrushin curves of quantum channels, giving upper bounds on classical

coding with energy constraints.

Taranto, P, Pollock, FA, Milz, S, Tomamichel, M & Modi, K 2018, 'Quantum Markov Order'.

#### View description

We formally extend the notion of Markov order to open quantum processes by

accounting for the instruments used to probe the system of interest at

different times. Our description recovers the classical Markov order property

in the appropriate limit: when the stochastic process is classical and the

instruments are non-invasive, i.e., restricted to orthogonal projective

measurements. We then prove that there do not exist non-Markovian quantum

processes that have finite Markov order with respect to all possible

instruments; the same process exhibits distinct memory effects with respect to

different probing instruments. This naturally leads to a relaxed definition of

quantum Markov order with respect to specified sequences of instruments. The

memory effects captured by different choices of instruments vary dramatically,

providing a rich landscape for future exploration.

Youssry, A, Ferrie, C & Tomamichel, M 2018, 'Efficient online quantum state estimation using a matrix-exponentiated gradient method'.

#### View description

In this paper, we explore an efficient online algorithm for quantum state

estimation based on a matrix-exponentiated gradient method previously used in

the context of machine learning. The state update is governed by a learning

rate that determines how much weight is given to the new measurement results

obtained in each step. We show convergence of the running state estimate in

probability to the true state for both noiseless and noisy measurements. We

find that in the latter case the learning rate has to be chosen adaptively and

decreasing to guarantee convergence beyond the noise threshold. As a practical

alternative we then propose to use running averages of the measurement

statistics and a constant learning rate to overcome the noise problem. The

proposed algorithm is numerically compared with batch maximum-likelihood and

least-squares estimators. The results show a superior performance of the new

algorithm in terms of accuracy and runtime complexity.

Aggarwal, D, Brennen, GK, Lee, T, Santha, M & Tomamichel, M, 'Quantum attacks on Bitcoin, and how to protect against them'.

#### View description

The key cryptographic protocols used to secure the internet and financial

transactions of today are all susceptible to attack by the development of a

sufficiently large quantum computer. One particular area at risk are

cryptocurrencies, a market currently worth over 150 billion USD. We investigate

the risk of Bitcoin, and other cryptocurrencies, to attacks by quantum

computers. We find that the proof-of-work used by Bitcoin is relatively

resistant to substantial speedup by quantum computers in the next 10 years,

mainly because specialized ASIC miners are extremely fast compared to the

estimated clock speed of near-term quantum computers. On the other hand, the

elliptic curve signature scheme used by Bitcoin is much more at risk, and could

be completely broken by a quantum computer as early as 2027, by the most

optimistic estimates. We analyze an alternative proof-of-work called Momentum,

based on finding collisions in a hash function, that is even more resistant to

speedup by a quantum computer. We also review the available post-quantum

signature schemes to see which one would best meet the security and efficiency

requirements of blockchain applications.

Cheng, H-C, Hsieh, M-H & Tomamichel, M, 'Quantum Sphere-Packing Bounds with Polynomial Prefactors'.

#### View description

We study lower bounds on the optimal error probability in classical coding

over classical-quantum channels at rates below the capacity, commonly termed

quantum sphere-packing bounds. Winter and Dalai have derived such bounds for

classical-quantum channels; however, the exponents in their bounds only

coincide when the channel is classical. In this paper, we show that these two

exponents admit a variational representation and are related by the

Golden-Thompson inequality, reaffirming that Dalai's expression is stronger in

general classical-quantum channels. Second, we establish a sphere-packing bound

for classical-quantum channels, which significantly improves Dalai's prefactor

from the order of subexponential to polynomial. Furthermore, the gap between

the obtained error exponent for constant composition codes and the best known

classical random coding exponent vanishes in the order of $o(\log n / n)$,

indicating our sphere-packing bound is almost exact in the high rate regime.

Finally, for a special class of symmetric classical-quantum channels, we can

completely characterize its optimal error probability without the constant

composition code assumption. The main technical contributions are two converse

Hoeffding bounds for quantum hypothesis testing and the saddle-point properties

of error exponent functions.

Chubb, CT, Tomamichel, M & Korzekwa, K, 'Beyond the thermodynamic limit: finite-size corrections to state interconversion rates'.

#### View description

Thermodynamics is traditionally constrained to the study of macroscopic

systems whose energy fluctuations are negligible compared to their average

energy. Here, we push beyond this thermodynamic limit by developing a

mathematical framework to rigorously address the problem of thermodynamic

transformations of finite-size systems. More formally, we analyse state

interconversion under thermal operations and between arbitrary

energy-incoherent states. We find precise relations between the optimal rate at

which interconversion can take place and the desired infidelity of the final

state when the system size is sufficiently large. These so-called second-order

asymptotics provide a bridge between the extreme cases of single-shot

thermodynamics and the asymptotic limit of infinitely large systems. We

illustrate the utility of our results with several examples. We first show how

thermodynamic cycles are affected by irreversibility due to finite-size

effects. We then provide a precise expression for the gap between the

distillable work and work of formation that opens away from the thermodynamic

limit. Finally, we explain how the performance of a heat engine gets affected

when one of the heat baths it operates between is finite. We find that while

perfect work cannot generally be extracted at Carnot efficiency, there are

conditions under which these finite-size effects vanish. In deriving our

results we also clarify relations between different notions of approximate

majorisation.

Fang, K, Wang, X, Tomamichel, M & Duan, R, 'Non-asymptotic entanglement distillation'.

#### View description

Non-asymptotic entanglement distillation studies the trade-off between three

parameters: the distillation rate, the number of independent and identically

distributed prepared states, and the fidelity of the distillation. We first

study the one-shot {\epsilon}-infidelity distillable entanglement under quantum

operations that completely preserve positivity of the partial transpose (PPT)

and characterize it as a semidefinite program (SDP). For isotropic states, it

can be further simplified to a linear program. The one-shot

{\epsilon}-infidelity PPT- assisted distillable entanglement can be transformed

to a quantum hypothesis testing problem. Moreover, we show efficiently

computable second-order upper and lower bounds for the non-asymptotic

distillable entanglement with a given infidelity tolerance. Utilizing these

bounds, we obtain the second order asymptotic expansions of the optimal

distillation rates for pure states and some classes of mixed states. In

particular, this result recovers the second-order expansion of LOCC distillable

entanglement for pure states in [Datta/Leditzky, IEEE Trans. Inf. Theory

61:582, 2015]. Furthermore, we provide an algorithm for calculating the Rains

bound and present direct numerical evidence (not involving any other

entanglement measures, as in [Wang/Duan, Phys. Rev. A 95:062322, 2017]),

showing that the Rains bound is not additive under tensor products.

Tomamichel, M, 'A Framework for Non-Asymptotic Quantum Information Theory'.

#### View description

This thesis consolidates, improves and extends the smooth entropy framework

for non-asymptotic information theory and cryptography.

We investigate the conditional min- and max-entropy for quantum states,

generalizations of classical R\'enyi entropies. We introduce the purified

distance, a novel metric for unnormalized quantum states and use it to define

smooth entropies as optimizations of the min- and max-entropies over a ball of

close states. We explore various properties of these entropies, including

data-processing inequalities, chain rules and their classical limits. The most

important property is an entropic formulation of the asymptotic equipartition

property, which implies that the smooth entropies converge to the von Neumann

entropy in the limit of many independent copies. The smooth entropies also

satisfy duality and entropic uncertainty relations that provide limits on the

power of two different observers to predict the outcome of a measurement on a

quantum system.

Finally, we discuss three example applications of the smooth entropy

framework. We show a strong converse statement for source coding with quantum

side information, characterize randomness extraction against quantum side

information and prove information theoretic security of quantum key

distribution using an intuitive argument based on the entropic uncertainty

relation.

Wang, X, Fang, K & Tomamichel, M, 'On converse bounds for classical communication over quantum channels'.

#### View description

We explore several new converse bounds for classical communication over

quantum channels in both the one-shot and asymptotic regime. First, we show

that the Matthews-Wehner meta-converse bound for entanglement-assisted

classical communication can be achieved by activated, no-signalling assisted

codes, suitably generalizing a result for classical channels. Second, we derive

a new efficiently computable meta-converse on the amount of information

unassisted codes can transmit over a single use of a quantum channel. As

applications, we provide a finite resource analysis of classical communication

over quantum erasure channels, including the second-order and moderate

deviation asymptotics. Third, we explore the asymptotic analogue of our new

meta-converse, the $\Upsilon$-information of the channel. We show that its

regularization is an upper bound on the capacity that is generally tighter than

the entanglement-assisted capacity and other known efficiently computable

strong converse bounds. For covariant channels, we show that the

$\Upsilon$-information is a strong converse bound.

#### Projects

**Selected projects**