Detection of geometric phases in superconducting nanocircuits

When a quantum-mechanical system undergoes an adiabatic cyclic evolution, it acquires a geometrical phase factor' in addition to the dynamical one; this effect has been demonstrated in a variety of microscopic systems. Advances in nanotechnology should enable the laws of quantum dynamics to be tested at the macroscopic level, by providing controllable artificial two-level systems (for example, in quantum dots and superconducting devices). Here we propose an experimental method to detect geometric phases in a superconducting device. The setup is a Josephson junction nanocircuit consisting of a superconducting electron box. We discuss how interferometry based on geometrical phases may be realized, and show how the effect may be applied to the design of gates for quantum computation.     

Geometric quantum computation using nuclear magnetic resonance

A significant development in computing has been the discovery that the computational power of quantum computers exceeds that of Turing machines. Central to the experimental realization of quantum information processing is the construction of fault-tolerant quantum logic gates. Their operation requires conditional quantum dynamics, in which one sub-system undergoes a coherent evolution that depends on the quantum state of another sub-system; in particular, the evolving sub-system may acquire a conditional phase shift. Although conventionally dynamic in origin, phase shifts can also be geometric. Conditional geometric (or 'Berry') phases depend only on the geometry of the path executed, and are therefore resilient to certain types of errors; this suggests the possibility of an intrinsically fault-tolerant way of performing quantum gate operations. Nuclear magnetic resonance techniques have already been used to demonstrate both simple quantum information processing and geometric phase shifts. Here we combine these ideas by performing a nuclear magnetic resonance experiment in which a conditional Berry phase is implemented, demonstrating a controlled phase shift gate.     

Quantifying entanglement in macroscopic systems

Traditionally, entanglement was considered to be a quirk of microscopic objects that defied a common-sense explanation. Now, however, entanglement is recognized to be ubiquitous and robust. With the realization that entanglement can occur in macroscopic systems - and with the development of experiments aimed at exploiting this fact - new tools are required to define and quantify entanglement beyond the original microscopic framework.     

The thermodynamic meaning of negative entropy

The heat generated by computations is not only an obstacle to circuit miniaturization but also a fundamental aspect of the relationship between information theory and thermodynamics. In principle, reversible operations may be performed at no energy cost; given that irreversible computations can always be decomposed into reversible operations followed by the erasure of data, the problem of calculating their energy cost is reduced to the study of erasure. Landauer's principle states that the erasure of data stored in a system has an inherent work cost and therefore dissipates heat. However, this consideration assumes that the information about the system to be erased is classical, and does not extend to the general case where an observer may have quantum information about the system to be erased, for instance by means of a quantum memory entangled with the system. Here we show that the standard formulation and implications of Landauer's principle are no longer valid in the presence of quantum information. Our main result is that the work cost of erasure is determined by the entropy of the system, conditioned on the quantum information an observer has about it. In other words, the more an observer knows about the system, the less it costs to erase it. This result gives a direct thermodynamic significance to conditional entropies, originally introduced in information theory. Furthermore, it provides new bounds on the heat generation of computations: because conditional entropies can become negative in the quantum case, an observer who is strongly correlated with a system may gain work while erasing it, thereby cooling the environment.     

Experimental one-way quantum computing

Standard quantum computation is based on sequences of unitary quantum logic gates that process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is entirely different. It has changed our understanding of the requirements for quantum computation and more generally how we think about quantum physics. This new model requires qubits to be initialized in a highly entangled cluster state. From this point, the quantum computation proceeds by a sequence of single-qubit measurements with classical feedforward of their outcomes. Because of the essential role of measurement, a one-way quantum computer is irreversible. In the one-way quantum computer, the order and choices of measurements determine the algorithm computed. We have experimentally realized four-qubit cluster states encoded into the polarization state of four photons. We characterize the quantum state fully by implementing experimental four-qubit quantum state tomography. Using this cluster state, we demonstrate the feasibility of one-way quantum computing through a universal set of one- and two-qubit operations. Finally, our implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.