This thesis investigates three distinct facets of the theory of quantum information. The first two, quantum state estimation and quantum process estimation, are closely related and deal with the question of how to estimate the classical parameters in a quantum mechanical model. The third attempts to bring quantum theory as close as possible to classical theory through the formalism of quasi-probability. \n \nBuilding a large scale quantum information processor is a significant challenge. First, we require an accurate characterization of the dynamics experienced by the device to allow for the application of error correcting codes and other tools for implementing useful quantum algorithms. The necessary scaling of computational resources needed to characterize a quantum system as a function of the number of subsystems is by now a well studied problem (the scaling is generally exponential). However, irrespective of the computational resources necessary to just write-down a classical description of a quantum state, we can ask about the experimental resources necessary to obtain data (measurement complexity) and the computational resources necessary to generate such a characterization (estimation complexity). These problems are studied here and approached from two directions. \n \nThe first problem we address is that of quantum state estimation. We apply high-level decision theoretic principles (applied in classical problems such as, for example, universal data compression) to the estimation of a qubit state. We prove that quantum states are more difficult to estimate than their classical counterparts by finding optimal estimation strategies. These strategies, requiring the solution to a difficult optimization problem, are difficult to implement in practise. Fortunately, we find estimation algorithms which come close to optimal but require far fewer resources to compute. Finally, we provide a classical analog of this quantum mechanical problem which reproduces, and gives intuitive explanations for, many of its features, such as why adaptive tomography can quadratically reduce its difficulty. \n \nThe second method for practical characterization of quantum devices takes is applied to the problem of quantum process estimation. This differs from the above analysis in two ways: (1) we apply strong restrictions on knowledge of various estimation and control parameters (the former making the problem easier, the latter making it harder); and (2) we consider the problem of designing future experiments based on the outcomes of past experiments. We show in test cases that adaptive protocols can exponentially outperform their off-line counterparts. Moreover, we adapt machine learning algorithms to the problem which bring these experimental design methodologies to realm of experimental feasibility. \n \nIn the final chapter we move away from estimation problems to show formally that a classical representation of quantum theory is not tenable. This intuitive conclusion is formally borne out through the connection to quasi-probability -- where it is equivalent to the necessity of negative probability in all such representations of quantum theory. In particular, we generalize previous no-go theorems to arbitrary classical representations of quantum systems of arbitrary dimension. We also discuss recent progress in the program to identify quantum resources for subtheories of quantum theory and operational restrictions motivated by quantum computation.
This thesis investigates three distinct facets of the theory of quantum information. The first two, quantum state estimation and quantum process estimation, are closely related and deal with the question of how to estimate the classical parameters in a quantum mechanical model. The third attempts to bring quantum theory as close as possible to classical theory through the formalism of quasi-probability. \n \nBuilding a large scale quantum information processor is a significant challenge. First, we require an accurate characterization of the dynamics experienced by the device to allow for the application of error correcting codes and other tools for implementing useful quantum algorithms. The necessary scaling of computational resources needed to characterize a quantum system as a function of the number of subsystems is by now a well studied problem (the scaling is generally exponential). However, irrespective of the computational resources necessary to just write-down a classical description of a quantum state, we can ask about the experimental resources necessary to obtain data (measurement complexity) and the computational resources necessary to generate such a characterization (estimation complexity). These problems are studied here and approached from two directions. \n \nThe first problem we address is that of quantum state estimation. We apply high-level decision theoretic principles (applied in classical problems such as, for example, universal data compression) to the estimation of a qubit state. We prove that quantum states are more difficult to estimate than their classical counterparts by finding optimal estimation strategies. These strategies, requiring the solution to a difficult optimization problem, are difficult to implement in practise. Fortunately, we find estimation algorithms which come close to optimal but require far fewer resources to compute. Finally, we provide a classical analog of this quantum mechanical problem which reproduces, and gives intuitive explanations for, many of its features, such as why adaptive tomography can quadratically reduce its difficulty. \n \nThe second method for practical characterization of quantum devices takes is applied to the problem of quantum process estimation. This differs from the above analysis in two ways: (1) we apply strong restrictions on knowledge of various estimation and control parameters (the former making the problem easier, the latter making it harder); and (2) we consider the problem of designing future experiments based on the outcomes of past experiments. We show in test cases that adaptive protocols can exponentially outperform their off-line counterparts. Moreover, we adapt machine learning algorithms to the problem which bring these experimental design methodologies to realm of experimental feasibility. \n \nIn the final chapter we move away from estimation problems to show formally that a classical representation of quantum theory is not tenable. This intuitive conclusion is formally borne out through the connection to quasi-probability -- where it is equivalent to the necessity of negative probability in all such representations of quantum theory. In particular, we generalize previous no-go theorems to arbitrary classical representations of quantum systems of arbitrary dimension. We also discuss recent progress in the program to identify quantum resources for subtheories of quantum theory and operational restrictions motivated by quantum computation.
Quantum computing exists at the intersection of mathematics, physics, chemistry, and engineering; the main goal of quantum computing is the creation of devices and algorithms which use the properties of quantum mechanics to store, manipulate and measure information. There exist many families of algorithms, which, using non-classical logical operations, can outperform traditional, classical algorithms in terms of memory and processing requirements. In addition, quantum computing devices are fundamentally smaller than classical processors and memory elements; since the physical models governing their performance are applicable on all scales, as opposed to classical logic elements, whose underlying principles rely on the macroscopic nature of the device in question. \n \nQuantum algorithms, for the most part, are predicated on a theory of resources. It is often assumed that quantum computers can be placed in a precise fiducial state prior to computation, and that logical operations are perfect, inducing no error on the system which they affect. These assumptions greatly simplify algorithmic design, but are fundamentally unrealistic. In order to justify their use, it is necessary to develop a framework for using a large number of imperfect devices to simulate the action of a perfect device, with some acceptable probability of failure. This is the study of fault-tolerant quantum computing. In order to pursue this study effectively, it is necessary to understand the fundamental nature of generic quantum states and operations, as well as the means by which one can correct quantum errors. Additionally, it is important to attempt to minimize the use of computational resources in achieving error reduction and fault-tolerant computing. \n \nThis thesis is concerned with three projects related to the use of error-prone quantum systems to transmit and manipulate information. The first of these is concerned with the use of imperfectly-prepared states in error-correction routines. Using optimal quantum error correction, we are able to deduce a method of partially protecting encoded quantum information against preparation errors prior to encoding, using no additional qubits. The second of these projects details the search for entangled states which can be used to transmit classical information over quantum channels at a rate superior to classical states. The third of these projects concerns the transcoding of data from one quantum code into another using few ancillary resources. The descriptions of these projects are preceded by a brief introduction to representations of quantum states and channels, for completeness. \n \nThree techniques of general interest are presented in appendices. The first is an introduction to, and a minor advance in the development of optimal error correction codes. The second is a more efficient means of calculating the action of a quantum channel on a given state, given that the channel acts non-trivially only on a subsystem, rather than the entire system. Finally, we include documentation on a software package developed to aid the search for quantum transcoding operations.
Quantum states and measurements are two central physical objects in the theory of quantum mechanics. The preparation, control and measurement of quantum states lies at the heart of modern quantum information processing protocols ranging from secure communication to quantum computation and precision sensing. And yet, the reliable operation of these advanced protocols ultimately rests on a far more essential prerequisite - our ability to calibrate, certify and benchmark the quantum states we prepare and the quantum measurements we perform. Quantum information theory provides a natural framework for these tasks, meaningfully connecting the resources we expend for characterisation with the accuracy and precision we can expect in return. While decades of advances in quantum information have refined our understanding of quantum characterisation and sharpened our practical ability to calibrate with enhanced precision, important questions about the fundamental limits of quantum characterisation remain unanswered. Although incorporating entanglement at the measurement stage is known to enhance the estimation of unknown quantum states, the extent of this improvement remains poorly understood. This leaves open a fundamental question on the utility of complex entangling measurement strategies, impeding progress towards bridging the significant gap between practically achievable precision and the ultimate theoretical quantum limit. Complementary to quantum state estimation, which is relatively well-established in theory and practice, the characterisation of quantum measurements lacks a rigorous information-theoretic foundation, leading to a dearth of principled benchmarks and provably optimal strategies despite growing experimental interest. This thesis develops and applies information-theoretic tools to answer questions in quantum characterisation, with an eye to enabling practical improvements beyond current techniques in the field. First, we introduce a computable measure of entanglement enhancement for quantum state estimation and study its variation across general multi-parameter estimation problems for higher-dimensional quantum states. We show that the entanglement enhancement is maximised for full qudit state tomography but grows only linearly with system dimension even when allowing an asymptotically large number of entangling operations. Our proposed tight upper bound to entanglement enhancement therefore constitutes a strong limitation on the utility of such entangling measurements. Next, we formulate the dual problem of quantum detector estimation, developing a comprehensive framework for maximally precise calibration centred around a newly introduced quantity - the detector quantum Fisher information. This information-theoretic measure stipulates the ultimate precision attainable for measurement calibration and identifies the optimal input states that achieve this precision. Further, our framework enables the first provably optimal detector estimation experiment and reveals the scope for entanglement-based enhancements, thereby placing measurement characterisation on equal footing with state characterisation. Considered together, these results suggest two contrasting conclusions about quantum characterisation. On the one hand, they show that for quantum state estimation, increasingly powerful entangling measurements offer only diminishing returns at the ultimate precision limit. On the other hand, they highlight practical quantum advantages available for detector estimation by providing a framework that can improve calibration performance and guide future experimental design. More broadly, these results complete and advance the triad of state, process, and detector characterisation, positioning quantum information measures as not merely abstract bounds, but practical guides for deciding when complex quantum resources are genuinely worth deploying and where near-term quantum advantages are most likely to be realised.
Recent developments in the mathematical foundations of quantum mechanics have brought the theory closer to that of classical probability and statistics. On the other hand, the unique character of quantum physics sets many of the questions addressed apart from those met classically in stochastics. Furthermore, concurrent advances in experimental techniques and in the theory of quantum computation have led to a strong interest in questions of quantum information, in particular in the sense of the amount of information about unknown parameters in given observational data or accessible through various possible types of measurements. This scenery is outlined (with an audience of statisticians and probabilists in mind).
The rapid advance of quantum information technology requires precise control and manipulation of quantum systems and of their properties; in particular, it is essential to certify that quantum processors truly work quantum mechanically, in order to validate experiments and their results. The problem of certification of quantum states and devices is a demanding one, thus many attempts have been put forward to find ways of efficiently test their basic functionalities, such as their entanglement properties. The main problems addressed in this thesis concern indeed finding optimal strategies for the estimation and characterization of quantum states and channels, with a special focus on entanglement correlations. In our first work we considered the certification of entanglement across a given partition of a multi-qubit system, when only partial information about the corresponding quantum state is available; we tackled the problem of finding the best measurement strategy introducing the statistics of lengths of measurement sequences, choosing multi-qubit Pauli-measurements as observables. Using a sample of random unknown states, we were able to identify the (on average) shortest, i.e. most efficient, measurement sequence to detect entanglement. The investigation was carried out with an algorithm based on the truncated moment sequences (tms) problem, which provides necessary and sufficient conditions for entanglement or separability of a quantum state of a finite dimensional system. This study results in a very efficient strategy especially for symmetric states, for which only a tiny fraction (10−6) of randomly chosen entangled states are undetected for systems with 6 qubits or more. We continued in our second work with the problem of separability of quantum channels to answer the question whether a given quantum device is able to create entanglement or not. The Choi matrix representation, provided by the Choi–Jamiołkowski isomorphism, casts the problem in terms of systems and ancillas, giving different classes of separability depending on the cut considered between them. Once again, the tms framework turned out to be well suited for this study, giving a unifying approach for the different separability problems; a solution is found in terms of the tms associated to the coordinates of the Choi state, in a fixed basis, and semidefinite programming is used to get a separability certificate. We explored examples of families of 2-qubit and single-qutrit channels, for which our algorithm can give an answer in cases where other criteria remain inconclusive. In a further work we shifted our attention to a different direction, highlighting a connection between the fields of quantum information, Bose-Einstein condensation (BEC) and analogue gravity, thus showing the relevance of quantum information notions in a broader context. We studied the entanglement properties of a BEC analogue of a black hole, which is described by a three-mode Gaussian state; we investigated bipartite and tripartite entanglement measures based on the covariance matrix description, both at zero and finite temperature, providing the best experimental configuration for entanglement detection. In a final stage of this thesis, we started looking at different measurement strategies for testing quantum devices whose functionality can be described by a single parameter; we used a Bayesian approach to estimate this parameter, exploiting the information collected through measurements to update a conditional probability distribution, without the need of estimating expected values of observables. The problem of finding the optimal experimental design can be in this case translated in the optimization of a utility function, which usually guides the update process adaptively at each step; we tried to outperform this approach looking ahead not only at the next step, but at a few ones, in order to obtain an answer of correct or wrong functioning as soon as possible. Moreover, we chose the input state for the quantum channel considered minimizing the error probability given by the Chernoff distance between the outputs of an ideal and a faulty channel; finally, we considered two different final decision criteria and compared their efficiency.
We introduce a fast and accurate heuristic for adaptive tomography that addresses many of the limitations of prior methods.Previous approaches were either too computationally intensive or tailored to handle special cases such as single qubits or pure states.By contrast, our approach combines the efficiency of online optimization with generally applicable and well-motivated data-processing techniques.We numerically demonstrate these advantages in several scenarios including mixed states, higher-dimensional systems, and restricted measurements.Quantum information processing (QIP) promises advantages in a wide range of different contexts, including machine learning [2-4], chemistry simulation [5][6][7], and number theory [8,9].As such, the experimental effort to build useful QIP devices has exploded in recent years.In the course of this effort, quantum tomography is a valuable tool for diagnosing and debugging small quantum devices, and has subsequently seen a variety of different advances.In particular, Bayesian approaches to tomography which are especially well suited to utilizing prior information and adapting to changing experimental conditions have developed significantly in recent years [10-13], presenting a useful experimental tool [14][15][16].In this paper we demonstrate the efficiency and accuracy of an adaptive tomography protocol that we call PAQT: practical adaptive quantum tomography.PAQT intelligently selects new measurements based on the outcomes of previous ones [10,[17][18][19][20][21].Adaptivity has been experimentally demonstrated [14,15,[22][23][24][25], but is not currently standard practice.Though adaptivity increases accuracy, the computational costs incurred outweigh that of simply repeating standard measurements many times.The PAQT approach employs a simple heuristic that can be efficiently computed between measurements, even with embedded hardware [26][27][28][29].The algorithm we propose is therefore compatible with modern experimental design and avoids an important limitation of previous approaches.We base our algorithm off of self-guided quantum tomography (SGQT), which treats adaptive tomography as a direct optimization problem rather than a new optimization problem between each measurement [30].Though this affords an efficient and easy to implement adaptive heuristic, SGQT is not without its limitations.It requires assuming that the target state is pure, and it does not return rich region estimates for a state.What PAQT achieves is to effectively combine SGQT with conventional and easily-implemented tomographic estimators, such as the Bayesian particle filter or least-squares fit (LSF) estimators.Under this approach, an experimentalist can collect data using SGQT (even if its assumptions are not met), and then post-process this data using particle filtering or LSF.The benefit of PAQT is two-fold.(1) From the point of view of traditional tomography, it gives an adaptive tomography protocol requiring only modest computational resources, as the bulk of the computational cost is offloaded to post-processing.(2) From the point of view of simulation-based optimization tomography (such as SGQT), it effectively augments the output with region estimation providing a statistically robust quantification of uncertainty.Thus, while we do not explicitly demonstrate that the improved scaling of Ferrie [30] remains in the more general case considered here, PAQT does provide a practical and efficient procedure for performing adaptive quantum tomography with rigorous statistical principles.
Quantum mechanics is basically a mathematical recipe on how to construct physical models. Historically its origin and main domain of application has been in the microscopic regime, although it strictly seen constitutes a general mathematical framework not limited to this regime. Since it is a statistical theory, the meaning and role of probabilities in it need to be defined and understood in order to gain an understanding of the predictions and validity of quantum mechanics. The interpretational problems of quantum mechanics are also connected with the interpretation of the concept of probability. In this thesis the use of probability theory as extended logic, in particular in the way it was presented by E. T. Jaynes, will be central. With this interpretation of probabilities they become a subjective notion, always dependent on one's state of knowledge or the context in which they are assigned, which has consequences on how things are to be viewed, understood and tackled in quantum mechanics. For instance, the statistical operator or density operator, is usually defined in terms of probabilities and therefore also needs to be updated when the probabilities are updated by acquisition of additional data. Furthermore, it is a context dependent notion, meaning, e.g., that two observers will in general assign different statistical operators to the same phenomenon, which is demonstrated in the papers of the thesis. It is also presented an alternative and conceptually clear approach to the problematic notion of "probabilities of probabilities", which is related to such things as probability distributions on statistical operators. In connection to this, we consider concrete numerical applications of Bayesian quantum state assignment methods to a three-level quantum system, where prior knowledge and various kinds of measurement data are encoded into a statistical operator, which can then be used for deriving probabilities of other measurements. The thesis also offers examples of an alternative quantum state assignment technique, using maximum entropy methods, which in some cases are compared with the Bayesian quantum state assignment methods. Finally, the interesting and important problem whether the statistical operator, or more generally quantum mechanics, gives a complete description of "objective physical reality" is considered. A related concern is here the possibility of finding a "local hidden-variable theory" underlying the quantum mechanical description. There have been attempts to prove that such a theory cannot be constructed, where the most well-known impossibility proof claiming to show this was given by J. S. Bell. In connection to this, the thesis presents an idea for an interpretation or alternative approach to quantum mechanics based on the concept of space-time.