Search NASA⌕ Search

SEARCH · Search NASA

Results for “walking”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Quantum stochastic walks: A generalization of classical random walks and quantum walks

We introduce the quantum stochastic walk (QSW), which determines the evolution of a generalized quantum-mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all possible quantum, classical, and quantum-stochastic transitions from a vertex as defined by its connectivity. We show how the family of possible QSWs encompasses both the classical random walk (CRW) and the quantum walk (QW) as special cases but also includes more general probability distributions. As an example, we study the QSW on a line and the glued tree of depth three to observe the behavior of the QW-to-CRW transition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Framework for discrete-time quantum walks and a symmetric walk on a binary tree

We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2, on which this is based. The framework has no need for coin spaces, it imposes no constraints on the evolution operator other than unitarity, and is unifying of other approaches. As an example we construct a symmetric discrete-time quantum walk on the semi-infinite binary tree. The generating function of the amplitude at the root is computed in closed form, as a function of time and the initial level n in the tree, and we find the asymptotic and a full numerical solution for the amplitude. It exhibits a sharp interference peak and a power-law tail, as opposed to the exponentially decaying tail of a broadly peaked distribution of the classical symmetric random walk on a binary tree. The probability peak is orders of magnitude larger than it is for the classical walk (already at small n). The quantum walk shows a polynomial algorithmic speedup in n over the classical walk, which we conjecture to be of the order 2/3, based on strong trends in data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effectiveness of supervised exercise, home-based exercise, or walk advice strategies on walking performance and muscle endurance in patients with intermittent claudication (SUNFIT trial): a randomized clinical trial

Abstract Aims Supervised exercise is a guideline-recommended treatment in intermittent claudication (IC). Hospital-based supervised exercise programmes (SEPs) are underutilized, while home-based structured exercise programmes (HSEPs) have attracted interest. The results from HSEP in IC are inconsistent and may confer no benefit over walk advice (WA) and be less effective than SEP. The aim of the study was to compare the effectiveness of best medical treatment, including Nordic pole WA alone, or WA + SEP or WA + HSEP for patients with IC. Methods and results This three-armed, multicentre randomized clinical trial enrolled patients with IC; all patients received best medical treatment including walking poles and the advice of regular Nordic pole walking (WA). For HSEP and SEP, additional exercise programmes were provided. The primarily investigated hypothesis was a non-inferiority analysis of SEP vs. HSEP regarding the 6-min walk test (6MWT) maximum distance, with a pre-defined non-inferiority margin of 50 m. Supporting outcomes included muscle endurance tests and the walking impairment questionnaire. Outcomes were assessed at baseline, 3, 6, and 12 months by a blinded evaluator. Altogether 166 patients (mean age 72 years; 59% males) were randomized. In HSEP and SEP, 24 and 26% patients, respectively, were fully exercise adherent. All three groups improved pain-free walking distance over time, but there were no significant intergroup differences. The intergroup 6MWT difference between SEP and HSEP from 0 to 12 months was –11.6 m, 95% confidence interval: –36.4 to 13.0 m (i.e. within the pre-specified non-inferiority margin). Conclusion The HSEP was non-inferior to SEP in patients with IC. There were no significant differences observed between the three groups at 1 year. Registration ClinicialTrials.gov: NCT02341716.

Sandberg, Anna (ORCID:0000000258432784)↗

An improved random walk algorithm for the implicit Monte Carlo method

