Symmetric Minimal Quantum Tomography and Optimal Error Regions

Ph.DDOCTOR OF PHILOSOPH

Mathematical and Numerical Aspects of Quantum Chemistry Problems

This workshop was aimed at strengthtening the interactions between well established experts in quantum chemistry, mathematical analysis, numerical analysis and computational metodology. Most of the mathematicians present in the worskhop have already contributed to the theoretical and numerical study of models in quantum physics and chemistry. Some others, familiar with contiguous fiels, were new to chemistry. Several distinguished researchers in theoretical chemistry participated in the workshop, and presented the mathematical and computational challenges of the field

Statistical and Computational Aspects of Learning with Complex Structure

The recent explosion of data that is routinely collected has led scientists to contemplate more and more sophisticated structural assumptions. Understanding how to harness and exploit such structure is key to improving the prediction accuracy of various statistical procedures. The ultimate goal of this line of research is to develop a set of tools that leverage underlying complex structures to pool information across observations and ultimately improve statistical accuracy as well as computational efficiency of the deployed methods. The workshop focused on recent developments in regression and matrix estimation under various complex constraints such as physical, computational, privacy, sparsity or robustness. Optimal-transport based techniques for geometric data analysis were also a main topic of the workshop

Quantum Sphere-Packing Bounds with Polynomial Prefactors

© 1963-2012 IEEE. 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 finite blocklength 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

Game Theory Relaunched

The game is on. Do you know how to play? Game theory sets out to explore what can be said about making decisions which go beyond accepting the rules of a game. Since 1942, a well elaborated mathematical apparatus has been developed to do so; but there is more. During the last three decades game theoretic reasoning has popped up in many other fields as well - from engineering to biology and psychology. New simulation tools and network analysis have made game theory omnipresent these days. This book collects recent research papers in game theory, which come from diverse scientific communities all across the world; they combine many different fields like economics, politics, history, engineering, mathematics, physics, and psychology. All of them have as a common denominator some method of game theory. Enjoy

Confirmation, Decision, and Evidential Probability

Henry Kyburg’s theory of Evidential Probability offers a neglected tool for approaching problems in confirmation theory and decision theory. I use Evidential Probability to examine some persistent problems within these areas of the philosophy of science. Formal tools in general and probability theory in particular have great promise for conceptual analysis in confirmation theory and decision theory, but they face many challenges. In each chapter, I apply Evidential Probability to a specific issue in confirmation theory or decision theory. In Chapter 1, I challenge the notion that Bayesian probability offers the best basis for a probabilistic theory of evidence. In Chapter 2, I criticise the conventional measures of quantities of evidence that use the degree of imprecision of imprecise probabilities. In Chapter 3, I develop an alternative to orthodox utility-maximizing decision theory using Kyburg’s system. In Chapter 4, I confront the orthodox notion that Nelson Goodman’s New Riddle of Induction makes purely formal theories of induction untenable. Finally, in Chapter 5, I defend probabilistic theories of inductive reasoning against John D. Norton’s recent collection of criticisms. My aim is the development of fresh perspectives on classic problems and contemporary debates. I both defend and exemplify a formal approach to the philosophy of science. I argue that Evidential Probability has great potential for clarifying our concepts of evidence and rationality