Searcharxiv⌕ Search

arXiv subjects

Peter van Loock

Publications and source records attributed to Peter van Loock.

At least 55 records · Page 3Linked to original sources

Quantum capacity of a deformed bosonic dephasing channel

In this paper, using the notion of nonlinear coherent states, we define a deformed bosonic dephasing channel modelling the impact of a Kerr medium on a quantum state, as it occurs, for instance, in quantum communication based on optical fibers. We show that, in certain regimes, the Kerr nonlinearity is able to compensate the dephasing. In addition, our studies reveal that the quantum capacity of the deformed bosonic dephasing channel can be greater than that of the undeformed, standard bosonic dephasing channel for certain nonlinearity parameters.

quant-ph↗

Bell-state measurement exceeding 50% success probability with linear optics

Bell-state projections serve as a fundamental basis for most quantum communication and computing protocols today. However, with current Bell-state measurement schemes based on linear optics, only two of four Bell states can be identified, which means that the maximum success probability of this vital step cannot exceed $50\%$. Here, we experimentally demonstrate a scheme that amends the original measurement with additional modes in the form of ancillary photons, which leads to a more complex measurement pattern, and ultimately a higher success probability of $62.5\%$. Experimentally, we achieve a success probability of $(57.9 \pm 1.4)\%$, a significant improvement over the conventional scheme. With the possibility of extending the protocol to a larger number of ancillary photons, our work paves the way towards more efficient realisations of quantum technologies based on Bell-state measurements.

quant-ph↗

Deep reinforcement learning for key distribution based on quantum repeaters

This work examines secret key rates of key distribution based on quantum repeaters in a broad parameter space of the communication distance and coherence time of the quantum memories. As the first step in this task, a Markov decision process modeling the distribution of entangled quantum states via quantum repeaters is developed. Based on this model, a simulation is implemented, which is employed to determine secret key rates under naively controlled, limited memory storage times for a wide range of parameters. The complexity of the quantum state evolution in a multiple-segment quantum repeater chain motivates the use of deep reinforcement learning to search for optimal solutions for the memory storage time limits - the so-called memory cut-offs. The novel contribution in this work is to explore very general cut-off strategies which dynamically adapt to the state of the quantum repeater. An implementation of this approach is presented, with a particular focus on four-segment quantum repeaters, achieving proof of concept of its validity by finding exemplary solutions that outperform the naive strategies.

quant-ph↗

Memoryless quantum repeaters based on cavity-QED and coherent states

A quantum repeater scheme based on cavity-QED and quantum error correction of channel loss via rotation-symmetric bosonic codes (RSBC) is proposed to distribute atomic entangled states over long distances without memories and at high clock rates. In this scheme, controlled rotation gates, i.e., phase shifts of the propagating light modes conditioned upon the state of an atom placed in a cavity, provide a mechanism both for the entangled-state preparations and for the error syndrome identifications. The distributed entangled pairs can then be used for quantum key distribution (QKD). In order to assess the performance of this repeater protocol, an explicit instance of RSBC--multi-component cat codes are studied quantitatively. A numerical simulation shows that the total fidelity and the success probability for quantum communication over a long distance (such as 1000km) both can almost approach unity provided a small enough elementary distance between stations (smaller than 0.1km or 0.01km) and rather low local losses (up to 0.1%) are considered. Secret key rates can become correspondingly high, both per channel use, beating the repeaterless bound, and per second thanks to the relatively high clock rates of the memoryless scheme. It is predicted from these results that a larger elementary distance might also keep both the fidelity and the success probability close to unity if higher-loss codes are employed. Based upon the cavity-QED setting, this scheme can be realized at room temperature and at optical frequencies.

quant-ph↗

Efficient backcasting search for optical quantum state synthesis

Non-Gaussian states are essential for many optical quantum technologies. The so-called optical quantum state synthesizer (OQSS), consisting of Gaussian input states, linear optics, and photon-number resolving detectors, is a promising method for non-Gaussian state preparation. However, an inevitable and crucial problem is the complexity of the numerical simulation of the state preparation on a classical computer. This problem makes it very challenging to generate important non-Gaussian states required for advanced quantum information processing. Thus, an efficient method to design OQSS circuits is highly desirable. To circumvent the problem, we offer a scheme employing a backcasting approach, where the circuit of OQSS is divided into some sublayers, and we simulate the OQSS backwards from final to first layers. Moreover, our results show that the detected photon number by each detector is at most 2, which can significantly reduce the requirements for the photon-number resolving detector. By virtue of the potential for the preparation of a wide variety of non-Gaussian states, the proposed OQSS can be a key ingredient in general optical quantum information processing.

