arXiv subjects

Peter P. Rohde

Publications and source records attributed to Peter P. Rohde.

At least 55 records · Page 3Linked to original sources

arXiv2014

Spontaneous parametric down-conversion photon sources are scalable in the asymptotic limit for boson-sampling

Boson-sampling has emerged as a promising avenue towards post-classical optical quantum computation, and numerous elementary demonstrations have recently been performed. Spontaneous parametric down-conversion (SPDC) is the mainstay for single-photon state preparation, the technique employed in most optical quantum information processing implementations to-date. Here we present a simple architecture for boson-sampling based on multiplexed SPDC sources and demonstrate that the architecture is limited only by the post-selection detection efficiency assuming that other errors, such as spectral impurity, dark counts, and interferometric instability are negligible. For any given number of input photons, there exists a minimum detector efficiency that allows post selection. If this efficiency is achieved, photon-number errors in the SPDC sources are sufficiently low as to guarantee correct boson-sampling most of the time. In this scheme the required detector efficiency must increase exponentially in the photon number. Thus, we show that idealised SPDC sources will not present a bottleneck for future boson-sampling implementations. Rather, photodetection efficiency is the limiting factor and thus future implementations may continue to employ SPDC sources.

quant-ph↗

arXiv2014

Scalable boson-sampling with time-bin encoding using a loop-based architecture

We present an architecture for arbitrarily scalable boson-sampling using two nested fiber loops. The architecture has fixed experimental complexity, irrespective of the size of the desired interferometer, whose scale is limited only by fiber and switch loss rates. The architecture employs time-bin encoding, whereby the incident photons form a pulse train, which enters the loops. Dynamically controlled loop coupling ratios allow the construction of the arbitrary linear optics interferometers required for boson-sampling. The architecture employs only a single point of interference and may thus be easier to stabilize than other approaches. The scheme has polynomial complexity and could be realized using demonstrated present-day technologies.

quant-ph↗

arXiv2014

Self-avoiding quantum walks

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random walks have found numerous applications, most notably in the modeling of protein folding. We consider the analogous problem in the quantum setting. We complement a quantum walk with a memory register that records where the walker has previously resided. The walker is then able to avoid returning back to previously visited sites. We parameterise the strength of the memory recording and the strength of the memory back-action on the walker's motion, and investigate their effect on the dynamics of the walk. We find that by manipulating these parameters the walk can be made to reproduce ideal quantum or classical random walk statistics, or a plethora of more elaborate diffusive phenomena. In some parameter regimes we observe a close correspondence between classical self-avoiding random walks and the quantum self-avoiding walk.

quant-ph↗

arXiv2013

Quantum random walks on congested lattices

We consider quantum random walks on congested lattices and contrast them to classical random walks. Congestion is modelled with lattices that contain static defects which reverse the walker's direction. We implement a dephasing process after each step which allows us to smoothly interpolate between classical and quantum random walkers as well as study the effect of dephasing on the quantum walk. Our key results show that a quantum walker escapes a finite boundary dramatically faster than a classical walker and that this advantage remains in the presence of heavily congested lattices. Also, we observe that a quantum walker is extremely sensitive to our model of dephasing.

quant-ph↗

arXiv2012

Quantum walks with memory - goldfish, elephants and wise old men

Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with memory by endowing the walker with multiple recycled coins and using a physical memory function via a history dependent coin flip. By numerical simulation we observe several phenomena. First in one dimension, walkers with memory have persistent quantum ballistic speed up over classical walks just as found in previous studies of multi-coined walks with trivial memory function. However, measurement of the multi-coin state can dramatically shift the mean of the spatial distribution. Second, we consider spatial entanglement in a two-dimensional quantum walk with memory and find that memory destroys entanglement between the spatial dimensions, even when entangling coins are employed. Finally, we explore behaviour in the presence of spatial randomness and find that in contrast to single coined walks, multi-coined walks do not localise and in fact a memory function can speed up the walk relative to a fully decohered multi-coin walker with trivial memory. We explicitly show how to construct linear optics circuits implementing the walks, and discuss prospects for classical simulation.

quant-ph↗

arXiv2012

The information capacity of a single photon

