Operational Discord Measure for Gaussian States with Gaussian Measurements

We introduce an operational discord-type measure for quantifying nonclassical correlations in bipartite Gaussian states based on using Gaussian measurements. We refer to this measure as operational Gaussian discord (OGD). It is defined as the difference between the entropies of two conditional probability distributions associated to one subsystem, which are obtained by performing optimal local and joint Gaussian measurements. We demonstrate the operational significance of this measure in terms of a Gaussian quantum protocol for extracting maximal information about an encoded classical signal. As examples, we calculate OGD for several Gaussian states in the standard form.Comment: 18 pages, 3 figure

Sufficient Conditions for Efficient Classical Simulation of Quantum Optics

We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output. The first condition is based on the negativity of phase-space quasiprobability distributions (PQDs) of the output state of the process and the output measurements; the second one is based on the negativity of PQDs of the input states, the output measurements, and the transition function associated with the process. We show that these conditions provide useful practical tools for investigating the effects of imperfections in implementations of boson sampling. In particular, we apply our formalism to boson-sampling experiments that use single-photon or spontaneous-parametric-down-conversion sources and on-off photodetectors. Considering simple models for loss and noise, we show that above some threshold for the probability of random counts in the photodetectors, these boson-sampling experiments are classically simulatable. We identify mode mismatching as the major source of error contributing to random counts and suggest that this is the chief challenge for implementations of boson sampling of interesting size.Comment: 12 pages, 1 figur

What can quantum optics say about computational complexity theory?

Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational complexity theory point of view. We derive a general formula for calculating the output probabilities, and by considering input thermal states, we show that the output probabilities are proportional to permanents of positive-semidefinite Hermitian matrices. It is believed that approximating permanents of complex matrices in general is a #P-hard problem. However, we show that these permanents can be approximated with an algorithm in BPP^NP complexity class, as there exists an efficient classical algorithm for sampling from the output probability distribution. We further consider input squeezed-vacuum states and discuss the complexity of sampling from the probability distribution at the output.Comment: 5 pages, 1 figur

Verification of quantum discord

We introduce a measurement-based method for verifying quantum discord of any bipartite quantum system. We show that by performing an informationally complete POVM (IC-POVM) on one subsystem and checking the commutativity of the conditional states of the other subsystem, quantum discord from the second subsystem to the first can be verified. This is an improvement upon previous methods, which enables us to efficiently apply our method to continuous-variable systems, as IC-POVMs are readily available from homodyne or heterodyne measurements. We show that quantum discord for Gaussian states can be verified by checking whether the peaks of the conditional Wigner functions corresponding to two different outcomes of heterodyne measurement coincide at the same point in the phase space. Using this method, we also prove that the only Gaussian states with zero discord are product states; hence, Gaussian states with Gaussian discord have nonzero quantum discord.Comment: 5 page

Using Text Surrounding Method to Enhance Retrieval of Online Images by Google Search Engine

Purpose: the current research aimed to compare the effectiveness of various tags and codes for retrieving images from the Google. Design/methodology: selected images with different characteristics in a registered domain were carefully studied. The exception was that special conceptual features have been apportioned for each group of images separately. In this regard, each image group surrounding texts was dissimilar. Images were allocated with captionsincluding language in Farsi and English, alt text, image title, file name, free and controlled languages and appropriation text to images properties. Findings: allocating texts to images on a website causes Google to retrieve more images. Chi-square test for identification of significant differences among retrieved images in 5 Codes and revealed that in different codes, various numbers of images that were retrieved were significantly different. Caption allocation in English proved to have the best effect in retrieving images in the study sample, whereas file name had less effect in image retrieval ranking. Results of the Kruskal-Wallis test to assess the group differences in 5 codes revealed that differences were significant. Originality/Value: This paper tries to recall the importance of some elements which a search engine like Google may consider in indexing and retrieval of images. Widespread use of image tagging on the web enables Google and also other search engines to successfully retrieve images

Moments of nonclassicality quasiprobabilities

A method is introduced for the verification of nonclassicality in terms of moments of nonclassicality quasiprobability distributions. The latter are easily obtained from experimental data and will be denoted as nonclassicality moments. Their relation to normally-ordered moments is derived, which enables us to verify nonclassicality by using well established criteria. Alternatively, nonclassicality criteria are directly formulated in terms of nonclassicality moments. The latter converge in proper limits to the usually used criteria, as is illustrated for squeezing and sub-Poissonian photon statistics. Our theory also yields expectation values of any observable in terms of nonclassicality moments.Comment: 6 pages, 3 figure

Filter functions for the Glauber-Sudarshan PP-function regularization

The phase-space quasi-probability distribution formalism for representing quantum states provides practical tools for various applications in quantum optics such as identifying the nonclassicality of quantum states. We study filter functions that are introduced to regularize the Glauber-Sudarshan $P$ function. We show that the quantum map associated with a filter function is completely positive and trace preserving and hence physically realizable if and only if the Fourier transform of this function is a probability density distribution. We also derive a lower bound on the fidelity between the input and output states of a physical quantum filtering map. Therefore, based on these results, we show that any quantum state can be approximated, to arbitrary accuracy, by a quantum state with a regular Glauber-Sudarshan $P$ function. We propose applications of our results for estimating the output state of an unknown quantum process and estimating the outcome probabilities of quantum measurements.Comment: 10 page