We calculate the dissipative dynamics of two-qubit quantum discord under Markovian environments. We analyze various dissipative channels such as dephasing, depolarizing, and generalized amplitude damping, assuming independent perturbation, in which each qubit is coupled to its own channel. Choosing initial conditions that manifest the so-called sudden death of entanglement, we compare the dynamics of entanglement with that of quantum discord. We show that in all cases where entanglement suddenly disappears, quantum discord vanishes only in the asymptotic limit, behaving similarly to individual decoherence of the qubits, even at finite temperatures. Hence, quantum discord is more robust than the entanglement against to decoherence so that quantum algorithms based only on quantum discord correlations may be more robust than those based on entanglement.Comment: 4 figures, 4 page

SUMMARYParallel programs present some features such as concurrency, communication and synchronization that make the test a challenging activity. Because of these characteristics, the direct application of traditional testing is not always possible and adequate testing criteria and tools are necessary. In this paper we investigate the challenges of validating message-passing parallel programs and present a set of specific testing criteria. We introduce a family of structural testing criteria based on a test model. The model captures control and data flow of the message-passing programs, by considering their sequential and parallel aspects. The criteria provide a coverage measure that can be used for evaluating the progress of the testing activity and also provide guidelines for the generation of test data. We also describe a tool, called ValiPar, which supports the application of the proposed testing criteria. Currently, ValiPar is configured for parallel virtual machine (PVM) and message-passing interface (MPI). Results of the application of the proposed criteria to MPI programs are also presented and analyzed.

No abstract

Abstract. This paper presents structural testing criteria for validation of semaphore-based multithread programs exploring control, data, communication and synchronization information. A post-mortem method based on timestamps is defined to determine the implicit communication among threads using shared variables. The applicability of the coverage testing criteria is illustrated by a case study.