Talks

Entangled (i.e., not separable) quantum states play fundamental roles in quantum information theory; therefore, it is important to know the ''size'' of entanglement (and hence separability) for various measures, such as, Hilbert-Schmidt measure, Bures measure, induced measure, and $\alpha$-measure. In this talk, I will present new comparison results of $\alpha$-measure with Bures measure and Hilbert-Schmidt measure. Employing these comparison results to the subsets of separable states and of states with positive partial transpose, we show that the probability of separability is very small, and the well-known Peres-Horodecki PPT Criterion as a tool to detect separability is imprecise for (even moderate) large dimension of Hilbert space. This talk is based on my papers: J. Math. Phys. 50 (2009) 083502, and J. Phys. A: Math. Theor. in press.

In this talk we will give an overview of how different probabilistic and quantum probabilistic techniques can be used to find Bell inequalities with large violation. This will include previous result on violation for tripartite systems and more recent results with Palazuelos on probabilities for bipartite systems. Quite surprisingly the latest results are the most elementary, but lead to some rather surprsing independence of entropy and large violation.

It is a fundamental, if elementary, observation that to obliterate the quantum information in n qubits by random unitaries, an amount of randomness of at least 2n bits is required. If the randomisation condition is relaxed to perform only approximately, we obtain two answers, depending on the norm used to compare the ideal and the approximation. Using the ''naive'' norm brings down the cost to n bits, while under the more appropriate complete norm it is still essentially 2n. After reviewing these facts and some constructions, we go on to explore the quantum information theoretical uses of the two notions of erasure. Most prominently, for a given quantum channel and its complementary channel, complete erasure is dual to correctability of the quantum noise; while approximate erasure is dual to the decodability of another task of quantum information, dubbed ''quantum identification''

Understanding NP-complete problems is a central topic in computer science. This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer. The efficiency of this approach is limited by small spectral gaps between the ground and excited states of the quantum computer's Hamiltonian. We show that the statistics of the gaps can be analyzed in a novel way, borrowed from the study of quantum disordered systems in statistical mechanics. It turns out that due to a phenomenon similar to Anderson localization, exponentially small gaps appear close to the end of the adiabatic algorithm for large random instances of NP-complete problems. We show that this effect makes adiabatic quantum optimization fail, as the system gets trapped in one of the numerous local minima. We will also discuss recent developments including the effect of the exponential number of solutions and Hamiltonian path change. Joint work with Boris Altshuler and Hari Krovi Based on arXiv:0908.2782 and arXiv:0912.0746

We introduce a class of probability spaces whose objects are infinite graphs and whose probability distributions are obtained as limits of distributions for finite graphs. The notions of Hausdorff and spectral dimension for such ensembles are defined and some results on their value in koncrete examples, such as random trees, will be described.

Using a formulation of the post-Newtonian expansion in terms of Feynman graphs, we discuss how various tests of General Relativity (GR) can be translated into measurement of the three- and four-graviton vertices. The timing of the Hulse-Taylor binary pulsar provides a bound on the deviation of the three-graviton vertex from the GR prediction at the 0.1% level. For coalescing binaries at interferometers, because of degeneracies with other parameters in the template such as mass and spin, the effects of modified three- and four-graviton vertices at the level of the restricted PN approximation, is to induce an error in the determination of these parameters and it is not possible to use coalescing binaries for constraining deviations of the vertices from the GR prediction.

While gravitational waves offer a new, and in many ways clean, view of compact objects, most of what we presently know about these has been obtained by careful study of their messy interactions with surrounding material. I will summarize what we know about a variety of potential gravitational wave sources, how this astrophysical hair has helped to illuminate some of the same questions gravitational wave observations promise to address, and how future observations may begin to relate the gravitational and electromagnetic properties of compact objects.

In addition to the dominant oscillatory modes gravitational waves contain non-oscillatory components which arise as drifts or offsets in the signals. Nonlinear gravitational memory arises from a change in mass multipole moments of a boundsystem due to contributions from the emitted gravitationalwaves. In practice it appears as a slowly monotonically growingsignal during the inspiral which sees a rapid rise at thetime of merger. The low amplitude and non-oscillatory natureof these signals present unique challenges for modeling.I discuss recent efforts to evaluate these signals in numericalsimulations using characteristic extraction as well as theirpotential relevance to detection.

We present a short overview on the current state of core-collapse supernova modeling and the set of processes expected to emit gravitational waves in a core collapse event. We go on to show new results from 3D GR simulations focusing on failing black-hole forming supernovae and present the gravitational wave signature of such events.