Symmetrised Characterisation of Noisy Quantum Processes

A major goal of developing high-precision control of many-body quantum systems is to realise their potential as quantum computers. Probably the most significant obstacle in this direction is the problem of "decoherence": the extreme fragility of quantum systems to environmental noise and other control limitations. The theory of fault-tolerant quantum error correction has shown that quantum computation is possible even in the presence of decoherence provided that the noise affecting the quantum system satisfies certain well-defined theoretical conditions. However, existing methods for noise characterisation have become intractable already for the systems that are controlled in today's labs. In this paper we introduce a technique based on symmetrisation that enables direct experimental characterisation of key properties of the decoherence affecting a multi-body quantum system. Our method reduces the number of experiments required by existing methods from exponential to polynomial in the number of subsystems. We demonstrate the application of this technique to the optimisation of control over nuclear spins in the solid state.Comment: About 12 pages, 5 figure

On the Hybrid Extension of CTL and CTL+

The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that H1CTL+ and H1CTL, the hybrid extensions with one variable of CTL+ and CTL, respectively, are expressively equivalent but H1CTL+ is exponentially more succinct than H1CTL. On the other hand, HCTL+, the hybrid extension of CTL with arbitrarily many variables does not capture CTL*, as it even cannot express the simple CTL* property EGFp. The satisfiability problem for H1CTL+ is complete for triply exponential time, this remains true for quite weak fragments and quite strong extensions of the logic

EVALUATION OF MECHANICAL STRENGTH AFTER COMPRESSION OF METFORMIN 500MG TABLETS PRODUCED BY DIFFERENT WET ROUTES

Objective: This work evaluated the post-compression hardness gain of Metformin tablets made from two granulates of the same formulation, but with different formation principles, one by the fluidized bed and the other in a V-shaped mixer. Methods: The base granulate for the production of the tablets was prepared using Metformin HCL as the main active ingredient. After compression, the prepared tablets were tested with different evaluation parameters like relative humidity, apparent and compacted density, granulometric dispersion, hardness, moisture content, and friability for complete characterization. Results: All prepared samples were within the pre-established humidity ranges (MT1 = 3.31%, MT2 = 2.72%, MT3 = 1.73%, LF1 = 3.25%, LF2 = 2.43% and LF3 = 1.79%). The density determination showed that the granules produced in the fluidized bed are less dense than those of the V mixer. LF2 sample had an apparent density of 0.525 g/ml and a compacted density of 0.546 g/ml, while the MT2 sample had an apparent density of 0.711 g/ml and a compacted density of 0.738 g/ml, corroborating the greater porosity of granules produced in a fluidized bed. It was found that there is a difference in the increase in hardness between the two granulation methods. The tablets manufactured from the granules elaborated in a V-shaped mixer showed a greater gain in comparison with those produced in the fluid bed. The MT1 sample had the highest gain percentage, reaching 99.47%, 48 h after compression. The MT2 sample obtained, for the same time, 76.34%, at a much slower speed than MT1. As for the other samples, all increased between 24 and 42%. These results are justified by the migration of agglutination liquid that occurs during the drying step. Conclusion: This work demonstrated that the product Metformin 500 mg tablet has increased hardness after compression, with most significance in the first hour after the procedure. It was possible to verify that the tablets made from the granules produced in a V-shaped mixer have a greater increase in hardness than those produced by the fluidized bed, in the same humidity range

Winter 1978

The Psychological Approach to Golf Course Management (page 3) Massachusetts Pesticide News (6) Cross-Country Skiing: Good Winter Recreation that Pays its Own Way (8) Sacrification of Large Scale Areas, e.g. Golf Course Fairways, Winter Games Areas, Etc. (15) Plant Materials for Outlying Areas Biological Control of Crop Diseases (18

Deciding Full Branching Time Logic by Program Transformation

We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL*) properties of finite state reactive systems. The finite state systems and the CTL* properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and the given property, into a monadic ω -program, that is, a stratified program defining nullary or unary predicates on infinite lists. This transformation is performed by applying unfold/fold rules that preserve the perfect model of the initial program. In the second step we verify the property of interest by using a proof method for monadic ω-program