Quantum states of light are the obvious choice for communicating quantum information. To date, encoding information into the polarisation states of single photons has been widely used as these states form an natural closed two state qubit. However, photons are able to encode much more -- in principle infinite -- information via the continuous spatio-temporal degrees of freedom. Here we consider the information capacity of an optical quantum channel, such as an optical fibre, where a spectrally encoded single photon is the means of communication. We use the Holevo bound to calculate an upper bound on the channel capacity, and relate this to the spectral encoding basis and the spectral properties of the channel. Further, we derive analytic bounds on the capacity of such channels, and in the case of a symmetric two-state encoding calculate the exact capacity of the corresponding channel.

quant-ph↗

arXiv2012

Optical quantum computing with photons of arbitrarily low fidelity and purity

Linear optics quantum computing (LOQC) is a leading candidate for the implementation of large scale quantum computers. Here quantum information is encoded into the quantum states of light and computation proceeds via a linear optics network. It is well known that in such schemes there are stringent requirements on the spatio-temporal structure of photons -- they must be completely indistinguishable and of very high purity. We show that in the Boson-sampling model for LOQC these conditions may be significantly relaxed. We present evidence that by increasing the size of the system we can implement a computationally hard algorithm even if our photons have arbitrarily low fidelity and purity. These relaxed conditions make Boson-sampling LOQC within reach of present-day technology.

quant-ph↗

arXiv2012

Increasing the dimensionality of quantum walks using multiple walkers

We show that with the addition of multiple walkers, quantum walks on a line can be transformed into lattice graphs of higher dimension. Thus, multi-walker walks can simulate single-walker walks on higher dimensional graphs and vice versa. This exponential complexity opens up new applications for present-day quantum walk experiments. We discuss the applications of such higher-dimensional structures and how they relate to linear optics quantum computing. In particular we show that multi-walker quantum walks are equivalent to the BosonSampling model for linear optics quantum computation proposed by Aaronson & Arkhipov. With the addition of control over phase-defects in the lattice, which can be simulated with entangling gates, asymmetric lattice structures can be constructed which are universal for quantum computation.

quant-ph↗

arXiv2012

Quantum walks with encrypted data

In the setting of networked computation, data security can be a significant concern. Here we consider the problem of allowing a server to remotely manipulate client supplied data, in such a way that both the information obtained by the client about the server's operation and the information obtained by the server about the client's data are significantly limited. We present a protocol for achieving such functionality in two closely related models of restricted quantum computation -- the Boson sampling and quantum walk models. Due to the limited technological requirements of the Boson scattering model, small scale implementations of this technique are feasible with present-day technology.

quant-ph↗

arXiv2012

A 2D Quantum Walk Simulation of Two-Particle Dynamics

Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a lattice, demonstrating a scalable quantum walk on a non-trivial graph structure. We realized a coherent quantum walk over 12 steps and 169 positions using an optical fiber network. With our broad spectrum of quantum coins we were able to simulate the creation of entanglement in bipartite systems with conditioned interactions. Introducing dynamic control allowed for the investigation of effects such as strong non-linearities or two-particle scattering. Our results illustrate the potential of quantum walks as a route for simulating and understanding complex quantum systems.

quant-ph↗

arXiv2011

Error tolerance of the BosonSampling model for linear optics quantum computing

Linear optics quantum computing (LOQC) is a promising approach to implementing scalable quantum computation (QC). However, this approach has very demanding physical resource requirements. Recently, Aaronson & Arkhipov showed that a simplified model, which avoids the requirement for fast feed-forward and post-selection, while likely not capable of solving BQP-complete problems efficiently, can solve an interesting sampling problem, believed to be classically hard. Loss and mode-mismatch are the dominant sources of error in such systems. We provide evidence that even lossy systems, or systems with mode-mismatch, are likely to be classically hard to simulate. This is of practical interest to experimentalists wishing to demonstrate such systems, since it suggests that even with errors in their implementation, they are likely implementing an algorithm which is classically hard to simulate. Our results also equivalently apply to the multi-walker quantum walk model.

quant-ph↗

arXiv2011

Optimising number resolving photo-detectors using classical post-processing

Many present day quantum optics experiments, particularly in optical quantum information processing, rely on number-resolving photo-detection as a basic building block. In this paper we demonstrate that a simple classical optimisation technique can sometimes be employed to post-process the detector signature and improve the confidence of the measurement outcome in the presence of photon-number errors such as loss or dark-counts. While the regime in which this technique is applicable is rather restrictive, and will likely not be very useful for the large-scale quantum information processing applications of the future, the ideas presented might be employed in some present-day experiments where photo-detectors are typically very poor.

