Full control by locally induced relaxation

We demonstrate a scheme for controlling a large quantum system by acting on a small subsystem only. The local control is mediated to the larger system by some fixed coupling Hamiltonian. The scheme allows us to transfer arbitrary and unknown quantum states from a memory to the large system ("upload access") as well as the inverse ("download access"). We study the sufficient conditions of the coupling Hamiltonian and give lower bounds on the fidelities for downloading and uploading.     

Cation disorder in NaW2O6+δ·nH2−zO post-ion exchange with K, Rb, Sr, and Cs

The structure of the defect pyrochlore NaW₂O_6+δ·nH_2−zO after ion exchange with K, Rb, Sr or Cs for Na has been investigated using thermal analysis, solid-state nuclear magnetic resonance, laboratory X-ray and neutron diffraction methods. Neutron diffraction studies show that both the A-type cations (Na⁺, K⁺, Rb⁺, and/or Cs⁺) and the water molecules reside within the channels that form in the 111 direction of the W₂O₆ framework and that these strongly interact. The analytical results suggest that the water and A-type cations compete for space in the tunnels within the W₂O₆ pyrochlore framework, with the total number of water molecules and cations being approximately constant in the six samples investigated. The interplay between the cations and water explains the non-linear dependence of the a lattice parameter on the choice of cation. It appears that the ion-exchange capacity of the material will be controlled by the amount of water initially present in the sample.     

Entangling macroscopic oscillators exploiting radiation pressure

It is shown that radiation pressure can be profitably used to entangle macroscopic oscillators like movable mirrors, using present technology. We prove a new sufficient criterion for entanglement and show that the achievable entanglement is robust against thermal noise. Its signature can be revealed using common optomechanical readout apparatus.     

Probenecid and benzamide: DSC applied to the study of an “impossible” pharmaceutical system

Journal of Thermal Analysis and Calorimetry - The study of the binary system probenecid–benzamide is an excellent example of the power and the limits of thermal analysis applied to the...     

Properties of quantum Markovian master equations

In this paper we give an essentially self-contained account of some general structural properties of the dynamics of quantum open Markovian systems. We review some recent results regarding the problem of the classification of quantum Markovian master equations and the limiting conditions under which the dynamical evolution of a quantum open system obeys an exact semigroup law (weak coupling limit and singular coupling limit). We discuss a general form of quantum detailed balance and its relation to thermal relaxation and to microreversibility.     

Markov dilations and quantum detailed balance

We construct quantum stochastic processes whose multi-time correlation functions, with suitable time ordering, can be obtained from a quantum dynamical semigroup. We prove that such a process defines a stationary Markov dilation of the associated semigroup if and only if (up to technicalities) the semigroup satisfies the quantum detailed balance condition with respect to its stationary state.     

Quantum private queries

We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the database provider without revealing which item he or she retrieved: if the provider tries to obtain information on the query, the person querying the database can find it out. The protocol ensures also perfect data privacy of the database: the information that the user can retrieve in a single query is bounded and does not depend on the size of the database. With respect to the known (quantum and classical) strategies for private information retrieval, our protocol displays an exponential reduction in communication complexity and in running-time computational complexity.