Entangling characterization of (SWAP)1/m and Controlled unitary gates

We study the entangling power and perfect entangler nature of (SWAP)1/m, for m>=1, and controlled unitary (CU) gates. It is shown that (SWAP)1/2 is the only perfect entangler in the family. On the other hand, a subset of CU which is locally equivalent to CNOT is identified. It is shown that the subset, which is a perfect entangler, must necessarily possess the maximum entangling power.Comment: 12 pages, 1 figure, One more paragraph added in Introductio

Detection of Asynchronous Message Passing Errors Using Static Analysis

Concurrent programming is hard and prone to subtle errors. In this paper we present a static analysis that is able to detect some commonly occurring kinds of message passing errors in languages with dynamic process creation and communication based on asynchronous message passing. Our analysis is completely automatic, fast, and strikes a proper balance between soundness and completeness: it is effective in detecting errors and avoids false alarms by computing a close approximation of the interprocess communication topology of programs. We have integrated our analysis in dialyzer, a widely used tool for detecting software defects in Erlang programs, and demonstrate its effectiveness on libraries and applications of considerable size. Despite the fact that these applications have been developed over a long period of time and are reasonably well-tested, our analysis has managed to detect a significant number of previously unknown message passing errors in their code

A true concurrent model of smart contracts executions

The development of blockchain technologies has enabled the trustless execution of so-called smart contracts, i.e. programs that regulate the exchange of assets (e.g., cryptocurrency) between users. In a decentralized blockchain, the state of smart contracts is collaboratively maintained by a peer-to-peer network of mutually untrusted nodes, which collect from users a set of transactions (representing the required actions on contracts), and execute them in some order. Once this sequence of transactions is appended to the blockchain, the other nodes validate it, re-executing the transactions in the same order. The serial execution of transactions does not take advantage of the multi-core architecture of modern processors, so contributing to limit the throughput. In this paper we propose a true concurrent model of smart contract execution. Based on this, we show how static analysis of smart contracts can be exploited to parallelize the execution of transactions.Comment: Full version of the paper presented at COORDINATION 202

Iowa Swiss-type cheese

New types of cheese for Iowa have been receiving the attention of the Iowa Agricultural Experiment Station for a number of years. A previous publication (1) described the method of manufacture which has been used in the production of many thousands of pounds of Iowa Blue Cheese. This publication deals with the process used in the Iowa State College laboratories in manufacturing a Swiss-type cheese. In the course of these experiments a total of 25,136 lbs. of the cheese has been manufactured and marketed, utilizing approximately a quarter of a million pounds of milk

Generalized Limits for Parameter Sensitivity via Quantum Ziv-Zakai Bound

We study the generalized limit for parameter sensitivity in quantum estimation theory considering the effects of repeated and adaptive measurements. Based on the quantum Ziv-Zakai bound, we derive some lower bounds for parameter sensitivity when the Hamiltonian of system is unbounded and when the adaptive measurements are implemented on the system. We also prove that the parameter sensitivity is bounded by the limit of the minimum detectable parameter. In particular, we examine several known states in quantum phase estimation with non-interacting photons, and show that they can not perform better than Heisenberg limit in a much simpler way with our result.Comment: 8pages, 5 figure

Liveness-Driven Random Program Generation

Randomly generated programs are popular for testing compilers and program analysis tools, with hundreds of bugs in real-world C compilers found by random testing. However, existing random program generators may generate large amounts of dead code (computations whose result is never used). This leaves relatively little code to exercise a target compiler's more complex optimizations. To address this shortcoming, we introduce liveness-driven random program generation. In this approach the random program is constructed bottom-up, guided by a simultaneous structural data-flow analysis to ensure that the generator never generates dead code. The algorithm is implemented as a plugin for the Frama-C framework. We evaluate it in comparison to Csmith, the standard random C program generator. Our tool generates programs that compile to more machine code with a more complex instruction mix.Comment: Pre-proceedings paper presented at the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 10-12 October 2017 (arXiv:1708.07854

Age of the Peach Springs Tuff, Southeastern California and Western Arizona

Sanidine separates from pumice of the early Miocene Peach Springs Tuff are concordantly dated at 18.5 ± 0.2 Ma by two isotopic techniques. The Peach Springs Tuff is the only known unit that can be correlated between isolated outcrops of Miocene strata from the central Mojave Desert of southeastern California to the western Colorado Plateau in Arizona, across five structural provinces, a distance of 350 km. Thus the age of the Peach Springs Tuff is important to structural and paleogeographic reconstructions of a large region. Biotite and sanidine separates from bulk samples of the Peach Springs Tuff from zones of welding and vapor-phase alteration have not produced consistent ages by the K-Ar method. Published ages of mineral separates from 17 localities ranged from 16.2 to 20.5 Ma. Discordant 40Ar/39Ar incremental release spectra were obtained for one biotite and two of the sanidine separates. Ages that correspond to the last gas increments are as old as 27 Ma. The 40Ar/39Ar incremental release determinations on sanidine separated from blocks of Peach Springs Tuff pumice yield ages of 18.3 ± 0.3 and 18.6 ± 0.4 Ma. Laser fusion measurements yield a mean age of 18.51 ± 0.10. The results suggest that sanidine and biotite K-Ar ages older than about 18.5 Ma are due to inherited Ar from pre-Tertiary contaminants, which likely were incorporated into the tuff during deposition. Sanidine K-Ar ages younger than 18 Ma probably indicate incomplete extraction of radiogenic 40Ar, whereas laser fusion dates of biotite and hornblende younger than 18 Ma likely are due to postdepositional alteration. Laser fusion ages as high as 19.01 Ma on biotite grains from pumice suggest that minerals from pre-Tertiary country rocks also were incorporated in the magma chamber