Saleh Rahimi-Keshari

Photonic Boson Sampling in a Tunable Circuit

Computing Power of Quantum Mechanics There is much interest in developing quantum computers in order to perform certain tasks much faster than, or that are intractable for, a classical computer. A general quantum computer, however, requires the fabrication and operation a number of quantum logic devices (see the Perspective by Franson). Broome et al. (p. 794, published online 20 December) and Spring et al. (p. 798, published online 20 December) describe experiments in which single photons and quantum interference were used to perform a calculation (the permanent of a matrix) that is very difficult on a classical computer. Similar to random walks, quantum walks on a graph describe the movement of a walker on a set of predetermined paths; instead of flipping a coin to decide which way to go at each point, a quantum walker can take several paths at once. Childs et al. (p. 791) propose an architecture for a quantum computer, based on quantum walks of multiple interacting walkers. The system is capable of performing any quantum operation using a subset of its nodes, with the size of the subset scaling favorably with the complexity of the operation. Optical circuits are used to demonstrate a quantum-enhanced calculation. [Also see Perspective by Franson] Quantum computers are unnecessary for exponentially efficient computation or simulation if the Extended Church-Turing thesis is correct. The thesis would be strongly contradicted by physical devices that efficiently perform tasks believed to be intractable for classical computers. Such a task is boson sampling: sampling the output distributions of n bosons scattered by some passive, linear unitary process. We tested the central premise of boson sampling, experimentally verifying that three-photon scattering amplitudes are given by the permanents of submatrices generated from a unitary describing a six-mode integrated optical circuit. We find the protocol to be robust, working even with the unavoidable effects of photon loss, non-ideal sources, and imperfect detection. Scaling this to large numbers of photons should be a much simpler task than building a universal quantum computer.

Boson Sampling from a Gaussian State

We pose a randomized 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 a Gaussian input state, a linear optical network, and nonadaptive photon counting measurements. All the elements required to build such a processor currently exist. The demonstration of such a device would provide empirical evidence that quantum computers can, indeed, outperform classical computers and could lead to applications.

Direct characterization of linear-optical networks

We introduce an efficient method for fully characterizing multimode linear-optical networks. Our approach requires only a standard laser source and intensity measurements to directly and uniquely determine all moduli and non-trivial phases of the matrix describing a network. We experimentally demonstrate the characterization of a 6×6 fiber-optic network and independently verify the results via nonclassical two-photon interference.

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 the 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.

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.

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 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 quantum discord. We also demonstrate that under certain measurement constraints, discord between bipartite systems can be consumed to encode information that can only be accessed by coherent quantum interaction.

Measurement-based method for verifying quantum discord

Saleh Rahimi-Keshari, Carlton M. Caves, and Timothy C. Ralph Centre for Quantum Computation and Communication Technology, School of Mathematics and Physics, University of Queensland, St Lucia, Queensland 4072, Australia Center for Quantum Information and Control, University of New Mexico, MSC07-4220, Albuquerque, New Mexico 87131-0001, USA Centre for Engineered Quantum Systems, School of Mathematics and Physics, University of Queensland, St Lucia, Queensland 4072, Australia

Quantum process nonclassicality.

We propose a definition of nonclassicality for a single-mode quantum-optical process based on its action on coherent states. If a quantum process transforms a coherent state to a nonclassical state, it is verified to be nonclassical. To identify nonclassical processes, we introduce a representation for quantum processes, called the process-nonclassicality quasiprobability distribution, whose negativities indicate nonclassicality of the process. Using this distribution, we derive a relation for predicting nonclassicality of the output states for a given input state. We experimentally demonstrate our method by considering the single-photon addition as a nonclassical process and predicting nonclassicality of the output state for an input thermal state.

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.

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.