Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jonathan P. Olson is active.

Publication


Featured researches published by Jonathan P. Olson.


Physical Review Letters | 2015

Linear Optical Quantum Metrology with Single Photons: Exploiting Spontaneously Generated Entanglement to Beat the Shot-Noise Limit

Keith R. Motes; Jonathan P. Olson; Evan J. Rabeaux; Jonathan P. Dowling; S. Jay Olson; Peter P. Rohde

Quantum number-path entanglement is a resource for supersensitive quantum metrology and in particular provides for sub-shot-noise or even Heisenberg-limited sensitivity. However, such number-path entanglement has been thought to be resource intensive to create in the first place--typically requiring either very strong nonlinearities, or nondeterministic preparation schemes with feedforward, which are difficult to implement. Very recently, arising from the study of quantum random walks with multiphoton walkers, as well as the study of the computational complexity of passive linear optical interferometers fed with single-photon inputs, it has been shown that such passive linear optical devices generate a superexponentially large amount of number-path entanglement. A logical question to ask is whether this entanglement may be exploited for quantum metrology. We answer that question here in the affirmative by showing that a simple, passive, linear-optical interferometer--fed with only uncorrelated, single-photon inputs, coupled with simple, single-mode, disjoint photodetection--is capable of significantly beating the shot-noise limit. Our result implies a pathway forward to practical quantum metrology with readily available technology.


arXiv: Quantum Physics | 2017

Quantum autoencoders for efficient compression of quantum data

Jonathan Romero; Jonathan P. Olson; Alán Aspuru-Guzik

Classical autoencoders are neural networks that can learn efficient low-dimensional representations of data in higher-dimensional space. The task of an autoencoder is, given an input x, to map x to a lower dimensional point y such that x can likely be recovered from y. The structure of the underlying autoencoder network can be chosen to represent the data on a smaller dimension, effectively compressing the input. Inspired by this idea, we introduce the model of a quantum autoencoder to perform similar tasks on quantum data. The quantum autoencoder is trained to compress a particular data set of quantum states, where a classical compression algorithm cannot be employed. The parameters of the quantum autoencoder are trained using classical optimization algorithms. We show an example of a simple programmable circuit that can be trained as an efficient autoencoder. We apply our model in the context of quantum simulation to compress ground states of the Hubbard model and molecular Hamiltonians.


Physical Review A | 2015

Boson sampling with displaced single-photon Fock states versus single-photon-added coherent states : the quantum-classical divide and computational-complexity transitions in linear optics

Kaushik P. Seshadreesan; Jonathan P. Olson; Keith R. Motes; Peter P. Rohde; Jonathan P. Dowling

Boson sampling is a specific quantum computation, which is likely hard to implement efficiently on a classical computer. The task is to sample the output photon number distribution of a linear optical interferometric network, which is fed with single-photon Fock state inputs. A question that has been asked is if the sampling problems associated with any other input quantum states of light (other than the Fock states) to a linear optical network and suitable output detection strategies are also of similar computational complexity as boson sampling. We consider the states that differ from the Fock states by a displacement operation, namely the displaced Fock states and the photon-added coherent states. It is easy to show that the sampling problem associated with displaced single-photon Fock states and a displaced photon number detection scheme is in the same complexity class as boson sampling for all values of displacement. On the other hand, we show that the sampling problem associated with single-photon-added coherent states and the same displaced photon number detection scheme demonstrates a computational complexity transition. It transitions from being just as hard as boson sampling when the input coherent amplitudes are sufficiently small, to a classically simulatable problem in the limit of large coherent amplitudes.


Physical Review A | 2015

Sampling arbitrary photon-added or photon-subtracted squeezed states is in the same complexity class as boson sampling

Jonathan P. Olson; Kaushik P. Seshadreesan; Keith R. Motes; Peter P. Rohde; Jonathan P. Dowling

Boson sampling is a simple model for non-universal linear optics quantum computing using far fewer physical resources than universal schemes. An input state comprising vacuum and single photon states is fed through a Haar-random linear optics network and sampled at the output using coincidence photodetection. This problem is strongly believed to be classically hard to simulate. We show that an analogous procedure implements the same problem, using photon-added or -subtracted squeezed vacuum states (with arbitrary squeezing), where sampling at the output is performed via parity measurements. The equivalence is exact and independent of the squeezing parameter, and hence provides an entire class of new quantum states of light in the same complexity class as boson sampling.


Physical Review A | 2014

Inefficiency of classically simulating linear optical quantum computing with Fock-state inputs

Bryan T. Gard; Jonathan P. Olson; Robert M. Cross; Moochan B. Kim; Hwang Lee; Jonathan P. Dowling

Aaronson and Arkhipov recently used computational complexity theory to argue that classical computers very likely cannot efficiently simulate linear, multimode, quantum-optical interferometers with arbitrary Fock-state inputs [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013)]. Here we present an elementary argument that utilizes only techniques from quantum optics. We explicitly construct the Hilbert space for such an interferometer and show that its dimension scales exponentially with all the physical resources. We also show in a simple example just how the Schrodinger and Heisenberg pictures of quantum theory, while mathematically equivalent, are not in general computationally equivalent. Finally, we conclude our argument by comparing the symmetry requirements of multiparticle bosonic to fermionic interferometers and, using simple physical reasoning, connect the nonsimulatability of the bosonic device to the complexity of computing the permanent of a large matrix.


Physical Review A | 2016

Operational meaning of quantum measures of recovery

Tom Cooney; Christoph Hirche; Ciara Morgan; Jonathan P. Olson; Kaushik P. Seshadreesan; John Watrous; Mark M. Wilde

Several information measures have recently been defined that capture the notion of recoverability. In particular, the fidelity of recovery quantifies how well one can recover a system


arXiv: Quantum Physics | 2014

An introduction to boson-sampling

Bryan T. Gard; Keith R. Motes; Jonathan P. Olson; Peter P. Rohde; Jonathan P. Dowling

A


Physical Review A | 2017

Linear optical quantum metrology with single photons: Experimental errors, resource counting, and quantum Cramér-Rao bounds

Jonathan P. Olson; Keith R. Motes; Patrick M. Birchall; Nick M. Studer; Margarite LaBorde; Todd Moulder; Peter P. Rohde; Jonathan P. Dowling

of a tripartite quantum state, defined on systems


Physical Review A | 2016

Efficient recycling strategies for preparing large Fock states from single-photon sources: Applications to quantum metrology

Keith R. Motes; Ryan L. Mann; Jonathan P. Olson; Nicholas M. Studer; E. Annelise Bergeron; Alexei Gilchrist; Jonathan P. Dowling; Dominic W. Berry; Peter P. Rohde

ABC


Proceedings of SPIE | 2016

Examples of modern quantum sensing and metrology with new results on photon-added coherent states

Jerome Luine; Anjali Singh; Bryan T. Gard; Jonathan P. Olson

, by acting on system

Collaboration


Dive into the Jonathan P. Olson's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Bryan T. Gard

Louisiana State University

View shared research outputs
Top Co-Authors

Avatar

Evan J. Rabeaux

Louisiana State University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Margarite LaBorde

Louisiana State University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Nick M. Studer

Louisiana State University

View shared research outputs
Researchain Logo
Decentralizing Knowledge