Model Checking CTL is Almost Always Inherently Sequential

The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator, we systematically prove model checking to be either inherently sequential (P-complete) or very efficiently parallelizable (LOGCFL-complete). For most fragments, however, model checking for CTL is already P-complete. Hence our results indicate that, in cases where the combined complexity is of relevance, approaching CTL model checking by parallelism cannot be expected to result in any significant speedup. We also completely determine the complexity of the model checking problem for all fragments of the extensions ECTL, CTL+, and ECTL+

Peer review and citation data in predicting university rankings, a large-scale analysis

Most Performance-based Research Funding Systems (PRFS) draw on peer review and bibliometric indicators, two different method- ologies which are sometimes combined. A common argument against the use of indicators in such research evaluation exercises is their low corre- lation at the article level with peer review judgments. In this study, we analyse 191,000 papers from 154 higher education institutes which were peer reviewed in a national research evaluation exercise. We combine these data with 6.95 million citations to the original papers. We show that when citation-based indicators are applied at the institutional or departmental level, rather than at the level of individual papers, surpris- ingly large correlations with peer review judgments can be observed, up to r <= 0.802, n = 37, p < 0.001 for some disciplines. In our evaluation of ranking prediction performance based on citation data, we show we can reduce the mean rank prediction error by 25% compared to previous work. This suggests that citation-based indicators are sufficiently aligned with peer review results at the institutional level to be used to lessen the overall burden of peer review on national evaluation exercises leading to considerable cost savings

Local Strategy Improvement for Parity Game Solving

The problem of solving a parity game is at the core of many problems in model checking, satisfiability checking and program synthesis. Some of the best algorithms for solving parity game are strategy improvement algorithms. These are global in nature since they require the entire parity game to be present at the beginning. This is a distinct disadvantage because in many applications one only needs to know which winning region a particular node belongs to, and a witnessing winning strategy may cover only a fractional part of the entire game graph. We present a local strategy improvement algorithm which explores the game graph on-the-fly whilst performing the improvement steps. We also compare it empirically with existing global strategy improvement algorithms and the currently only other local algorithm for solving parity games. It turns out that local strategy improvement can outperform these others by several orders of magnitude

Senator James O. Eastland, Bill Brock; Thomas J. McIntyre; Edward M. Kennedy; Richard S. Schweiker; Edmund S. Muskie; Thomas F. Eagleton; Charles McC. Mathias, Jr.; Howard Baker; J. Glenn Beall; Lowell Weicker, Jr.; William D. Hathaway; Dale Bumpers; John A. Durkin; Stuart Symington; Clairborne Pell; Hugh Scott; Edward W. Brooke; Birch Bayh; Henry M. Jackson; John L. McClellan; Gaylord Nelson; Ted Stevens; Ernest F. Hollings; Robert Morgan; Jesse Helms; Dick Stone; & Jennings Randolph to President Gerald R. Ford, 27 Februray 1976

Copy typed letter signed dated 27 February 1976 from Eastland; Bill Brock; Thomas J. McIntyre; Edward M. Kennedy; Richard S. Schweiker; Edmund S. Muskie; Thomas F. Eagleton; Charles McC. Mathias, Jr.; Howard Baker; J. Glenn Beall; Lowell Weicker, Jr.; William D. Hathaway; Dale Bumpers; John A. Durkin; Stuart Symington; Clairborne Pell; Hugh Scott; Edward W. Brooke; Birch Bayh; Henry M. Jackson; John L. McClellan; Gaylord Nelson; Ted Stevens; Ernest F. Hollings; Robert Morgan; Jesse Helms; Dick Stone; & Jennings Randolph to Ford, re: International Trade Commission, non-rubber footwear; 3 pages.https://egrove.olemiss.edu/joecorr_g/1064/thumbnail.jp