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.
|
|
Trabesinger, A. (2009). Quantum mechanics: Shaken foundations. Nat. Phys., 5(12), 863.
|
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.
|
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.
|
