Quantum Information

Two-party Bell correlation inequalities (that is, inequalities involving only correlations between dichotomic observables at each site, such as the CHSH inequality) are well-understood: Grothendieck's inequality stipulates that the quantum bias can only be a constant factor larger than the classical bias, and the maximally entangled state is always the most nonlocal resource. In part due to the complex nature of multipartite entanglement, tripartite inequalities are much more unwieldy. In a recent breakthrough result, Perez-Garcia et. al. (quant-ph/0702189) showed using tools originating from the study of operator algebras that in this setting the quantum-classical violation could be arbitrarily large. Moreover, they showed that GHZ states could only lead to bounded violations, so that they were not the most non-local states. We extend and simplify their results in a number of ways: - We show that large families of states, including generalizations of GHZ states and stabilizer states, can only lead to bounded violations. - We prove bounds on the maximal quantum-classical violation as a function both of the local dimension (this was already shown in Perez-Garcia et. al., but we give a much simpler proof), and of the number of settings per site. - We provide a simple probabilistic construction of an inequality for which there is an unbounded quantum-classical gap. Our construction is simpler, and has better parameters, than the one in Perez-Garcia et.al. It is essentially optimal in terms of the local dimension of one of the parties, and off by a quadratic factor in terms of the number of settings. In this talk I will survey some of these results, focusing on the tools that have so far been useful for their analysis (and do not involve operator algebras!). Based on joint works with Jop Briet, Harry Buhrman, and Troy Lee. Some of this work is available at arXiv:0911.4007.

Many fundamental results in quantum foundations and quantum information theory can be framed in terms of information-theoretic tasks that are provably (im)possible in quantum mechanics but not in classical mechanics. For example, Bell's theorem, the no-cloning and no-broadcasting theorems, quantum key distribution and quantum teleportation can all naturally be described in this way. More generally, quantum cryptography, quantum communication and quantum computing all rely on intrinsically quantum information-theoretic advantages. Much less attention has been paid to the information-theoretic power of relativistic quantum theory, although it appears to describe nature better than quantum mechanics. This talk describes some simple information-theoretic tasks that distinguish relativistic quantum theory from quantum mechanics and relativistic classical physics, and a general framework for defining tasks that includes all previously known (im)possibility theorems and raises many open questions. This suggests a new way of thinking about relativistic quantum theory, and a possible new approach to defining non-trivial relativistic quantum theories rigorously. I also describe some simple and surprisingly powerful applications of these ideas to cryptography, including a new secure scheme for simultaneously committing to and encrypting a prediction and ways of securely "tagging" an inaccessible object so as to guarantee its position.

We review situations under which a standard quantum adiabatic condition fails. We reformulate the problem of adiabatic evolution as the problem of Hamiltonian eigenpath traversal, and give convergence conditions in terms of the length of the eigenpath and the minimum energy gap of the Hamiltonians. We introduce a randomized evolution method that can be used to traverse the eigenpath and prove its convergence and cost. We then describe more efficient methods for the same task and show that their implementation complexity is close to optimal.

For quantum fields with m=0, it is pointed out that timelike separated fields are quantized as independent subsystems. This allows us to ask the question of whether the field in the future region is entangled with the field in the past region of Minkowski space, in the Minkowski vacuum state. I will show that the answer is "yes," and then explore some consequences, including a thermal effect and a procedure for extracting the timelike entanglement with two inertial Unruh-DeWitt detectors.

It is well known that the ground state energy of many-particle Hamiltonians involving only 2- body interactions can be obtained using constrained optimizations over density matrices which arise from reducing an N-particle state. While determining which 2-particle density matrices are 'N-representable' is a computationally hard problem, all known extreme N-representable 2-particle reduced density matrices arise from a unique N-particle pre-image, satisfying a conjecture established in 1972. We present explicit counterexamples to this conjecture through giving Hamiltonians with 2-body interactions which have degenerate ground states that cannot be distinguished by any 2-body operator. We relate the existence of such counterexamples to quantum error correction codes and topologically ordered spin systems.

