There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.

A scheme for efficient quantum computation with linear optics.

We consider the problem of discriminating two different quantum states in the setting of asymptotically many copies, and determine the minimal probability of error. This leads to the identification of the quantum Chernoff bound, thereby solving a long-standing open problem. The bound reduces to the classical Chernoff bound when the quantum states under consideration commute. The quantum Chernoff bound is the natural symmetric distance measure between quantum states because of its clear operational meaning and because it does not seem to share some of the undesirable features of other distance measures.

/pdf/discriminating-states-the-quantum-chernoff-bound-17k4iyqylm.pdf

Discriminating States: the quantum Chernoff bound.

In this paper we investigate the possibility of making complete Bell measurements on a product Hilbert space of two two-level bosonic systems. We restrict our tools to linear elements, such as beam splitters and phase shifters, delay lines and electronically switched linear elements, photodetectors, and auxiliary bosons. As a result we show that with these tools a never failing Bell measurement is impossible.

https://arxiv.org/pdf/quant-ph/9809063.pdf

Bell measurements for teleportation

We propose the entanglement potential (EP) as a measure of nonclassicality for quantum states of a single-mode electromagnetic field. It is the amount of two-mode entanglement that can be generated from the field using linear optics, auxiliary classical states, and ideal photodetectors. The EP detects nonclassicality, has a direct physical interpretation, and can be computed efficiently. These three properties together make it stand out from previously proposed nonclassicality measures. We derive closed expressions for the EP of important classes of states and analyze as an example of the degradation of nonclassicality in lossy channels.

https://arxiv.org/pdf/quant-ph/0411164.pdf

Computable measure of nonclassicality for light.

In a photonic realization of qubits the implementation of quantum logic is rather difficult due to the extremely weak interaction on the few photon level. On the other hand, in these systems interference is available to process the quantum states. We formalize the use of interference by the definition of a simple class of operations which include linear-optical elements, auxiliary states and conditional operations. We investigate an important subclass of these tools, namely linear-optical elements and auxiliary modes in the vacuum state. For these tools, we are able to extend a previous qualitative result, a no-go theorem for perfect Bell-state analyzer on two qubits in polarization entanglement, by a quantitative statement. We show that within this subclass it is not possible to discriminate unambiguously four equiprobable Bell states with a probability higher than 50%.

Maximum efficiency of a linear-optical Bell-state analyzer

We devise a protocol in which general nonclassical multipartite correlations produce a physically relevant effect, leading to the creation of bipartite entanglement. In particular, we show that the relative entropy of quantumness, which measures all nonclassical correlations among subsystems of a quantum system, is equivalent to and can be operationally interpreted as the minimum distillable entanglement generated between the system and local ancillae in our protocol. We emphasize the key role of state mixedness in maximizing nonclassicality: Mixed entangled states can be arbitrarily more nonclassical than separable and pure entangled states.

John Calsamiglia

Papers

Discriminating States: the quantum Chernoff bound.

Bell measurements for teleportation

Computable measure of nonclassicality for light.

Maximum efficiency of a linear-optical Bell-state analyzer

All nonclassical correlations can be activated into distillable entanglement.