quant-ph↗

arXiv2011

Time-resolved detection and mode-mismatch in a linear optics quantum gate

Linear optics is a promising candidate for the implementation of quantum information processing protocols. In such systems single photons are employed to represent qubits. In practice, single photons produced from different sources will not be perfectly temporally and frequency matched. Therefore understanding the effects of temporal and frequency mismatch is important for characterising the dynamics of the system. In this paper we discuss the effects of temporal and frequency mismatch, how they differ, and what their effect is upon a simple linear optics quantum gate. We show that temporal and frequency mismatch exhibit inherently different effects on the operation of the gate. We also consider the spectral effects of the photo-detectors, focusing on time-resolved detection, which we show has a strong impact on the operation of such protocols.

quant-ph↗

arXiv2011

Entanglement dynamics and quasi-periodicity in discrete quantum walks

We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic. While the dynamics of the system are not chaotic since the system comprises linear evolution, the dynamics often exhibit some features similar to chaos such as high sensitivity to the system's parameters, irregularity and infinite periodicity. Our observations are of interest for entanglement generation, which is one primary use for the quantum walk formalism. Furthermore, we show that the systems we model can easily be mapped to optical beamsplitter networks, rendering experimental observation of quasi-periodic dynamics within reach.

quant-ph↗

arXiv2011

Multi-walker discrete time quantum walks on arbitrary graphs, their properties, and their photonic implementation

Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more naturally to some physical implementations, such as linear optics. Numerous authors have considered walks with one or two walkers, on one dimensional graphs, and several experimental demonstrations have been performed. In this paper we discuss generalizing the model of discrete time quantum walks to the case of an arbitrary number of walkers acting on arbitrary graph structures. We present a formalism which allows for analysis of such situations, and several example scenarios for how our techniques can be applied. We consider the most important features of quantum walks -- measurement, distinguishability, characterization, and the distinction between classical and quantum interference. We also discuss the potential for physical implementation in the context of linear optics, which is of relevance to present day experiments.

quant-ph↗

arXiv2010

Are quantum walks the saviour of optical quantum computing?

Quantum walks have emerged as an interesting candidate for the implementation of quantum information processing protocols. Optical implementations of quantum walks have been demonstrated by various groups and some have received high-profile coverage. It is often claimed that quantum walks provide an avenue towards universal quantum computation. In this comment I wish to dispel some misconceptions surrounding the prospects of quantum walks as a route towards universal optical quantum computation.

quant-ph↗

arXiv2008

Entanglement of Remote Spins with Unequal Coupling to an Optically Active Mediator

We demonstrate that two remote qubits can be entangled through an optically active intermediary even if the coupling strengths between mediator and qubits are different. This is true for a broad class of interactions. We consider two contrasting scenarios. First, we extend the analysis of a previously studied gate operation which relies on pulsed, dynamical control of the optical state and which may be performed quickly. We show that remote spins can be entangled in this case even when the intermediary coupling strengths are unequal. Second, we propose an alternative adiabatic control procedure, and find that the system requirements become even less restrictive in this case. The scheme could be tested immediately in a range of systems including molecules, quantum dots, or defects in crystals.

quant-ph↗

arXiv2008

Spectral structure and decompositions of optical states, and their applications

We discuss the spectral structure and decomposition of multi-photon states. Ordinarily `multi-photon states' and `Fock states' are regarded as synonymous. However, when the spectral degrees of freedom are included this is not the case, and the class of `multi-photon' states is much broader than the class of `Fock' states. We discuss the criteria for a state to be considered a Fock state. We then address the decomposition of general multi-photon states into bases of orthogonal eigenmodes, building on existing multi-mode theory, and introduce an occupation number representation that provides an elegant description of such states that in many situations simplifies calculations. Finally we apply this technique to several example situations, which are highly relevant for state of the art experiments. These include Hong-Ou-Mandel interference, spectral filtering, finite bandwidth photo-detection, homodyne detection and the conditional preparation of Schrödinger Kitten and Fock states. Our techniques allow for very simple descriptions of each of these examples.

quant-ph↗