In this work, we introduce a modified Implicit Monte Carlo (IMC) Random Walk (RW) algorithm, which increases simulation efficiency for multigroup radiative transfer problems with strongly frequency-dependent opacities. To date, the RW method has only been implemented in “fully-gray” form; that is, the multigroup IMC opacities are group-collapsed over the full frequency domain of the problem to obtain a gray diffusion problem for RW. This formulation works well for problems with large spatial cells and/or opacities that are weakly dependent on frequency; however, the efficiency of the RW method degrades when the spatial cells are thin or the opacities are a strong function of frequency. To address this inefficiency, we introduce a RW frequency group cutoff in each spatial cell, which divides the frequency domain into optically thick and optically thin components. In the modified algorithm, opacities for the RW diffusion problem are obtained by group-collapsing IMC opacities below the frequency group cutoff. Particles with frequencies above the cutoff are transported via standard IMC, while particles below the cutoff are eligible for RW. This greatly increases the total number of RW steps taken per IMC time-step, which in turn improves the efficiency of the simulation. We refer to this new method as Partially-Gray Random Walk (PGRW). We present numerical results for several multigroup radiative transfer problems, which show that the PGRW method is significantly more efficient than standard RW for several problems of interest. In general, PGRW decreases runtimes by a factor of ∼2–4 compared to standard RW, and a factor of ∼3–6 compared to standard IMC. While PGRW is slower than frequency-dependent Discrete Diffusion Monte Carlo (DDMC), it is also easier to adapt to unstructured meshes and can be used in spatial cells where DDMC is not applicable. This suggests that it may be optimal to employ both DDMC and PGRW in a single simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Searching via walking: How to find a marked clique of a complete graph using quantum walks

We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how to implement the quantum walk using a quantum circuit and a quantum oracle, which allows us to specify the resources needed for a quantitative comparison of the efficiency of classical and quantum searches--the number of oracle calls.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum random walks without walking

Quantum random walks have received much interest due to their nonintuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable and not limited to special connectivity criteria. We present a scheme for walking on arbitrarily complex graphs, which can be realized using a variety of quantum systems such as a Bose-Einstein condensate trapped inside an optical lattice. This scheme is particularly elegant since the walker is not required to physically step between the nodes; only flipping coins is sufficient.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Flow Intermittency, Dispersion, and Correlated Continuous Time Random Walks in Porous Media

We study the intermittency of fluid velocities in porous media and its relation to anomalous dispersion. Lagrangian velocities measured at equidistant points along streamlines are shown to form a spatial Markov process. As a consequence of this remarkable property, the dispersion of fluid particles can be described by a continuous time random walk with correlated temporal increments. This new dynamical picture of intermittency provides a direct link between the microscale flow, its intermittent properties, and non-Fickian dispersion.

Environmental Molecular Sciences Laboratory↗

Relationship between quantum walks and relativistic quantum mechanics

Quantum walk models have been used as an algorithmic tool for quantum computation and to describe various physical processes. This article revisits the relationship between relativistic quantum mechanics and the quantum walks. We show the similarities of the mathematical structure of the decoupled and coupled forms of the discrete-time quantum walk to that of the Klein-Gordon and Dirac equations, respectively. In the latter case, the coin emerges as an analog of the spinor degree of freedom. Discrete-time quantum walk as a coupled form of the continuous-time quantum walk is also shown by transforming the decoupled form of the discrete-time quantum walk to the Schroedinger form. By showing the coin to be a means to make the walk reversible and that the Dirac-like structure is a consequence of the coin use, our work suggests that the relativistic causal structure is a consequence of conservation of information. However, decoherence (modeled by projective measurements on position space) generates entropy that increases with time, making the walk irreversible and thereby producing an arrow of time. The Lieb-Robinson bound is used to highlight the causal structure of the quantum walk to put in perspective the relativistic structure of the quantum walk, the maximum speed of walk propagation, and earlier findings related to the finite spread of the walk probability distribution. We also present a two-dimensional quantum walk model on a two-state system to which the study can be extended.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Relationship of Walking Intensity to Total and Cause-Specific Mortality. Results from the National Walkers’ Health Study

