Comparison of SPIN and VIS for protocol verification

In this paper, we compare and contrast SPIN and VIS, two widely used formal verification tools. In particular, we devote special attention to the efficiency of these tools for the verification of communications protocols that can be implemented either in software or hardware. As a basis of our comparison, we formally describe and verify the Asynchronous Transfer Mode Ring (ATMR) medium access protocol using SPIN and its hardware model using VIS. We believe that this study is of particular interest as more and more protocols, like ATM protocols, are implemented in hardware to match high-speed requirements

Irreversibility and the arrow of time in a quenched quantum system

Irreversibility is one of the most intriguing concepts in physics. While microscopic physical laws are perfectly reversible, macroscopic average behavior has a preferred direction of time. According to the second law of thermodynamics, this arrow of time is associated with a positive mean entropy production. Using a nuclear magnetic resonance setup, we measure the nonequilibrium entropy produced in an isolated spin-1/2 system following fast quenches of an external magnetic field and experimentally demonstrate that it is equal to the entropic distance, expressed by the Kullback-Leibler divergence, between a microscopic process and its time-reverse. Our result addresses the concept of irreversibility from a microscopic quantum standpoint.Comment: 8 pages, 7 figures, RevTeX4-1; Accepted for publication Phys. Rev. Let

Entanglement between a diamond spin qubit and a photonic time-bin qubit at telecom wavelength

We report on the realization and verification of quantum entanglement between an NV electron spin qubit and a telecom-band photonic qubit. First we generate entanglement between the spin qubit and a 637 nm photonic time-bin qubit, followed by photonic quantum frequency conversion that transfers the entanglement to a 1588 nm photon. We characterize the resulting state by correlation measurements in different bases and find a lower bound to the Bell state fidelity of F = 0.77 +/- 0.03. This result presents an important step towards extending quantum networks via optical fiber infrastructure

Virtual orbital many-body expansions: A possible route towards the full configuration interaction limit

In the present letter, it is demonstrated how full configuration interaction (FCI) results in extended basis sets may be obtained to within sub-kJ/mol accuracy by decomposing the energy in terms of many-body expansions in the virtual orbitals of the molecular system at hand. This extension of the FCI application range lends itself to two unique features of the current approach, namely that the total energy calculation can be performed entirely within considerably reduced orbital subspaces and may be so by means of embarrassingly parallel programming. Facilitated by a rigorous and methodical screening protocol and further aided by expansion points different from the Hartree-Fock solution, all-electron numerical results are reported for H$_2$O in polarized core-valence basis sets ranging from double-$\zeta$ (10 $e$, 28 $o$) to quadruple-$\zeta$ (10 $e$, 144 $o$) quality.Comment: 20 pages, 3 figures, 1 table. * With respect to the original arXiv version (v1), the present version of the letter contains updated results. The original TZ and QZ values were unfortunately in error due to a subtle PySCF bug, which has since then been fixe

Supporting Domain-Specific State Space Reductions through Local Partial-Order Reduction

Model checkers offer to automatically prove safety and liveness properties of complex concurrent software systems, but they are limited by state space explosion. Partial-Order Reduction (POR) is an effective technique to mitigate this burden. However, applying existing notions of POR requires to verify conditions based on execution paths of unbounded length, a difficult task in general. To enable a more intuitive and still flexible application of POR, we propose local POR (LPOR). LPOR is based on the existing notion of statically computed stubborn sets, but its locality allows to verify conditions in single states rather than over long paths. As a case study, we apply LPOR to message-passing systems. We implement it within the Java Pathfinder model checker using our general Java-based LPOR library. Our experiments show significant reductions achieved by LPOR for model checking representative message-passing protocols and, maybe surprisingly, that LPOR can outperform dynamic POR. © 2011 IEEE