No Arabic abstract
Single photons are a vital resource for optical quantum information processing. Efficient and deterministic single photon sources do not yet exist, however. To date, experimental demonstrations of quantum processing primitives have been implemented using non-deterministic sources combined with heralding and/or postselection. Unfortunately, even for eight photons, the data rates are already so low as to make most experiments impracticable. It is well known that quantum memories, capable of storing photons until they are needed, are a potential solution to this `scaling catastrophe. Here, we analyze in detail the benefits of quantum memories for producing multiphoton states, showing how the production rates can be enhanced by many orders of magnitude. We identify the quantity $eta B$ as the most important figure of merit in this connection, where $eta$ and $B$ are the efficiency and time-bandwidth product of the memories, respectively.
Quantum simulations are becoming an essential tool for studying complex phenomena, e.g. quantum topology, quantum information transfer, and relativistic wave equations, beyond the limitations of analytical computations and experimental observations. To date, the primary resources used in proof-of-principle experiments are collections of qubits, coherent states or multiple single-particle Fock states. Here we show the first quantum simulation performed using genuine higher-order Fock states, with two or more indistinguishable particles occupying the same bosonic mode. This was implemented by interfering pairs of Fock states with up to five photons on an interferometer, and measuring the output states with photon-number-resolving detectors. Already this resource-efficient demonstration reveals new topological matter, simulates non-linear systems and elucidates a perfect quantum transfer mechanism which can be used to transport Majorana fermions.
We demonstrate the existence of a finite temperature threshold for a 1D stabilizer code under an error correcting protocol that requires only a fraction of the syndrome measurements. Below the threshold temperature, encoded states have exponentially long lifetimes, as demonstrated by numerical and analytical arguments. We sketch how this algorithm generalizes to higher dimensional stabilizer codes with string-like excitations, like the toric code.
Quantum memories are essential for quantum information processing and long-distance quantum communication. The field has recently seen a lot of progress, and the present focus issue offers a glimpse of these developments, showing both experimental and theoretical results from many of the leading groups around the world. On the experimental side, it shows work on cold gases, warm vapors, rare-earth ion doped crystals and single atoms. On the theoretical side there are in-depth studies of existing memory protocols, proposals for new protocols including approaches based on quantum error correction, and proposals for new applications of quantum storage. Looking forward, we anticipate many more exciting results in this area.
Memory dephasing and its impact on the rate of entanglement generation in quantum repeaters is addressed. For systems that rely on probabilistic schemes for entanglement distribution and connection, we estimate the maximum achievable rate per employed memory for our optimized partial nesting protocol. We show that, for any given distance $L$, the polynomial scaling of rate with distance can only be achieved if quantum memories with coherence times on the order of $L/c$ or longer, with $c$ being the speed of light in the channel, are available. The above rate degrades as a power of $exp[-sqrt{(L/c)/ tau_c}]$ with distance when the coherence time $tau_c ll L/c$.
Central to the success of adaptive systems is their ability to interpret signals from their environment and respond accordingly -- they act as agents interacting with their surroundings. Such agents typically perform better when able to execute increasingly complex strategies. This comes with a cost: the more information the agent must recall from its past experiences, the more memory it will need. Here we investigate the power of agents capable of quantum information processing. We uncover the most general form a quantum agent need adopt to maximise memory compression advantages, and provide a systematic means of encoding their memory states. We show these encodings can exhibit extremely favourable scaling advantages relative to memory-minimal classical agents when information must be retained about events increasingly far into the past.