Quantum Physics

If a large quantum computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a conventional computer? In this talk, I argue that a QC could solve some relevant physical "questions" more efficiently. First, I will focus on the quantum simulation of quantum systems satisfying different particle statistics (e.g., anyons), using a QC made of two-level physical systems or qubits. The existence of one-to-one mappings between different algebras of observables or between different Hilbert spaces allow us to represent and imitate any physical system by any other one (e.g., a bosonic system by a spin-1/2 system). We explain how these mappings can be performed showing quantum networks useful for the efficient evaluation of some physical properties, such as correlation functions and energy spectra. Second, I will focus on the quantum simulation of classical systems. Interestingly, the thermodynamic properties of any d-dimensional classical system can be obtained by studying the zero-temperature properties of an associated d-dimensional quantum system. This classical-quantum correspondence allows us to understand classical annealing procedures as slow (adiabatic) evolutions of the lowest-energy state of the corresponding quantum system. Since many of these problems are NP-hard and therefore difficult to solve, is worth investigating if a QC would be a better device to find the corresponding solutions.

The mathematical formalism of quantum theory has many features whose physical origin remains obscure. In this paper, we attempt to systematically investigate the possibility that the concept of information may play a key role in understanding some of these features. We formulate a set of assumptions, based on generalizations of experimental facts that are representative of quantum phenomena and physically comprehensible theoretical ideas and principles, and show that it is possible to deduce the finite-dimensional quantum formalism from these assumptions. The concept of information, via an information-theoretic invariance principle, plays a central role in the derivation, and gives rise to some of the central structural features of the quantum formalism.

A multi-partite entanglement measure is constructed via the distance or angle of the pure state to its nearest unentangled state. The extention to mixed states is made via the convex-hull construction, as is done in the case of entanglement of formation. This geometric measure is shown to be a monotone. It can be calculated for various states, including arbitrary two-qubit states, generalized Werner and isotropic states in bi-partite systems. It is also calculated for various multi-partite pure and mixed states, including ground states of some physical models and states generated from quantum alogrithms, such as Grover's. A specific application to a spin model with quantum phase transistions will be presented in detail.The connection of the geometric measure to other entanglement properties will also be discussed.

If spacetime is "quantized" (discrete), then any equation of motion compatible with the Lorentz transformations is necessarily non-local. I will present evidence that this sort of nonlocality survives on length scales much greater than Planckian, yielding for example a nonlocal effective wave-equation for a scalar field propagating on an underlying causal set. Nonlocality of our effective field theories may thus provide a characteristic signature of quantum gravity.

Kolmogorov complexity is a measure of the information contained in a binary string. We investigate the notion of quantum Kolmogorov complexity, a measure of the information required to describe a quantum state. We show that for any definition of quantum Kolmogorov complexity measuring the number of classical bits required to describe a pure quantum state, there exists a pure n-qubit state which requires exponentially many bits of description. This is shown by relating the classical communication complexity to the quantum Kolmogorov complexity. Furthermore we give some examples of how quantum Kolmogorov complexity can be applied to prove results in different fields, such as quantum computation and communication.

Inferring a quantum system\'s state, from repeated measurements, is critical for verifying theories and designing quantum hardware. It\'s also surprisingly easy to do wrong, as illustrated by maximum likelihood estimation (MLE), the current state of the art. I\'ll explain why MLE yields unreliable and rank-deficient estimates, why you shouldn\'t be a quantum frequentist, and why we need a different approach. I\'ll show how operational divergences -- well-motivated metrics designed to evaluate estimates -- follow from quantum strictly proper scoring rules. This motivates Bayesian Mean Estimation (BME), and I\'ll show how it fixes most of the problems with MLE. I\'ll conclude with a couple of speculations about the future of quantum state and process estimatio

In stochastic treatments of the ERRB set-up, it is equivalent to impose Bell\'s inequalities, a local causality condition, or a certain \"non-contextual hidden variables\" condition. But these conditions are violated by quantum mechanics. On the other hand, it is possible to view quantum mechanics as part of \"quantum measure theory\", a generalization of probability measure theory that allows pair wise interferences between histories whilst banning higher order interference. In this setting, is may be possible find quantum analogues of the three stochastic conditions. Following this line of inquiry, we will see that quantum measure theory allows no stronger violations of Bell\'s inequalities than does standard quantum theory. We also gain some insights into how to define causality in quantum theory.

Quantum information theory has two equivalent mathematical conjectures concerning quantum channels, which are also equivalent to other important conjectures concerning the entanglement. In this talk I explain these conjectures and introduce recent results.