quant-ph↗

Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible

We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. One of our main motivations is to address the question whether simply placing quantum memories along a quantum communication channel can be beneficial in a realistic setting. The underlying model assumes deterministic entanglement swapping of single-spin quantum memories and it excludes probabilistic entanglement distillation, and thus two-way classical communication, on higher nesting levels. Within this framework, we identify the essential properties of any optimal repeater scheme: entanglement distribution in parallel, entanglement swapping as soon and parallel quantum storage as little as possible. While these features are obvious or trivial for the simplest repeater with one middle station, for more stations they cannot always be combined. We propose an optimal scheme including channel loss and memory dephasing, proving its optimality for the case of two stations and conjecturing it for the general case. In an even more realistic setting, we consider additional tools and parameters such as memory cut-offs, multiplexing, initial state and swapping gate fidelities, and finite link coupling efficiencies in order to identify potential regimes in memory-assisted quantum key distribution beyond one middle station that exceed the rates of the smallest quantum repeaters as well as those obtainable in all-optical schemes unassisted by stationary memory qubits and two-way classical communication.

quant-ph↗

Nonlinear quantum error correction

We introduce a theory of quantum error correction (QEC) for a subclass of states within a larger Hilbert space. In the standard theory of QEC, the set of all encoded states is formed by an arbitrary linear combination of the codewords. However, this can be more general than required for a given quantum protocol which may only traverse a subclass of states within the Hilbert space. Here we propose the concept of nonlinear QEC (NLQEC), where the encoded states are not necessarily a linear combination of codewords. We introduce a sufficiency criterion for NLQEC with respect to the subclass of states. The new criterion gives a more relaxed condition for the formation of a QEC code, such that under the assumption that the states are within the subclass of states, the errors are correctable. This allows us, for instance, to effectively circumvent the no-go theorems regarding optical QEC for Gaussian states and channels, for which we present explicit examples.

quant-ph↗

Quantum error correction with higher Gottesman-Kitaev-Preskill codes: minimal measurements and linear optics

We propose two schemes to obtain Gottesman-Kitaev-Preskill (GKP) error syndromes by means of linear optical operations, homodyne measurements and GKP ancillae. This includes showing that for a concatenation of GKP codes with a $[n,k,d]$ stabilizer code only $2n$ measurements are needed in order to obtain the complete syndrome information, significantly reducing the number of measurements in comparison to the canonical concatenated measurement scheme and at the same time generalizing linear-optics-based syndrome detections to higher GKP codes. Furthermore, we analyze the possibility of building the required ancilla states from single-mode states and linear optics. We find that for simple GKP codes this is possible, whereas for concatenations with qubit Calderbank-Shor-Steane (CSS) codes of distance $d\geq3$ it is not. We also consider the canonical concatenated syndrome measurements and propose methods for avoiding crosstalk between ancillae. In addition, we make use of the observation that the concatenation of a GKP code with a stabilizer code forms a lattice in order to see the analog information decoding of such codes from a different perspective allowing for semi-analytic calculations of the logical error rates.

quant-ph↗

Optimal entanglement swapping in quantum repeaters

We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeater's sizes. Based on this, we are able to demonstrate that the commonly used "doubling" scheme for performing probabilistic entanglement swapping of probabilistically distributed entangled qubit pairs in quantum repeaters does not always produce the best possible raw rate. Focussing on this figure of merit, without considering additional probabilistic elements for error suppression such as entanglement distillation on higher "nesting levels", our approach reveals that a power-of-two number of segments has no privileged position in quantum repeater theory; the best scheme can be constructed for any number of segments. Moreover, classical communication can be included into our scheme, and we show how this influences the raw waiting time for different number of segments, confirming again the optimality of "non-doubling" in some relevant parameter regimes. Thus, our approach provides the minimal possible waiting time of quantum repeaters in a fairly general physical setting.

quant-ph↗

All-Optical Long-Distance Quantum Communication with Gottesman-Kitaev-Preskill qubits

