Searcharxiv⌕ Search

arXiv subjects

Peter van Loock

Publications and source records attributed to Peter van Loock.

At least 109 records · Page 6Linked to original sources

Universal Quantum Computation with Continuous-Variable Abelian Anyons

We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of quantum gates using topological operations. We find that the topological operations alone are insufficient for universal quantum computation which leads us to study additional non-topological operations such as offline squeezing and single-mode measurements. It is shown that these in conjunction with a non-Gaussian element allow for universal quantum computation using continuous-variable abelian anyons.

quant-ph↗

A method for exponential operator decomposition

Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions, which is efficient in terms of the required number of operators. Compared to existing schemes, our more direct approach is general, in the sense that it can be applied to various kinds of operators including nested commutation operators, and it is systematic.

quant-ph↗

How to decompose arbitrary continuous-variable quantum operations

We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multi-mode Hamiltonian evolution, into a set of universal unitary gates. Although our approach is mainly oriented towards continuous-variable quantum computation, it may be used more generally whenever quantum states are to be transformed deterministically, e.g. in quantum control, discrete-variable quantum computation, or Hamiltonian simulation. We illustrate our scheme by presenting decompositions for various nonlinear Hamiltonians including quartic Kerr interactions. Finally, we conclude with two potential experiments utilizing offline-prepared optical cubic states and homodyne detections, in which quantum information is processed optically or in an atomic memory using quadratic light-atom interactions.

quant-ph↗

Demonstration of a Controlled-Phase Gate for Continuous-Variable One-Way Quantum Computation

We experimentally demonstrate a controlled-phase gate for continuous variables in a fully measurement-based fashion. In our scheme, the two independent input states of the gate, encoded in two optical modes, are teleported into a four-mode Gaussian cluster state. As a result, one of the entanglement links present in the initial cluster state appears in the two unmeasured output modes as the corresponding entangling gate acting on the input states. The genuine quantum character of this gate becomes manifest and is verified through the presence of entanglement at the output for a product two-mode coherent input state. By combining our controlled-phase gate with the recently reported module for universal single-mode Gaussian operations [R. Ukai et al., Phys. Rev. Lett. 106, 240504 (2011)], it is possible to implement universal Gaussian operations on arbitrary multi-mode quantum optical states in form of a fully measurement-based one-way quantum computation.

quant-ph↗

Multipartite continuous-variable entanglement distillation using local squeezing and only one photon-subtraction operation

In this paper, we study entanglement distillation of multipartite continuous-variable Gaussian entangled states. Following Opatrný \emph{et al.}'s photon subtraction (PS) scheme, the probability of successful distillation decreases exponentially with the number of parties $N$. However, here, we shall propose an entanglement distillation scheme whose success probability scales as a constant with $N$. Our protocol employs several local squeezers, but it requires only a single PS operation. Using the logarithmic negativity as a measure of entanglement, we find that both the success probability and the distilled entanglement can be improved at the same time. Moreover, an $N$-mode transfer theorem (transferring states from phase space to Hilbert space) is presented.

quant-ph↗

Efficient Heralding of Photonic Qubits with Apllications to Device Independent Quantum Key Distribution

We present an efficient way of heralding photonic qubit signals using linear optics devices. First we show that one can obtain asymptotically perfect heralding and unit success probability with growing resources. Second, we show that even using finite resources, we can improve qualitatively and quantitatively over earlier heralding results. In the latte r scenario, we can obtain perfect heralded photonic qubits while maintaining a finite success probability. We demonstrate the advantage of our heralding scheme by predicting key rates for device independent quantum key distribution, taking imperfections of sources and detectors into account.

quant-ph↗

Local Gaussian operations can enhance continuous-variable entanglement distillation

Entanglement distillation is a fundamental building block in long-distance quantum communication. Though known to be useless on their own for distilling Gaussian entangled states, local Gaussian operations may still help to improve non-Gaussian entanglement distillation schemes. Here we show that by applying local squeezing operations, both the performance and the efficiency of existing distillation protocols can be enhanced. We derive the optimal enhancement through local Gaussian unitaries, which can be obtained even in the most natural scenario when Gaussian mixed entangled states are shared after their distribution through a lossy-fiber communication channel.