Purpose: Test whether: 1) walking intensity predicts mortality when adjusted for walking energy expenditure, and 2) slow walking pace (≥24-minute mile) identifies subjects at substantially elevated risk for mortality. Methods: Hazard ratios from Cox proportional survival analyses of all-cause and cause-specific mortality vs. usual walking pace (min/mile) in 7,374 male and 31,607 female recreational walkers. Survival times were left censored for age at entry into the study. Other causes of death were treated as a competing risk for the analyses of cause-specific mortality. All analyses were adjusted for sex, education, baseline smoking, prior heart attack, aspirin use, diet, BMI, and walking energy expenditure. Deaths within one year of baseline were excluded. Results: The National Death Index identified 1968 deaths during the average 9.4-year mortality surveillance. Each additional minute per mile in walking pace was associated with an increased risk of mortality due to all causes (1.8% increase, P=10-5), cardiovascular diseases (2.4% increase, P=0.001, 637 deaths), ischemic heart disease (2.8% increase, P=0.003, 336 deaths), heart failure (6.5% increase, P=0.001, 36 deaths), hypertensive heart disease (6.2% increase, P=0.01, 31 deaths), diabetes (6.3% increase, P=0.004, 32 deaths), and dementia (6.6% increase, P=0.0004, 44 deaths). Those reporting a pace slower than a 24-minute mile were at increased risk for mortality due to all-causes (44.3% increased risk, P=0.0001), cardiovascular diseases (43.9% increased risk, P=0.03), and dementia (5.0-fold increased risk, P=0.0002) even though they satisfied the current exercise recommendations by walking ≥7.5 metabolic equivalent (MET)-hours per week. Conclusions: The risk for mortality: 1) decreases in association with walking intensity, and 2) increases substantially in association for walking pace ≥24 minute mile (equivalent to <400m during a six-minute walk test) even among subjects who exercise regularly.

59 BASIC BIOLOGICAL SCIENCES↗

Ride-hailing and taxi versus walking: Long term forecasts and implications from large-scale behavioral data

Introduction: Although ride-hailing and taxi trips can potentially reduce single-occupant vehicle trips and auto ownership, they can also replace pedestrian trips. Because physical activity is associated with improved health outcomes, the extent to which ride-hailing and taxi travel captures walking's mode share is of interest to policymakers. Methods: Based on large-scale behavioral data from the 2017 U.S. National Household Travel Survey, this paper reports on the development of a full Bayesian logistic regression model for determining the mode split between (1) ride-hailing and taxi and (2) walk while accounting for unobserved heterogeneity. The results from the stand-alone model inform two longer-term travel forecasting scenarios: a) higher risk of walk trips converting to ride-hailing and taxi, specifically in the future with high prevalence of automated vehicles, b) higher probability of such trips remaining as walking. Results: The results revealed that some of the important characteristics that increase the likelihood of a traveler using the ride-hailing and taxi mode versus walking include having a longer trip, using a smartphone to access the internet, having an interest in technologies, having a medical condition, and living in a metropolitan area with rail access. Further, the results from the first scenario suggest that an overall increase of up to 2.9% in the ride-hailing and taxi mode share may be expected. The second scenario shows that between 68% and 76% of ride-hailing and taxi trips could be diverted to walking if supportive pedestrian infrastructure were provided in the case study locations. The planning process can be adapted to consider not only congestion, crash, and emissions impacts of such shifts but also the effects of a loss of physical activity. Conclusions: The study findings show how the ride-hailing and taxi mode competes with walking. Further, the findings enable planners to update their regional travel forecasting models; policy makers can thus encourage active travel by prioritizing pedestrian infrastructure investments that may divert ride-hailing and taxi trips to walking. However, equity should be a key consideration to ensure that addressing the competition between these two modal choices does not hinder the provision of pedestrian facilities in communities that depend on walking.

99 GENERAL AND MISCELLANEOUS↗

Comparing Algorithms for Graph Isomorphism Using Discrete- and Continuous-Time Quantum Random Walks

Berry and Wang [Phys. Rev. A 83, 042317 (2011)] show numerically that a discrete-time quan- tum random walk of two noninteracting particles is able to distinguish some non-isomorphic strongly regular graphs from the same family. Here we analytically demonstrate how it is possible for these walks to distinguish such graphs, while continuous-time quantum walks of two noninteracting parti- cles cannot. We show analytically and numerically that even single-particle discrete-time quantum random walks can distinguish some strongly regular graphs, though not as many as two-particle noninteracting discrete-time walks. Additionally, we demonstrate how, given the same quantum random walk, subtle di erences in the graph certi cate construction algorithm can nontrivially im- pact the walk's distinguishing power. We also show that no continuous-time walk of a xed number of particles can distinguish all strongly regular graphs when used in conjunction with any of the graph certi cates we consider. We extend this constraint to discrete-time walks of xed numbers of noninteracting particles for one kind of graph certi cate; it remains an open question as to whether or not this constraint applies to the other graph certi cates we consider.