Quantum repeaters are a promising platform for realizing long-distance quantum communication and thus could form the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. Repeater protocols that encode information in single- or multi-photon states are limited by transmission losses and the cost of implementing entangling gates or Bell measurements. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill (GKP) qubits. These qubits are natural elements for quantum repeater protocols, because they allow for deterministic Gaussian entangling operations and Bell measurements, which can be implemented at room temperature. The GKP encoding is also capable of correcting small displacement errors. At the cost of additional Gaussian noise, photon loss can be converted into a random displacement error channel by applying a phase-insensitive amplifier. Here we show that a similar conversion can be achieved in two-way repeater protocols by using phase-sensitive amplification applied in the post-processing of the measurement data, resulting in less overall Gaussian noise per (sufficiently short) repeater segment. We also investigate concatenating the GKP code with higher level qubit codes while leveraging analog syndrome data, post-selection, and path-selection techniques to boost the rate of communication. We compute the secure key rates and find that GKP repeaters can achieve a comparative performance relative to methods based on photonic qubits while using orders-of-magnitude fewer qubits.

quant-ph↗

Memory-assisted long-distance phase-matching quantum key distribution

We propose a scheme that generalizes the loss scaling properties of twin-field or phase-matching quantum key distribution (QKD) related to a channel of transmission $η_{total}$ from $\sqrt{η_{total}}$ to $\sqrt[2n]{η_{total}}$ by employing n-1 memory stations with spin qubits and n beam-splitter stations including optical detectors. Our scheme's resource states are similar to the coherent-state-based light-matter entangled states of a previous hybrid quantum repeater, but unlike the latter our scheme avoids the necessity of employing 2n-1 memory stations and writing the transmitted optical states into the matter memory qubits. The full scaling advantage of this memory-assisted phase-matching QKD (MA-PM QKD) is obtainable with threshold detectors in a scenario with only channel loss. We mainly focus on the obtainable secret-key rates per channel use for up to n=4 including memory dephasing and for n=2 (i.e., $\sqrt[4]{η_{total}}$-MA-PM QKD assisted by a single memory station) for error models including dark counts, memory dephasing and depolarization, and phase mismatch. By combining the twin-field concept of interfering phase-sensitive optical states with that of storing quantum states up to a cutoff memory time, distances well beyond 700 km with rates well above $η_{total}$ can be reached for realistic, high-quality quantum memories (up to 1s coherence time) and modest detector efficiencies. Similarly, the standard single-node quantum repeater, scaling as $\sqrt{η_{total}}$, can be beaten when approaching perfect detectors and exceeding spin coherence times of 5s; beating ideal twin-field QKD requires 1s. As for further experimental simplifications, our treatment includes the notion of weak nonlinearities for the light-matter states, a discussion on the possibility of using homodyne detectors, and a comparison between sequential and parallel entanglement distributions.

quant-ph↗

Phase Locking between Two All-Optical Quantum Memories

Optical approaches to quantum computation require the creation of multi-mode photonic quantum states in a controlled fashion. Here we experimentally demonstrate phase locking of two all-optical quantum memories, based on a concatenated cavity system with phase reference beams, for the time-controlled release of two-mode entangled single-photon states. The release time for each mode can be independently determined. The generated states are characterized by two-mode optical homodyne tomography. Entanglement and nonclassicality are preserved for release-time differences up to 400 ns, confirmed by logarithmic negativities and Wigner-function negativities, respectively.

quant-ph↗

Extending Quantum Links: Modules for Fiber- and Memory-Based Quantum Repeaters

We analyze elementary building blocks for quantum repeaters based on fiber channels and memory stations. Implementations are considered for three different physical platforms, for which suitable components are available: quantum dots, trapped atoms and ions, and color centers in diamond. We evaluate and compare the performances of basic quantum repeater links for these platforms both for present-day, state-of-the-art experimental parameters as well as for parameters that could in principle be reached in the future. The ultimate goal is to experimentally explore regimes at intermediate distances, up to a few 100 km, in which the repeater-assisted secret key transmission rates exceed the maximal rate achievable via direct transmission. We consider two different protocols, one of which is better adapted to the higher source clock rate and lower memory coherence time of the quantum dot platform, while the other circumvents the need of writing photonic quantum states into the memories in a heralded, non-destructive fashion. The elementary building blocks and protocols can be connected in a modular form to construct a quantum repeater system that is potentially scalable to large distances.

quant-ph↗

Efficiencies of logical Bell measurements on CSS codes with static linear optics