quant-ph↗

Entanglement properties of optical coherent states under amplitude damping

Through concurrence, we characterize the entanglement properties of optical coherent-state qubits subject to an amplitude damping channel. We investigate the distillation capabilities of known error correcting codes and obtain upper bounds on the entanglement depending on the non-orthogonality of the coherent states and the channel damping parameter. This work provides a first, full quantitative analysis of these photon-loss codes which are naturally reminiscent of the standard qubit codes against Pauli errors.

quant-ph↗

Graphical calculus for Gaussian pure states

We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semi-local Gaussian unitary operations, as well as local quadrature measurements. We then use this graphical calculus to analyze continuous-variable (CV) cluster states, the essential resource for one-way quantum computing with CV systems. Current graphical approaches to CV cluster states are only valid in the unphysical limit of infinite squeezing, and the associated graph transformation rules only apply when the initial and final states are of this form. Our formalism applies to all Gaussian pure states and subsumes these rules in a natural way. In addition, the term "CV graph state" currently has several inequivalent definitions in use. Using this formalism we provide a single unifying definition that encompasses all of them. We provide many examples of how the formalism may be used in the context of CV cluster states: defining the "closest" CV cluster state to a given Gaussian pure state and quantifying the error in the approximation due to finite squeezing; analyzing the optimality of certain methods of generating CV cluster states; drawing connections between this new graphical formalism and bosonic Hamiltonians with Gaussian ground states, including those useful for CV one-way quantum computing; and deriving a graphical measure of bipartite entanglement for certain classes of CV cluster states. We mention other possible applications of this formalism and conclude with a brief note on fault tolerance in CV one-way quantum computing.

quant-ph↗

Demonstration of unconditional one-way quantum computations for continuous variables

Quantum computing promises to exploit the laws of quantum mechanics for processing information in ways fundamentally different from today's classical computers, leading to unprecedented efficiency. One-way quantum computation, sometimes referred to as the cluster model of quantum computation, is a very promising approach to fulfil the capabilities of quantum information processing. The cluster model is realizable through measurements on a highly entangled cluster state with no need for controlled unitary evolutions. Here we demonstrate unconditional one-way quantum computation experiments for continuous variables using a linear cluster state of four entangled optical modes. We implement an important set of quantum operations, linear transformations, in the optical phase space through one-way computation. Though not sufficient, these are necessary for universal quantum computation over continuous variables, and in our scheme, in principle, any such linear transformation can be unconditionally and deterministically applied to arbitrary single-mode quantum states.

quant-ph↗

Optimal Gaussian Entanglement Swapping

We consider entanglement swapping with general mixed two-mode Gaussian states and calculate the optimal gains for a broad class of such states including those states most relevant in communication scenarios. We show that for this class of states, entanglement swapping adds no additional mixedness, that is the ensemble average output state has the same purity as the input states. This implies that, by using intermediate entanglement swapping steps, it is, in principle, possible to distribute entangled two-mode Gaussian states of higher purity as compared to direct transmission. We then apply the general results on optimal Gaussian swapping to the problem of quantum communication over a lossy fiber and demonstrate that, contrary to negative conclusions in the literature, swapping-based schemes in fact often perform better than direct transmission for high input squeezing. However, an effective transmission analysis reveals that the hope for improved performance based on optimal Gaussian entanglement swapping is spurious since the swapping does not lead to an enhancement of the effective transmission. This implies that the same or better results can always be obtained using direct transmission in combination with, in general, less squeezing.

quant-ph↗

Rate analysis for a hybrid quantum repeater

We present a detailed rate analysis for a hybrid quantum repeater assuming perfect memories and using optimal probabilistic entanglement generation and deterministic swapping routines. The hybrid quantum repeater protocol is based on atomic qubit-entanglement distribution through optical coherent-state communication. An exact, analytical formula for the rates of entanglement generation in quantum repeaters is derived, including a study on the impacts of entanglement purification and multiplexing strategies. More specifically, we consider scenarios with as little purification as possible and we show that for sufficiently low local losses, such purifications are still more powerful than multiplexing. In a possible experimental scenario, our hybrid system can create near-maximally entangled (F = 0.98) pairs over a distance of 1280 km at rates of the order of 100 Hz.

