Correcting the effects of spontaneous emission on cold-trapped ions

We propose two quantum error-correction schemes which increase the maximum storage time for qubits in a system of cold-trapped ions, using a minimal number of ancillary qubits. Both schemes consider only the errors introduced by the decoherence due to spontaneous emission from the upper levels of the ions. Continuous monitoring of the ion fluorescence is used in conjunction with selective coherent feedback to eliminate these errors immediately following spontaneous emission events.

Quantum beats in spontaneous emission from two atoms in a detuned squeezed vacuum

The time evolution of the populations of the collective states of a two-atom system in a squeezed vacuum can exhibit quantum beats. We show that the effect appears only when the carrier frequency of the squeezed field is detuned from the atomic resonance. Moreover, we find that the quantum beats are not present for the case in which the two-photon correlation strength is the maximum possible for a field with a classical analog. We also show that the population inversion between the excited collective states, found for the resonant squeezed vacuum, is sensitive to the detuning and the two-photon correlations. For large detunings or a field with a classical analog there is no inversion between the collective states. Observation of the quantum beats or the population inversion would confirm the essentially quantum-mechanical nature of the squeezed vacuum. (C) 1997 Optical Society of America.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.