We show how the efficiency of a logical Bell measurement (BM) can be calculated for arbitrary CSS codes with the experimentally important constraint of using only transversal static linear-optical BMs on the physical single-photon qubit level. For this purpose, we utilize the codes' description in terms of stabilizers in order to calculate general efficiencies for the loss-free case, but also for specific cases including photon loss. These efficiencies can be, for instance, used for obtaining transmission rates of all-optical quantum repeaters. In the loss-free case, we demonstrate that the important class of CSS codes with identical physical-qubit support for the two logical Pauli ($Z$ and $X$) operators can only achieve a logical BM efficiency of $\frac{1}{2}$ if one always employs the same ancilla-free static linear optical BMs on the physical level. We apply our methods to various CSS codes including two-dimensional planar color and planar surface codes. We then find that in many cases, the fixed use of the standard linear optical BM for all physical BMs is suboptimal and performing linear optical transformations before doing the standard linear optical BM (still without any ancillary photons and without any feedforward) can increase the efficiency enormously. In fact, using this generalization in the no-loss (or sometimes also in the low-loss) case allows us, on the one hand, to improve the logical BM efficiency of quantum parity codes compared to previously known results and, on the other hand, it also enables us to enhance the efficiency of two-dimensional planar color codes, whose efficiency is otherwise subject to the above $\frac{1}{2}$ bound, to arbitrarily close to unity.

quant-ph↗

Probabilistic Fault-Tolerant Universal Quantum Computation and Sampling Problems in Continuous Variables

Continuous-Variable (CV) devices are a promising platform for demonstrating large-scale quantum information protocols. In this framework, we define a general quantum computational model based on a CV hardware. It consists of vacuum input states, a finite set of gates - including non-Gaussian elements - and homodyne detection. We show that this model incorporates encodings sufficient for probabilistic fault-tolerant universal quantum computing. Furthermore, we show that this model can be adapted to yield sampling problems that cannot be simulated efficiently with a classical computer, unless the polynomial hierarchy collapses. This allows us to provide a simple paradigm for short-term experiments to probe quantum advantage relying on Gaussian states, homodyne detection and some form of non-Gaussian evolution. We finally address the recently introduced model of Instantaneous Quantum Computing in CV, and prove that the hardness statement is robust with respect to some experimentally relevant simplifications in the definition of that model.

quant-ph↗

All-optical storage of phase-sensitive quantum states of light

We experimentally demonstrate storage and on-demand release of phase-sensitive, photon-number superposition states of the form $α|0\rangle + βe^{iθ} |1\rangle$ for an optical quantized oscillator mode. For this purpose, we introduce a phase-probing mechanism to a storage system composed of two concatenated optical cavities, which was previously employed for storage of phase-insensitive single-photon states [Phys. Rev. X 3, 041028 (2013)]. This is the first demonstration of all-optically storing highly nonclassical and phase-sensitive quantum states of light. The strong nonclassicality of the states after storage becomes manifest as a negative region in the corresponding Wigner function shifted away from the origin in phase space. This negativity is otherwise, without the phase information of the memory system, unobtainable. While our scheme includes the possibility of optical storage, on-demand release and synchronization of arbitrary single-rail qubit states, it is not limited to such states. In fact, our technique is extendible to more general phase-sensitive states such as multiphoton superposition or entangled states, and thus it represents a significant step toward advanced optical quantum information processing, where highly non-classical states are utilized as resources.

quant-ph↗

Quantum Nondemolition Gate Operations and Measurements in Real Time on Fluctuating Signals

We demonstrate an optical quantum nondemolition (QND) interaction gate with a bandwidth of about 100 MHz. Employing this gate, we are able to perform QND measurements in real time on randomly fluctuating signals. Our QND gate relies upon linear optics and offline-prepared squeezed states. In contrast to previous demonstrations on narrow sideband modes, our gate is compatible with non-Gaussian quantum states temporally localized in a wave-packet mode, and thus opens the way for universal gate operations and realization of quantum error correction.

quant-ph↗

Heralded creation of photonic qudits from parametric down conversion using linear optics

We propose an experimental scheme to generate, in a heralded fashion, arbitrary quantum superpositions of two-mode optical states with a fixed total photon number $n$ based on weakly squeezed two-mode squeezed state resources (obtained via weak parametric down conversion), linear optics, and photon detection. Arbitrary $d$-level (qudit) states can be created this way where $d=n+1$. Furthermore, we experimentally demonstrate our scheme for $n=2$. The resulting qutrit states are characterized via optical homodyne tomography. We also discuss possible extensions to more than two modes concluding that, in general, our approach ceases to work in this case. For illustration and with regards to possible applications, we explicitly calculate a few examples such as NOON states and logical qubit states for quantum error correction. In particular, our approach enables one to construct bosonic qubit error-correction codes against amplitude damping (photon loss) with a typical suppression of $\sqrt{n}-1$ losses and spanned by two logical codewords that each correspond to an $n$-photon superposition for two bosonic modes.

quant-ph↗