The AMC Linear Disability Score in patients with newly diagnosed Parkinson disease

Objective: The aim of this study was to examine the clinimetric properties of the AMC Linear Disability Score (ALDS), a new generic disability measure based on Item Response Theory, in patients with newly diagnosed Parkinson disease (PD).\ud \ud Methods: A sample of 132 patients with PD was evaluated using the Hoehn and Yahr (H&Y), the Unified PD Rating Scale motor examination, the Schwab and England scale (S&E), the Short Form–36, the PD Quality of Life Questionnaire, and the ALDS.\ud \ud Results: The internal consistency reliability of the ALDS was good ([alpha] = 0.95) with 55 items extending the sufficient item-total correlation criterion (r > 0.20). The ALDS was correlated with other disability measures (r = 0.50 to 0.63) and decreasingly associated with measures reflecting impairments (r = 0.36 to 0.37) and mental health (r = 0.23 to -0.01). With regard to know-group validity, the ALDS indicated that patients with more severe PD (H&Y stage 3) were more disabled than patients with mild (H&Y stage 1) or moderate PD (H&Y stage 2) (p < 0.0001). The ALDS discriminated between more or less severe extrapyramidal symptoms (p = 0.001) and patients with postural instability showed lower ALDS scores compared to patients without postural instability (p = < 0.0001). Compared to the S&E (score 100% = 19%), the ALDS showed less of a ceiling effect (5%).\ud \ud Conclusion: The AMC Linear Disability Score is a flexible, feasible, and clinimetrically promising instrument to assess the level of disability in patients with newly diagnosed Parkinson disease

Catalytic space: Non-determinism and hierarchy

Catalytic computation, defined by Buhrman, Cleve, Koucký, Loff and Speelman (STOC 2014), is a space-bounded computation where in addition to our working memory we have an exponentially larger auxiliary memory which is full; the auxiliary memory may be used throughout the computation, but it must be restored to its initial content by the end of the computation. Motivated by the surprising power of this model, we set out to study the non-deterministic version of catalytic computation. We establish that non-deterministic catalytic log-space is contained in ZPP, which is the same bound known for its deterministic counterpart, and we prove that non-deterministic catalytic space is closed under complement (under a standard derandomization assumption). Furthermore, we establish hierarchy theorems for non-deterministic and deterministic catalytic computation

Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks

Many computational problems are subject to a quantum speed-up: one might find that a problem having an Opn3q-time or Opn2q-time classic algorithm can be solved by a known Opn1.5q-time or Opnq-time quantum algorithm. The question naturally arises: how much quantum speed-up is possible? The area of fine-grained complexity allows us to prove optimal lower-bounds on the complexity of various computational problems, based on the conjectured hardness of certain natural, well-studied problems. This theory has recently been extended to the quantum setting, in two independent papers by Buhrman, Patro and Speelman [7], and by Aaronson, Chia, Lin, Wang, and Zhang [1]. In this paper, we further extend the theory of fine-grained complexity to the quantum setting. A fundamental conjecture in the classical setting states that the 3SUM problem cannot be solved by (classical) algorithms in time Opn2´εq, for any ε ą 0. We formulate an analogous conjecture, the Quantum-3SUM-Conjecture, which states that there exist no sublinear Opn1´εq-time quantum algorithms for the 3SUM problem. Based on the Quantum-3SUM-Conjecture, we show new lower-bounds on the time complexity of quantum algorithms for several computational problems. Most of our lower-bounds are optimal, in that they match known upper-bounds, and hence they imply tight limits on the quantum speedup that is possible for these problems. These results are proven by adapting to the quantum setting known classical fine-grained reductions from the 3SUM problem. This adaptation is not trivial, however, since the original classical reductions require pre-processing the input in various ways, e.g. by sorting it according to some order, and this pre-processing (provably) cannot be done in sublinear quantum time. We overcome this bottleneck by combining a quantum walk with a classical dynamic data-structure having a certain “history-independence” property. This type of construction has been used in the past to prove upper bounds, and here we use it for the first time as part of a reduction. This general proof strategy allows us to prove tight lower bounds on several computational-geometry problems, on Convolution-3SUM and on the 0-Edge-Weight-Triangle problem, conditional on the Quantum-3SUM-Conjecture. We believe this proof strategy will be useful in proving tight (conditional) lower-bounds, and limits on quantum speed-ups, for many other problems

Catalytic space: non-determinism and hierarchy

Catalytic computation, defined by Buhrman, Cleve, Koucký, Loff and Speelman (STOC 2014), is a space-bounded computation where in addition to our working memory we have an exponentially larger auxiliary memory which is full; the auxiliary memory may be used throughout the computation, but it must be restored to its initial content by the end of the computation. Motivated by the surprising power of this model, we set out to study the non-deterministic version of catalytic computation. We establish that non-deterministic catalytic log-space is contained in ZPP, which is the same bound known for its deterministic counterpart, and we prove that non-deterministic catalytic space is closed under complement (under a standard derandomization assumption). Furthermore, we establish hierarchy theorems for non-deterministic and deterministic catalytic computation

Addressed qubit manipulation in radio-frequency dressed lattices

Precise control over qubits encoded as internal states of ultracold atoms in arrays of potential wells is a key element for atomtronics applications in quantum information, quantum simulation and atomic microscopy. Here we theoretically study atoms trapped in an array of radio-frequency dressed potential wells and propose a scheme for engineering fast and high-fidelity single-qubit gates with low error due to cross-talk. In this proposal, atom trapping and qubit manipulation relies exclusively on long-wave radiation making it suitable for atom-chip technology. We demonstrate that selective qubit addressing with resonant microwaves can be programmed by controlling static and radio-frequency currents in microfabricated conductors. These results should enable studies of neutral-atom quantum computing architectures, powered by low-frequency electromagnetic fields with the benefit of simple schemes for controlling individual qubits in large ensembles