Unifying parameter estimation and the Deutsch-Jozsa algorithm for continuous variables

We reveal a close relationship between quantum metrology and the Deutsch-Jozsa algorithm on continuous-variable quantum systems. We develop a general procedure, characterized by two parameters, that unifies parameter estimation and the Deutsch-Jozsa algorithm. Depending on which parameter we keep constant, the procedure implements either the parameter-estimation protocol or the Deutsch-Jozsa algorithm. The parameter-estimation part of the procedure attains the Heisenberg limit and is therefore optimal. Due to the use of approximate normalizable continuous-variable eigenstates, the Deutsch-Jozsa algorithm is probabilistic. The procedure estimates a value of an unknown parameter and solves the Deutsch-Jozsa problem without the use of any entanglement

Preparing multi-partite entanglement of photons and matter qubits

We show how to make event-ready multi-partite entanglement between qubits which may be encoded on photons or matter systems. Entangled states of matter systems, which can also act as single photon sources, can be generated using the entangling operation presented in quant-ph/0408040. We show how to entangle such sources with photon qubits, which may be encoded in the dual rail, polarization or time-bin degrees of freedom. We subsequently demonstrate how projective measurements of the matter qubits can be used to create entangled states of the photons alone. The state of the matter qubits is inherited by the generated photons. Since the entangling operation can be used to generate cluster states of matter qubits for quantum computing, our procedure enables us to create any (entangled) photonic quantum state that can be written as the outcome of a quantum computer.Comment: 10 pages, 4 figures; to appear in Journal of Optics

Fundamental Limits of Classical and Quantum Imaging

Quantum imaging promises increased imaging performance over classical protocols. However, there are a number of aspects of quantum imaging that are not well understood. In particular, it has so far been unknown how to compare classical and quantum imaging procedures. Here, we consider classical and quantum imaging in a single theoretical framework and present general fundamental limits on the resolution and the deposition rate for classical and quantum imaging. The resolution can be estimated from the image itself. We present a utility function that allows us to compare imaging protocols in a wide range of applications.Comment: 4 pages, 3 figures; accepted for Physical Review Letters, with updated title and fixed typo

Loss-tolerant operations in parity-code linear optics quantum computing

A heavy focus for optical quantum computing is the introduction of error-correction, and the minimisation of resource requirements. We detail a complete encoding and manipulation scheme designed for linear optics quantum computing, incorporating scalable operations and loss-tolerant architecture.Comment: 8 pages, 6 figure

Triangle Diagram with Off-Shell Coulomb T-Matrix for (In-)Elastic Atomic and Nuclear Three-Body Processes

The driving terms in three-body theories of elastic and inelastic scattering of a charged particle off a bound state of two other charged particles contain the fully off-shell two-body Coulomb T-matrix describing the intermediate-state Coulomb scattering of the projectile with each of the charged target particles. Up to now the latter is usually replaced by the Coulomb potential, either when using the multiple-scattering approach or when solving three-body integral equations. General properties of the exact and the approximate on-shell driving terms are discussed, and the accuracy of this approximation is investigated numerically, both for atomic and nuclear processes including bound-state excitation, for energies below and above the corresponding three-body dissociation threshold, over the whole range of scattering angles.Comment: 22 pages, 11 figures, figures can be obtained upon request from the Authors, revte

Dynamic programming algorithm for the vehicle routing problem with time windows and EC social legislation

In practice, apart from the problem of vehicle routing, schedulers also face the problem of nding feasible driver schedules complying with complex restrictions on drivers' driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose a dynamic programming approach for the vehicle routing problem with time windows including the EC social legislation on drivers' driving and working hours. Our algorithm includes all optional rules in these legislations, which are generally ignored in the literature. To include the legislation in the dynamic programming algorithm we propose a break scheduling method that does not increase the time-complexity of the algorithm. This is a remarkable eect that generally does not hold for local search methods, which have proved to be very successful in solving less restricted vehicle routing problems. Computational results show that our method finds solutions to benchmark instances with 18% less vehicles and 5% less travel distance than state of the art approaches. Furthermore, they show that including all optional rules of the legislation leads to an additional reduction of 4% in the number of vehicles and of 1.5%\ud regarding the travel distance. Therefore, the optional rules should be exploited in practice

Partial Wave Analyses of the pp data alone and of the np data alone

We present results of the Nijmegen partial-wave analyses of all NN scattering data below Tlab = 500 MeV. We have been able to extract for the first time the important np phase shifts for both I = 0 and I = 1 from the np scattering data alone. This allows us to study the charge independence breaking between the pp and np I = 1 phases. In our analyses we obtain for the pp data chi^2_{min}/Ndf = 1.13 and for the np data chi^2_{min}/Ndf = 1.12.Comment: Report THEF-NYM 94.04, 4 pages LaTeX, one PostScript figure appended. Contribution to the 14th Few-Body Conference, May 26 - 31, Williamsburg, V

Continuous-Variable Quantum Key Distribution using Thermal States

We consider the security of continuous-variable quantum key distribution using thermal (or noisy) Gaussian resource states. Specifically, we analyze this against collective Gaussian attacks using direct and reverse reconciliation where both protocols use either homodyne or heterodyne detection. We show that in the case of direct reconciliation with heterodyne detection, an improved robustness to channel noise is achieved when large amounts of preparation noise is added, as compared to the case when no preparation noise is added. We also consider the theoretical limit of infinite preparation noise and show a secure key can still be achieved in this limit provided the channel noise is less than the preparation noise. Finally, we consider the security of quantum key distribution at various electromagnetic wavelengths and derive an upper bound related to an entanglement-breaking eavesdropping attack and discuss the feasibility of microwave quantum key distribution.Comment: 12 pages, 11 figures. Updated from published version with some minor correction