arXiv subjects

Peter P. Rohde

Publications and source records attributed to Peter P. Rohde.

At least 37 records · Page 2Linked to original sources

arXiv2018

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

Fock states are a fundamental resource for many quantum technologies such as quantum metrology. While much progress has been made in single-photon source technologies, preparing Fock states with large photon number remains challenging. We present and analyze a bootstrapped approach for non-deterministically preparing large photon-number Fock states by iteratively fusing smaller Fock states on a beamsplitter. We show that by employing state recycling we are able to exponentially improve the preparation rate over conventional schemes, allowing the efficient preparation of large Fock states. The scheme requires single-photon sources, beamsplitters, number-resolved photo-detectors, fast-feedforward, and an optical quantum memory.

quant-ph↗

arXiv2017

Practical quantum somewhat-homomorphic encryption with coherent states

We present a scheme for implementing homomorphic encryption on coherent states encoded using phase-shift keys. The encryption operations require only rotations in phase space, which commute with computations in the codespace performed via passive linear optics, and with generalized non-linear phase operations that are polynomials of the photon-number operator in the codespace. This encoding scheme can thus be applied to any computation with coherent state inputs, and the computation proceeds via a combination of passive linear optics and generalized non-linear phase operations. An example of such a computation is matrix multiplication, whereby a vector representing coherent state amplitudes is multiplied by a matrix representing a linear optics network, yielding a new vector of coherent state amplitudes. By finding an orthogonal partitioning of the support of our encoded states, we quantify the security of our scheme via the indistinguishability of the encrypted codewords. Whilst we focus on coherent state encodings, we expect that this phase-key encoding technique could apply to any continuous-variable computation scheme where the phase-shift operator commutes with the computation.

quant-ph↗

arXiv2017

Passive quantum error correction of linear optics networks through error averaging

We propose and investigate a method of error detection and noise correction for bosonic linear networks using a method of unitary averaging. The proposed error averaging does not rely on ancillary photons or control and feed-forward correction circuits, remaining entirely passive in its operation. We construct a general mathematical framework for this technique then give a series of proof of principle examples including numerical analysis. Two methods for the construction of averaging are then compared to determine the most effective manner of implementation and probe the related error thresholds. Finally we discuss some of the potential uses of this scheme.

quant-ph↗

arXiv2017

Multiphoton interference in quantum Fourier transform circuits and applications to quantum metrology

Quantum Fourier transforms (QFT) have gained increased attention with the rise of quantum walks, boson sampling, and quantum metrology. Here we present and demonstrate a general technique that simplifies the construction of QFT interferometers using both path and polarization modes. On that basis, we first observed the generalized Hong-Ou-Mandel effect with up to four photons. Furthermore, we directly exploited number-path entanglement generated in these QFT interferometers and demonstrated optical phase supersensitivities deterministically.

quant-ph↗

arXiv2017

Measurement-Based Linear Optics

A major challenge in optical quantum processing is implementing large, stable interferometers. Here we propose a virtual, measurement-based interferometer that is programmed on the fly solely by the choice of homodyne measurement angles. The effects of finite squeezing are captured as uniform amplitude damping. We compare our proposal to existing (physical) interferometers and consider its performance for BosonSampling, which could demonstrate post-classical computational power in the near future. We prove its efficiency in time and squeezing (energy) in this setting.

quant-ph↗

arXiv2017

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

quant-ph↗

arXiv2016

