|
|
Saffman M. Quantum computing: A quantum telecom link. Nat Phys. 2010;6(11):838–9.
Abstract: Converting data-carrying photons to telecommunication wavelengths enables distribution of quantum information over long distances.
|
|
|
|
Raussendorf R. Quantum computing: Shaking up ground states. Nat Phys. 2010;6(11):840–1.
Abstract: Measurement-based quantum computation with an Affleck-Kennedy-Lieb-Tasaki state is experimentally realized for the first time.
|
|
|
|
Prevedel R, Hamel DR, Colbeck R, Fisher K, Resch KJ. Experimental investigation of the uncertainty principle in the presence of quantum memory and its application to witnessing entanglement. Nat Phys. 2011;7(10):757–61.
Abstract: Heisenberg's uncertainty principle provides a fundamental limitation on the ability of an observer holding classical information to predict the outcome when one of two measurements is performed on a quantum system. However, an observer with access to a particle (stored in a quantum memory) which is entangled with the system generally has a reduced uncertainty: indeed, if the particle and system are maximally entangled, the observer can perfectly predict the outcome of whichever measurement is chosen. This effect has recently been quantified in a new entropic uncertainty relation. Here we experimentally investigate this relation, showing its effectiveness as an efficient entanglement witness. We use entangled photon pairs, an optical delay line serving as a simple quantum memory and fast, active feed-forward. Our results quantitatively agree with the new uncertainty relation. Our technique acts as a witness for almost all entangled states in our experiment as we obtain lower uncertainties than would be possible without the entangled particle.
|
|
|
|
Pirandola S, Mancini S, Lloyd S, Braunstein SL. Continuous-variable quantum cryptography using two-way quantum communication. Nat Phys. 2008;4(9):726–30.
Abstract: Quantum cryptography has recently been extended to continuous-variable systems, such as the bosonic modes of the electromagnetic field possessing continuous degrees of freedom. In particular, several cryptographic protocols have been proposed and experimentally implemented using bosonic modes with Gaussian statistics. These protocols have shown the possibility of reaching very high secret key rates, even in the presence of strong losses in the quantum communication channel. Despite this robustness to loss, their security can be affected by more general attacks where extra Gaussian noise is introduced by the eavesdropper. Here, we show a `hardware solution' for enhancing the security thresholds of these protocols. This is possible by extending them to two-way quantum communication where subsequent uses of the quantum channel are suitably combined. In the resulting two-way schemes, one of the honest parties assists the secret encoding of the other, with the chance of a non-trivial superadditive enhancement of the security thresholds. These results should enable the extension of quantum cryptography to more complex quantum communications.
|
|
|
|
Perseguers S, Lewenstein M, Acín A, Cirac JI. Quantum random networks. Nat Phys. 2010;6(7):539–43.
Abstract: Quantum mechanics offers new possibilities to process and transmit information. In recent years, algorithms and cryptographic protocols exploiting the superposition principle and the existence of entangled states have been designed. They should allow us to realize communication and computational tasks that outperform any classical strategy. Here we show that quantum mechanics also provides fresh perspectives in the field of random networks. Already the simplest model of a classical random graph changes markedly when extended to the quantum case, where we obtain a distinct behaviour of the critical probabilities at which different subgraphs appear. In particular, in a network of N nodes, any quantum subgraph can be generated by local operations and classical communication if the entanglement between pairs of nodes scales as N-2. This result also opens up new vistas in the domain of quantum networks and their applications.
|
|
