Consider two bosonic modes which are prepared in one of two possible Gaussian states with the same local energy: either a tensor-product thermal state (with zero correlations) or a separable Gaussian state with maximal correlations (with both classical and quantum correlations, the latter being quantified by quantum discord). For the discrimination of these states, we compare the optimal joint coherent measurement with the best local measurement based on single-mode Gaussian detections. We show how the coherent measurement always strictly outperforms the local detection strategy for both single- and multi-copy discrimination. This means that using local Gaussian measurements (assisted by classical communication) is strictly suboptimal in detecting discord. A better performance may only be achieved by either using non Gaussian measurements (non linear optics) or coherent non-local measurements.
We consider the secret key capacity of the thermal loss channel, which is modeled by a beam splitter mixing an input signal mode with an environmental thermal mode. This capacity is the maximum value of secret bits that two remote parties can generate by means of the most general adaptive protocols assisted by unlimited and two-way classical communication. To date, only upper and lower bounds are known. The present work improves the lower bound by resorting to Gaussian protocols based on suitable trusted-noise detectors.
We consider two remote parties connected to a relay by two quantum channels. To generate a secret key, they transmit coherent states to the relay, where the states are subject to a continuous-variable (CV) Bell detection. We study the ideal case where Alice's channel is lossless, i.e., the relay is locally in her lab and the Bell detection is perfomed with unit efficiency. This configuration allows us to explore the optimal performances achievable by CV measurement-device-independent quantum key distribution. This corresponds to the limit of a trusted local relay, where the detection loss can be re-scaled. Our theoretical analysis is confirmed by an experimental simulation where 10-4 secret bits per use can potentially be distributed at 170km assuming ideal reconciliation.
Recently, we have shown the advantages of two-way quantum communications in continuous variable quantum
cryptography. Thanks to this new approach, two honest users can achieve a non-trivial security enhancement as
long as the Gaussian interactions of an eavesdropper are independent and identical. In this work, we consider asymmetric strategies where the Gaussian interactions can be different and classically correlated. For several attacks of this kind, we prove that the enhancement of security still holds when the two-way protocols are used in direct reconciliation.
Processing information quantum mechanically is known to enable new communication and computational scenarios that cannot be accessed with conventional information technology (IT). We present here a new approach to scalable quantum computing---a "qubus computer"---which realizes qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be "static" matter qubits or "flying" optical qubits, but the scheme we focus on here is particularly suited to matter qubits. Universal two-qubit quantum gates may be effected by schemes which involve measurement of the bus mode, or by schemes where the bus disentangles automatically and no measurement is needed. This approach enables a parity gate between qubits, mediated by a bus, enabling near-deterministic Bell state measurement and entangling gates. Our approach is therefore the basis for very efficient, scalable QIP, and provides a natural method for distributing such processing, combining it with quantum communication.
Quantum optics has proved a fertile field for experimental tests of
quantum information science, from experimental verification of the
violation of the Bell inequalities to quantum teleportation. However it was long believed that quantum optics would not provide a practical path to efficient and scaleable quantum computation, and most current efforts to achieve a scaleable quantum computer have focussed on solid state implementations. This orthodoxy was challenged recently when Knill et al. showed that given single photon sources and single photon detectors, linear optics alone would suffice to implement efficient quantum computation. While this result is surprising, the complexity of the optical networks required is daunting. In this talk we propose an efficient scheme which is elegant in its simplicity. We indicate how fundamental single and two qubit gates can be achieved. By encoding the quantum information in multi-photon coherent states, rather than single photon states, simple optical manipulations acquire unexpected power. As an application of this new information processing ability we investigate
a class of high precision measurements. We show how superpositions of
coherent states allow displacement measurements at the Heisenberg limit. Entangling many superpositions of coherent states offers a significant advantage over a single mode superposition states with the same mean photon number.
We show how to beat the `fundamental' noise limits in optical lithography using entangled quantum states. In this talk we will give the theoretical background to optical lithography and its quantum formulation. A proof-in-principle experimental demonstration is described.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.