5,651 research outputs found
Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
Being able to quantify the level of coherent control in a proposed device
implementing a quantum information processor (QIP) is an important task for
both comparing different devices and assessing a device's prospects with
regards to achieving fault-tolerant quantum control. We implement in a
liquid-state nuclear magnetic resonance QIP the randomized benchmarking
protocol presented by Knill et al (PRA 77: 012307 (2008)). We report an error
per randomized pulse of with a
single qubit QIP and show an experimentally relevant error model where the
randomized benchmarking gives a signature fidelity decay which is not possible
to interpret as a single error per gate. We explore and experimentally
investigate multi-qubit extensions of this protocol and report an average error
rate for one and two qubit gates of for a three
qubit QIP. We estimate that these error rates are still not decoherence limited
and thus can be improved with modifications to the control hardware and
software.Comment: 10 pages, 6 figures, submitted versio
A systematic review of the role of parents in the development of anxious cognitions in children
Anxious cognitions and parental behavior are important in the development of child anxiety. The current review aims to appraise the literature on the relationship between parental factors and chid anxious cognitions. Online database searches of PsycInfo, Scopus, ProQuest Dissertations and Web of Science were systematically searched using key terms related to 'parent', 'child', 'anxiety' and 'cognitions'. Included studies (N = 13) were quality assessed and study findings were appraised in line with cognitive behavioral frameworks of the parental pathways to the development of anxious cognitions in children. Reviewed studies confirmed that parental factors have a role in the development of their children's anxious cognitions by modelling fearful responses, reducing their child's autonomy, and indirectly via their own expectations about their child. Limitations of the literature are considered, including issues of measurement. Future research should consider multi-modal assessment of parental factors and examine parental behavior and child anxious cognitions in the context of real-life threatening events
Technology for space shuttle main engine control checkout and diagnosis /GP 70-232/
Electronic control for space shuttle main engin
Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking
One technique to reduce the state-space explosion problem in temporal logic
model checking is symmetry reduction. The combination of symmetry reduction and
symbolic model checking by using BDDs suffered a long time from the
prohibitively large BDD for the orbit relation. Dynamic symmetry reduction
calculates representatives of equivalence classes of states dynamically and
thus avoids the construction of the orbit relation. In this paper, we present a
new efficient model checking algorithm based on dynamic symmetry reduction. Our
experiments show that the algorithm is very fast and allows the verification of
larger systems. We additionally implemented the use of state symmetries for
symbolic symmetry reduction. To our knowledge we are the first who investigated
state symmetries in combination with BDD based symbolic model checking
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
Snow metamorphism: a fractal approach
Snow is a porous disordered medium consisting of air and three water phases:
ice, vapour and liquid. The ice phase consists of an assemblage of grains, ice
matrix, initially arranged over a random load bearing skeleton. The
quantitative relationship between density and morphological characteristics of
different snow microstructures is still an open issue. In this work, a
three-dimensional fractal description of density corresponding to different
snow microstructure is put forward. First, snow density is simulated in terms
of a generalized Menger sponge model. Then, a fully three-dimensional compact
stochastic fractal model is adopted. The latter approach yields a quantitative
map of the randomness of the snow texture, which is described as a
three-dimensional fractional Brownian field with the Hurst exponent H varying
as continuous parameter. The Hurst exponent is found to be strongly dependent
on snow morphology and density. The approach might be applied to all those
cases where the morphological evolution of snow cover or ice sheets should be
conveniently described at a quantitative level
Hydrogen Utilization in the Electricity Sector: Opportunities, Issues, and Challenges
This is a modified version of an opinion piece that was featured in Power Engineering.When the sun is shining and the wind is blowing, solar and wind energy are the lowest cost sources
of electric power in the country. This energy can be used to directly power electrical devices, such as lighting for buildings or charging electric vehicles. It can also be stored in batteries for short term storage or can be used to make hydrogen, which can be stored or put in a pipeline for later use, including users that are a long distance away. On the other hand, natural gas fi red gas turbines are both the lowest cost non-intermittent power source, and the largest source of electric power in the US, at around 40%. Can they continue to evolve and be repurposed to utilize stored hydrogen for electric power
Negative Quasi-Probability as a Resource for Quantum Computation
A central problem in quantum information is to determine the minimal physical
resources that are required for quantum computational speedup and, in
particular, for fault-tolerant quantum computation. We establish a remarkable
connection between the potential for quantum speed-up and the onset of negative
values in a distinguished quasi-probability representation, a discrete analog
of the Wigner function for quantum systems of odd dimension. This connection
allows us to resolve an open question on the existence of bound states for
magic-state distillation: we prove that there exist mixed states outside the
convex hull of stabilizer states that cannot be distilled to non-stabilizer
target states using stabilizer operations. We also provide an efficient
simulation protocol for Clifford circuits that extends to a large class of
mixed states, including bound universal states.Comment: 15 pages v4: This is a major revision. In particular, we have added a
new section detailing an explicit extension of the Gottesman-Knill simulation
protocol to deal with positively represented states and measurement (even
when these are non-stabilizer). This paper also includes significant
elaboration on the two main results of the previous versio
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+
- …