quant-ph↗

Distillation of mixed-state continuous-variable entanglement by photon subtraction

We present a detailed theoretical analysis for the distillation of one copy of a mixed two-mode continuous-variable entangled state using beamsplitters and coherent photon-detection techniques, including conventional on-off detectors and photon number resolving detectors. The initial Gaussian mixed-entangled states are generated by transmitting a two-mode squeezed state through a lossy bosonic channel, corresponding to the primary source of errors in current approaches to optical quantum communication. We provide explicit formulas to calculate the entanglement in terms of logarithmic negativity before and after distillation, including losses in the channel and the photon detection, and show that one-copy distillation is still possible even for losses near the typical fiber channel attenuation length. A lower bound for the transmission coefficient of the photon-subtraction beamsplitter is derived, representing the minimal value that still allows to enhance the entanglement.

quant-ph↗

Demonstration of Cluster State Shaping and Quantum Erasure for Continuous Variables

We demonstrate experimentally how to remove an arbitrary node from a continuous-variable cluster state and how to shorten any quantum wires of such a state. These two basic operations, performed in an unconditional fashion, are a manifestation of quantum erasure and can be employed to obtain various graph states from an initial cluster state. Starting with a sufficiently large cluster, the resulting graph states can then be used for universal quantum information processing. In the experiment, all variations of this cluster-shaping are demonstrated on a four-mode linear cluster state through homodyne measurements and feedforward.

quant-ph↗

Teleportation is necessary for faithful quantum state transfer through noisy channels of maximal rank

Quantum teleportation enables deterministic and faithful transmission of quantum states, provided a maximally entangled state is pre-shared between sender and receiver, and a one-way classical channel is available. Here, we prove that these resources are not only sufficient, but also necessary, for deterministically and faithfully sending quantum states through any fixed noisy channel of maximal rank, when a single use of the cannel is admitted. In other words, for this family of channels, there are no other protocols, based on different (and possibly cheaper) sets of resources, capable of replacing quantum teleportation.

quant-ph↗

Optical hybrid approaches to quantum information

This article reviews recent hybrid approaches to optical quantum information processing, in which both discrete and continuous degrees of freedom are exploited. There are well-known limitations to optical single-photon-based qubit and multi-photon-based qumode implementations of quantum communication and quantum computation, when the toolbox is restricted to the most practical set of linear operations and resources such as linear optics and Gaussian operations and states. The recent hybrid approaches aim at pushing the feasibility, the efficiencies, and the fidelities of the linear schemes to the limits, potentially adding weak or measurement-induced nonlinearities to the toolbox.

quant-ph↗

Separability Criterion for One-Sided Gaussian Channels

We show that the following nontrivial necessary precondition for an entanglement evolution equation for pure Gaussian states under one-sided Gaussian channels holds. Suppose a Gaussian quantum channel acts on one mode of a pure entangled multi-mode Gaussian input state. Then, for a fixed channel, either all output states are entangled or none of them are. In other words, if the input state is Gaussian, pure and entangled, the separability after a one-sided Gaussian quantum channel does not depend on the input state, but only on the channel. Furthermore, a simple linear-algebraic separability criterion allows to decide whether a given channel destroys the entanglement of pure entangled input states or leaves them entangled.

quant-ph↗

Near-unit fidelity entanglement distribution using Gaussian communication

We show how to distribute with percentage success probabilities almost perfectly entangled qubit memory pairs over repeater channel segments of the order of the optical attenuation distance. In addition to some weak, dispersive light-matter interactions, only Gaussian state transmissions and measurements are needed for this scheme, which even beats the coherent-state-benchmark for entanglement distribution based on error-free non-Gaussian measurements. This is achieved through two innovations: first, optical squeezed states are utilized instead of coherent states. Secondly, the amplitudes of the bright signal pulses are reamplified at each repeater station. This latter variation is a strategy reminiscent of classical repeaters and would be impossible in single-photon-based schemes.

quant-ph↗