Lu, C. - Y., Zhou, X. - Q., Gühne, O., Gao, W. - B., Zhang, J., Yuan, Z. - S., et al. (2007). Experimental entanglement of six photons in graph states. Nat. Phys., 3(2), 91–95.
Abstract: Graph states-multipartite entangled states that can be represented by mathematical graphs-are important resources for quantum computation, quantum error correction, studies of multiparticle entanglement and fundamental tests of non-locality and decoherence. Here, we demonstrate the experimental entanglement of six photons and engineering of multiqubit graph states. We have created two important examples of graph states, a six-photon Greenberger-Horne-Zeilinger state, the largest photonic Schrödinger cat so far, and a six-photon cluster state, a state-of-the-art `one-way quantum computer'. With small modifications, our method allows us, in principle, to create various further graph states, and therefore could open the way to experimental tests of, for example, quantum algorithms or loss- and fault-tolerant one-way quantum computation.
|
Ursin, R., Tiefenbacher, F., Schmitt-Manderbach, T., Weier, H., Scheidl, T., Lindenthal, M., et al. (2007). Entanglement-based quantum communication over 144km. Nat. Phys., 3(7), 481–486.
Abstract: Quantum entanglement is the main resource to endow the field of quantum information processing with powers that exceed those of classical communication and computation. In view of applications such as quantum cryptography or quantum teleportation, extension of quantum-entanglement-based protocols to global distances is of considerable practical interest. Here we experimentally demonstrate entanglement-based quantum key distribution over 144km. One photon is measured locally at the Canary Island of La Palma, whereas the other is sent over an optical free-space link to Tenerife, where the Optical Ground Station of the European Space Agency acts as the receiver. This exceeds previous free-space experiments by more than an order of magnitude in distance, and is an essential step towards future satellite-based quantum communication and experimental tests on quantum physics in space.
|
Pirandola, S., Mancini, S., Lloyd, S., & Braunstein, S. L. (2008). Continuous-variable quantum cryptography using two-way quantum communication. Nat. Phys., 4(9), 726–730.
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.
|
Zurek, W. H. (2009). Quantum Darwinism. Nat. Phys., 5(3), 181–188.
Abstract: Quantum Darwinism describes the proliferation, in the environment, of multiple records of selected states of a quantum system. It explains how the quantum fragility of a state of a single quantum system can lead to the classical robustness of states in their correlated multitude; shows how effective `wave-packet collapse' arises as a result of the proliferation throughout the environment of imprints of the state of the system; and provides a framework for the derivation of Born's rule, which relates the probabilities of detecting states to their amplitudes. Taken together, these three advances mark considerable progress towards settling the quantum measurement problem.
|
Shor, P. W. (2009). Quantum information theory: The bits don't add up. Nat. Phys., 5, 247–248.
Abstract: A counterexample to the 'additivity question', the most celebrated open problem in the mathematical theory of quantum information, casts doubt on the possibility of finding a simple expression for the information capacity of a quantum channel.
|
Hanneke, D., Home, J. P., Jost, J. D., Amini, J. M., Leibfried, D., & Wineland, D. J. (2010). Realization of a programmable two-qubit quantum processor. Nat. Phys., 6(1), 13–16.
Abstract: The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. In the context of quantum information, `universal' refers to the ability to carry out arbitrary unitary transformations in the system's computational space. Combining arbitrary single-quantum-bit (qubit) gates with an entangling two-qubit gate provides a set of gates capable of achieving universal control of any number of qubits, provided that these gates can be carried out repeatedly and between arbitrary pairs of qubits. Although gate sets have been demonstrated in several technologies, they have so far been tailored towards specific tasks, forming a small subset of all unitary operators. Here we demonstrate a quantum processor that can be programmed with 15 classical inputs to realize arbitrary unitary transformations on two qubits, which are stored in trapped atomic ions. Using quantum state and process tomography, we characterize the fidelity of our implementation for 160 randomly chosen operations. This universal control is equivalent to simulating any pairwise interaction between spin-1/2 systems. A programmable multiqubit register could form a core component of a large-scale quantum processor, and the methods used here are suitable for such a device.
|
|
Trabesinger, A. (2009). Quantum mechanics: Shaken foundations. Nat. Phys., 5(12), 863.
|
Bialczak, R. C., Ansmann, M., Hofheinz, M., Lucero, E., Neeley, M., O'Connell, A. D., et al. (2010). Quantum process tomography of a universal entangling gate implemented with Josephson phase qubits. Nat. Phys., 6(6), 409–413.
Abstract: Quantum gates must perform reliably when operating on standard input basis states and on complex superpositions thereof. Experiments using superconducting qubits have validated truth tables for particular implementations of, for example, the controlled-NOT gate, but have not fully characterized gate operation for arbitrary superpositions of input states. Here we demonstrate the use of quantum process tomography (QPT) to fully characterize the performance of a universal entangling gate between two superconducting qubits. Process tomography permits complete gate analysis, but requires precise preparation of arbitrary input states, control over the subsequent qubit interaction and ideally simultaneous single-shot measurement of output states. In recent work, it has been proposed to use QPT to probe noise properties and time dynamics of qubit systems and to apply techniques from control theory to create scalable qubit benchmarking protocols. We use QPT to measure the fidelity and noise properties of an entangling gate. In addition to demonstrating a promising fidelity, our entangling gate has an on-to-off ratio of 300, a level of adjustable coupling that will become a requirement for future high-fidelity devices. This is the first solid-state demonstration of QPT in a two-qubit system, as QPT has previously been demonstrated only with single solid-state qubits.
|
Perseguers, S., Lewenstein, M., Acín, A., & Cirac, J. I. (2010). Quantum random networks. Nat. Phys., 6(7), 539–543.
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.
|
Feofanov, A. K., Oboznov, V. A., Bol'Ginov, V. V., Lisenfeld, J., Poletto, S., Ryazanov, V. V., et al. (2010). Implementation of superconductor/ferromagnet/ superconductor. Nat. Phys., 6(8), 593–597.
Abstract: High operation speed and low energy consumption may allow the superconducting digital single-flux-quantum circuits to outperform traditional complementary metal-oxide-semiconductor logic. The remaining major obstacle towards high element densities on-chip is a relatively large cell size necessary to hold a magnetic flux quantum Φ0. Inserting a π-type Josephson junction in the cell is equivalent to applying flux Φ0/2 and thus makes it possible to solve this problem. Moreover, using π-junctions in superconducting qubits may help to protect them from noise. Here we demonstrate the operation of three superconducting circuits-two of them are classical and one quantum-that all utilize such π-phase shifters realized using superconductor/ferromagnet/superconductor sandwich technology. The classical circuits are based on single-flux-quantum cells, which are shown to be scalable and compatible with conventional niobium-based superconducting electronics. The quantum circuit is a π-biased phase qubit, for which we observe coherent Rabi oscillations. We find no degradation of the measured coherence time compared to that of a reference qubit without a π-junction.
|
