Quantum Information

Entanglement is one of the most studied features of quantum mechanics and in particular quantum information. Yet its role in quantum information is still not clearly understood. Results such as (R. Josza and N. Linden, Proc. Roy. Soc. Lond. A 459, 2011 (2003)) show that entanglement is necessary, but stabilizer states and the Gottesman-Knill theorem (for example) imply that it is far from sufficient. I will discuss three aspects of entanglement. First, a quantum circuit with a "vanishingly small" amount of entanglement that admits an apparent exponential speed-up over the classical case. Second, I will discuss techniques for lower-bounding the amount of entanglement in bipartite quantum states. Finally, I will discuss the role of entanglement in quantum metrology. Specifically, I will show that entangling ancillas can make no difference to the accuracy of a quantum parameter estimation, regardless of the nature of the coupling Hamiltonian. I will conclude by discussing strategies for improving the scaling of quantum parameter estimation.

Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, I'll show that "for most practical purposes" one can learn a quantum state using a number of measurements that grows only linearly with n. I'll discuss applications of this result in experimental physics and quantum computing theory, as well as possible implications for the foundations of quantum mechanics. quant-ph/0608142

In this talk I will present several new results from joint work with Dmitry Gavinsky, Oded Regev and Ronald de Wolf, relating to the model of one-way communication and the simultaneous model of communication. I will describe several separations between various resources (entanglement versus event coin, quantum communication versus classical communication), showing in particular that quantum communication cannot simulate a public coin and that entanglement can be much more powerful than a public coin, even if communication is quantum. I will also present a characterization of the quantum fingerprinting technique.

How should we think about quantum computing? The usual answer to this question is based on ideas inspired by computer science, such as qubits, quantum gates, and quantum circuits. In this talk I will explain an alternate geometric approach to quantum computation. In the geometric approach, an optimal quantum computation corresponds to "free falling" along the minimal geodesics of a certain Riemannian manifold. This reformulation opens up the possibility of using tools from geometry to understand the strengths and weaknesses of quantum computation, and perhaps to understand what makes certain physical operations difficult (or easy) to synthesize.

In order to predict the future state of a quantum system, we generally do not need to know the past state of the entire universe, but only the state of a finite neighborhood of the system. This locality is best expressed as a restriction on how information "flows" between systems. In this talk I will describe some recent work, inspired by quantum cellular automata, about the information strucutre of local quantum dynamics. Issues to be discussed include the definition of "locality", some characterization theorems, connections between classical and quantum locality for reversible maps, the relation between local and global dynamics, and the dissection of CNOT.

In this talk, I will outline a quantum generalization of causal networks that are used to analyze complex probabilistic inference problems involving large numbers of correlated random variables. I will review the framework of classical causal networks and the graph theoretical constructions that are abstracted from them, including entailed conditional independence, d-separation and Markov equivalence. I will show how to generalize the definition of causal networks to the quantum case, such that the same graph theoretic constructions apply, and give an explicit representation of the states supported on the graph as the Gibbs states of certain classes of Hamiltonians.

Adiabatic Quantum Computation is not only a possibly more robust alternative to standard quantum computation. Since it considers a continuous-time evolution of the system, it also provides a natural bridge towards studying the dynamics of interacting many-particle quantum systems, quantum phase transitions and other issues in fundamental physics. After a brief review of adiabatic quantum computation, I will show our recent results on the dynamics of entanglement and fidelity for the search and Deutsch algorithms including several variations and optimization. I will show how these studies led to suggesting an alternative definition of entanglement and compare the results, and discuss possible implications for considering entanglement a resource. I will conclude with an outlook on further applications and extensions of adiabatic quantum computation.

This talk is concerned with the noise-insensitive transmission of quantum information. For this purpose, the sender incorporates redundancy by mapping a given initial quantum state to a messenger state on a larger-dimensional Hilbert space. This encoding scheme allows the receiver to recover part of the initial information if the messenger system is corrupted by interaction with its environment. Our noise model for the transmission leaves a part of the quantum information unchanged, that is, we assume the presence of a noiseless subsystem or of a decoherence-free subspace. We address the case when the noiseless component cannot contain all the quantum information to be transmitted, and investigate how to best spread the information in a quantum state across the noise-susceptible components. (Joint work with David Kribs and Vern Paulsen.)

We will look at the axioms of quantum mechanics as expressed, for example, in the book by M. A. Nielsen and I. L. Chung ("Quantum Computation and Quantum Information"). We then take a critical look at these axioms, raising several questions as we go. In particular, we will look at the possible informational completeness property of the family of operators that we measure. We will propose physical solutions based on the results of quantum mechanics on phase space and the measurement of quantum particles by quantum mechanical means. We illustrate this with both momentum-position measurements and spin measurements.

Inspired by the notion that the differences between quantum theory and classical physics are best expressed in terms of information theory, Hardy (2001) and Clifton, Bub, and Halvorson (2003) have constructed frameworks general enough to embrace both quantum and classical physics, within which one can invoke principles that distinguish the classical from the quantum. Independently of any view that quantum theory is essentially about quantum information, such frameworks provide a useful tool for exploring the differences between classical and quantum physics, and the relations between the various properties of quantum mechanics that distinguish it from the classical. In particular, we can ask: on which features of quantum physics do our familiar possibility/impossibility theorems depend? It turns out that it is possible to extend the no-cloning theorem and other results, such as the Holevo bound on acquisition of information by a single measurement, beyond the quantum setting.

Entanglement entropy is currently of interest in several areas in physics, such as condensed matter, field theory, and quantum information. One of the most interesting properties of the entanglement entropy is its scaling behavior, especially close to phase transitions. It was believed that for dimensions higher than 1 the entropy scales like surface area of the subsystem. We will describe a recent result for free fermions at zero temperature, where the entropy in fact scales faster. The latter problem will be related to a mathematical conjecture due to H. Widom (1982). This is a joint work with I. Klich.