A Quantum Optics Argument for the #P-hardness of a Class of Multidimensional Integrals

Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large matrices using a simple quantum optics argument. In this way we prove that evaluating integrals in this class is \textbf{\#P}-hard. Our work provides a new approach for using methods from quantum physics to prove statements in computer science.

quant-ph↗

arXiv2015

Quantum leap: how to complete a quantum walk in a single step

Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and measurements of non-classical multi-particle correlations is likely to reveal the quantum nature. The number of elements $O(n)$ in a setup realizing walks grows with their length or spread $n$. We introduce the concept of a quantum leap, a process which can be achieved with fewer or complementary resources and which in a single step simulates another long process. The process and its leap are described by the same Hamiltonian but, the latter parametrizes the evolution with a tunable parameter of a setup. In the case of walks, a leap immediately gives a probability distribution which results only after many steps. This may be appealing for simulation of processes which are lengthy or require dynamical control. We discuss a leap based on the multi-particle Hong--Ou--Mandel interference, an inherently quantum phenomenon. It reproduces a quantum walk enabling perfect state transfer through spin chains. It requires a beam splitter, two detectors and $n$ particles to mimic a walk on a chain of size $O(n)$, for time fixed by beam-splitter's reflectivity. Our results apply to a broad class of systems where the HOM-like effects can be observed, and may constitute a new approach to simulation of complex Hamiltonians with passive interferometers.

quant-ph↗

arXiv2015

Implementing Scalable Boson Sampling with Time-Bin Encoding: Analysis of Loss, Mode Mismatch, and Time Jitter

It was recently shown by Motes, Gilchrist, Dowling & Rohde [PRL 113, 120501 (2014)] that a time-bin encoded fiber-loop architecture can implement an arbitrary passive linear optics transformation. This was shown in the case of an ideal scheme whereby the architecture has no sources of error. In any realistic implementation, however, physical errors are present, which corrupt the output of the transformation. We investigate the dominant sources of error in this architecture --- loss and mode-mismatch --- and consider how it affects the BosonSampling protocol, a key application for passive linear optics. For our loss analysis we consider two major components that contribute to loss --- fiber and switches --- and calculate how this affects the success probability and fidelity of the device. Interestingly, we find that errors due to loss are not uniform (unique to time-bin encoding), which asymmetrically biases the implemented unitary. Thus, loss necessarily limits the class of unitaries that may be implemented, and therefore future implementations must prioritise minimising loss rates if arbitrary unitaries are to be implemented. Our formalism for mode-mismatch is generlized to account for various phenomenon that may cause mode-mismatch, but we focus on two --- errors in fiber-loop lengths, and time-jitter of the photon source. These results provide a guideline for how well future experimental implementations might perform in light of these error mechanisms.

quant-ph↗

arXiv2015

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

Quantum number-path entanglement is a resource for super-sensitive quantum metrology and in particular provides for sub-shotnoise or even Heisenberg-limited sensitivity. However, such number-path entanglement has thought to have been resource intensive to create in the first place --- typically requiring either very strong nonlinearities, or nondeterministic preparation schemes with feed-forward, which are difficult to implement. Very recently, arising from the study of quantum random walks with multi-photon 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 shotnoise limit. Our result implies a pathway forward to practical quantum metrology with readily available technology.

quant-ph↗

arXiv2015

Multiplexed single-photon state preparation using a fibre-loop architecture

Heralded spontaneous parametric down-conversion (SPDC) has become the mainstay for single-photon state preparation in present-day photonics experiments. Because they are heralded, in principle one knows when a single photon has been prepared. However, the heralding efficiencies in experimentally realistic SPDC sources are typically very low. To overcome this, multiplexing techniques have been proposed which employ a bank of SPDC sources in parallel, and route successfully heralded photons to the output, thereby effectively boosting the heralding efficiency. However, running a large bank of independent SPDC sources is costly and requires complex switching. We analyse a multiplexing technique based on time-bin encoding that allows the heralding efficiency of just a single SPDC source to be increased. The scheme is simple and experimentally viable using present-day technology. We analyse the operation of the scheme in terms of experimentally realistic considerations, such as losses, detector inefficiency, and pump-power.

quant-ph↗

arXiv2015

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

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.

quant-ph↗

arXiv2015

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

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.

quant-ph↗

arXiv2014

Sampling generalized cat states with linear optics is probably hard

Boson-sampling has been presented as a simplified model for linear optical quantum computing. In the boson-sampling model, Fock states are passed through a linear optics network and sampled via number-resolved photodetection. It has been shown that this sampling problem likely cannot be efficiently classically simulated. This raises the question as to whether there are other quantum states of light for which the equivalent sampling problem is also computationally hard. We present evidence, without using a full complexity proof, that a very broad class of quantum states of light --- arbitrary superpositions of two or more coherent states --- when evolved via passive linear optics and sampled with number-resolved photodetection, likely implements a classically hard sampling problem.

quant-ph↗

arXiv2014

Boson-sampling with photons of arbitrary spectral structure

Boson-sampling has attracted much interest as a simplified approach to implementing a subset of optical quantum computing. Boson-sampling requires indistinguishable photons, but far fewer of them than universal optical quantum computing architectures. In reality, photons are never indistinguishable, and exhibit a rich spectral structure. Here we consider the operation of boson-sampling with photons of arbitrary spectral structure and relate the sampling statistics of the device to matrix permanents. This sheds light on the computational complexity of different regimes of the photons' spectral characteristics, and provides very general results for the operation of linear optics interferometers in the presence of partially distinguishable photons. Our results apply to both the cases of spectrally resolving and non-spectrally resolving detectors.

quant-ph↗

arXiv2014

A simple scheme for universal linear optics quantum computing with constant experimental complexity using fiber-loops

Recently, Motes, Gilchrist, Dowling & Rohde [Phys. Rev. Lett. 113, 120501 (2014)] presented a scheme for photonic boson-sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full, universal linear optics quantum computing, in various incarnations. The scheme employs two embedded fiber-loops, a single push-button photon source, three dynamically controlled beamsplitters, and a single time-resolved photo-detector. The architecture has only a single point of interference, and thus may be significantly easier to align than other schemes. The experimental complexity of the scheme is constant, irrespective of the size of the computation, limited only by fiber lengths and their respective loss rates.

quant-ph↗

arXiv2014

An introduction to boson-sampling

Boson-sampling is a simplified model for quantum computing that may hold the key to implementing the first ever post-classical quantum computer. Boson-sampling is a non-universal quantum computer that is significantly more straightforward to build than any universal quantum computer proposed so far. We begin this chapter by motivating boson-sampling and discussing the history of linear optics quantum computing. We then summarize the boson-sampling formalism, discuss what a sampling problem is, explain why boson-sampling is easier than linear optics quantum computing, and discuss the Extended Church-Turing thesis. Next, sampling with other classes of quantum optical states is analyzed. Finally, we discuss the feasibility of building a boson-sampling device using existing technology.

quant-ph↗

arXiv2014

Will boson-sampling ever disprove the Extended Church-Turing thesis?

Boson-sampling is a highly simplified, but non-universal, approach to implementing optical quantum computation. It was shown by Aaronson and Arkhipov that this protocol cannot be efficiently classically simulated unless the polynomial hierarchy collapses, which would be a shocking result in computational complexity theory. Based on this, numerous authors have made the claim that experimental boson-sampling would provide evidence against, or disprove, the Extended Church-Turing thesis -- that any physically realisable system can be efficiently simulated on a Turing machine. We argue against this claim on the basis that, under a general, physically realistic independent error model, boson-sampling does not implement a provably hard computational problem in the asymptotic limit of large systems.

quant-ph↗