arXiv subjects

S. Rahimi-Keshari

Publications and source records attributed to S. Rahimi-Keshari.

3 recordsLinked to original sources

arXiv2017

Exact Boson Sampling using Gaussian continuous variable measurements

BosonSampling is a quantum mechanical task involving Fock basis state preparation and detection and evolution using only linear interactions. A classical algorithm for producing samples from this quantum task cannot be efficient unless the polynomial hierarchy of complexity classes collapses, a situation believe to be highly implausible. We present method for constructing a device which uses Fock state preparations, linear interactions and Gaussian continuous-variable measurements for which one can show exact sampling would be hard for a classical algorithm in the same way as Boson Sampling. The detection events used from this arrangement does not allow a similar conclusion for the classical hardness of approximate sampling to be drawn. We discuss the details of this result outlining some specific properties that approximate sampling hardness requires.

quant-ph↗

arXiv2014

Experimental Verification of Quantum Discord in Continuous-Variable States

We introduce a simple and efficient technique to verify quantum discord in unknown Gaussian states and a certain class of non-Gaussian states. We show that any separation in the peaks of the marginal distributions of one subsystem conditioned on two different outcomes of homodyne measurements performed on the other subsystem indicates correlation between the corresponding quadratures, and hence nonzero discord. We also apply this method to non-Gaussian states that are prepared by overlapping a statistical mixture of coherent and vacuum states on a beam splitter. We experimentally demonstrate this technique by verifying nonzero quantum discord in a bipartite Gaussian and certain class of non-Gaussian states.

quant-ph↗

arXiv2013

Boson Sampling from Gaussian States

We pose a generalized Boson Sampling problem. Strong evidence exists that such a problem becomes intractable on a classical computer as a function of the number of Bosons. We describe a quantum optical processor that can solve this problem efficiently based on Gaussian input states, a linear optical network and non-adaptive photon counting measurements. All the elements required to build such a processor currently exist. The demonstration of such a device would provide the first empirical evidence that quantum computers can indeed outperform classical computers and could lead to applications.

quant-ph↗