97 MATHEMATICS AND COMPUTING↗

Quantumness in a decoherent quantum walk using measurement-induced disturbance

The classicalization of a decoherent discrete-time quantum walk on a line or an n-cycle can be demonstrated in various ways that do not necessarily provide a geometry-independent description. For example, the position probability distribution becomes increasingly Gaussian, with a concomitant fall in the standard deviation, in the former case, but not in the latter. As another example, each step of the quantum walk on a line may be subjected to an arbitrary phase gate, without affecting the position probability distribution, no matter whether the walk is noiseless or noisy. This symmetry, which is absent in the case of noiseless cyclic walk, but is restored in the presence of sufficient noise, serves as an indicator of classicalization, but only in the cyclic case. Here we show that the degree of quantum correlations between the coin and position degrees of freedom, quantified by a measure based on the disturbance induced by local measurements [Luo, Phys. Rev. A 77, 022301 (2008)], provides a suitable measure of classicalization across both type of walks. Applying this measure to compare the two walks, we find that cyclic quantum walks tend to classicalize faster than quantum walks on a line because of more efficient phase randomization due to the self-interference of the two counter-rotating waves. We model noise as acting on the coin, and given by the squeezed generalized amplitude damping (SGAD) channel, which generalizes the generalized amplitude damping channel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel elastic elements improve energy efficiency on the STEPPR bipedal walking robot

This study describes how parallel elastic elements can be used to reduce energy consumption in the electric motor driven, fully-actuated, STEPPR bipedal walking robot without compromising or significantly limiting locomotive behaviors. A physically motivated approach is used to illustrate how selectively-engaging springs for hip adduction and ankle flexion predict benefits for three different flat ground walking gaits: human walking, human-like robot walking and crouched robot walking. Based on locomotion data, springs are designed and substantial reductions in power consumption are demonstrated using a bench dynamometer. These lessons are then applied to STEPPR (Sandia Transmission-Efficient Prototype Promoting Research), a fully actuated bipedal robot designed to explore the impact of tailored joint mechanisms on walking efficiency. Featuring high-torque brushless DC motors, efficient low-ratio transmissions, and high fidelity torque control, STEPPR provides the ability to incorporate novel joint-level mechanisms without dramatically altering high level control. Unique parallel elastic designs are incorporated into STEPPR, and walking data shows that hip adduction and ankle flexion springs significantly reduce the required actuator energy at those joints for several gaits. These results suggest that parallel joint springs offer a promising means of supporting quasi-static joint torques due to body mass during walking, relieving motors of the need to support these torques and substantially improving locomotive energy efficiency.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Efficient quantum circuits for Szegedy quantum walks

A major advantage in using Szegedy’s formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm. - Highlights: • A general theoretical framework for implementing Szegedy walks using quantum circuits. • Explicit efficient quantum circuit implementation of the Szegedy walk for several classes of graphs. • Efficient implementation of Szegedy walks for quantum page-ranking of a certain class of graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Disordered-quantum-walk-induced localization of a Bose-Einstein condensate

We present an approach to induce localization of a Bose-Einstein condensate in a one-dimensional lattice under the influence of unitary quantum-walk evolution using disordered quantum coin operation. We introduce a discrete-time quantum-walk model in which the interference effect is modified to diffuse or strongly localize the probability distribution of the particle by assigning a different set of coin parameters picked randomly for each step of the walk, respectively. Spatial localization of the particle or state is explained by comparing the variance of the probability distribution of the quantum walk in position space using disordered coin operation to that of the walk using an identical coin operation for each step. Due to the high degree of control over quantum coin operation and most of the system parameters, ultracold atoms in an optical lattice offer opportunities to implement a disordered quantum walk that is unitary and induces localization. Here we present a scheme to use a Bose-Einstein condensate that can be evolved to the superposition of its internal states in an optical lattice and control the dynamics of atoms to observe localization. This approach can be adopted to any other physical system in which controlled disordered quantum walk can be implemented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