Quantum key distribution (QKD) is an application of quantum theory as its security relies on quantum foundations, at the same time there is development in the information-theoretic point of view to quantum theory. The security is related to impossible quantum performance, for instance, neither perfect quantum cloning nor perfect quantum state discrimination are possible. In this talk, I would like to discuss issues relevant to practical and fundamental sides of QKD: i) toward characterization of quantum correlations from which a secret key can be distilled, ii) determination whether quantum states shared by two honest parties in distance are entangled or separable, and iii) limitations on quantum performance by fundamental principles in quantum theory.

Quantum Mechanics has been shown to provide a rigorous foundation for Statistical Mechanics. Concentration of measure, or typicality, is the main tool to construct a purely quantum derivation for the methods of Statistical Mechanics. From this point of view statistical ensembles are effective description for isolated quantum systems, since typically a random pure state of the system will have properties similar to those of the ensemble. Nevertheless, it is often argued that most of the states of the Hilbert space are not relevant for realistic systems. This talk will address this issue, presenting recent results on the emergence of typicality in the context of matrix product states, a set of physically and computationally relevant states associated to many-body Hamiltonians.

We find analytic models that can perfectly transfer, without state initialization or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. This provides for the possible experimental implementation of state transfer through bosonic or fermionic atoms trapped in optical lattices. A significant finding is that the state of a spin qubit can be perfectly transferred through a fermionic system. Families of Hamiltonians are described that are related to the linear models and that enable the perfect transfer of arbitrary functions. Furthermore, we propose methods for eliminating certain types of errors

Topological order is a new kind of collective order which appears in two-dimensional quantum systems such as the fractional quantum Hall effect and brings about rather unusual particles: unlike bosons or fermions these anyons obey exotic statistics and can be exploited to perform quantum computation. Topological order also implies that quantum states at low energies exhibit a very subtle, yet intricate inner structure. Remarkably, both phenomena can be studied in relatively simple spin systems (like Kitaev's quantum double models and the ubiquitous toric code) which in fact capture the essential properties of entire topological phases of matter in many important cases. What is the relationship between these topological phases? Reviewing recent work I will explain how they arrange themselves in a landscape of dualities and hierarchies. In particular, I will focus on two aspects: first, a duality between electric and magnetic quasiparticles in generalized quantum double models and second, a hierarchy construction of quantum states which are related by the condensation of topological charges.

Quantum error correcting codes and topological quantum order (TQO) are inter-connected fields that study non-local correlations in highly entangled many-body quantum states. In this talk I will argue that each of these fields offers valuable techniques for solving problems posed in the other one. First, we will discuss the zero-temperature stability of TQO and derive simple conditions that guarantee stability of the spectral gap and the ground state degeneracy under generic local perturbations. These conditions thus can be regarded as a rigorous definition of TQO. Our results apply to any quantum spin Hamiltonian that can be written as a sum of geometrically local commuting projectors on a D-dimensional lattice. This large class of Hamiltonians includes Levin-Wen string-net models and Kitaev's quantum double models. Secondly, we derive upper bounds on the parameters of quantum codes with local check operators and discuss the implications for feasibility of a quantum self-correcting memory.

The counter-intuitive phenomena in quantum mechanics are often based on the counter-factual (or virtual) processes. The famous example is the Hardy paradox, which has been recently solved in two independent experiments. Also, the delayed choice experiment and one of quantum descriptions of the closed time like curves can be also examples of the counter-intuitive phenomena. The counter-factual processes can be characterized by the weak value initiated by Yakir Aharonov and his colleagues. In this talk, I will introduce the weak value from the probability theory and the connection to the counter-factual processes in these examples.

I'll describe a connection between uncertainty relations, information locking and low-distortion embeddings of L2 into L1. Exploiting this connection leads to the first explicit construction of entropic uncertainty relations for a number of measurements that is polylogarithmic in the dimension d while achieving an average measurement entropy of (1-e) log d for arbitrarily small e. From there, it is straightforward to obtain the first strong information locking scheme that is efficiently computable using a quantum computer. This locking scheme can be interpreted as a method for encrypting classical messages using a key of size much smaller than the message length. Other applications include efficient encodings for amortized quantum identification over classical channels and new string commitment protocols.