Searcharxiv⌕ Search

arXiv subjects

Pascal Philipp

Publications and source records attributed to Pascal Philipp.

5 recordsLinked to original sources
arXiv2020

Revealing the State of the Art of Large-Scale Agile Development Research: A Systematic Mapping Study

Context: Success with agile methods in the small scale has led to an increasing adoption also in large development undertakings and organizations. Recent years have also seen an increasing amount of primary research on the topic, as well as a number of systematic literature reviews. However, there is no systematic overview of the whole research field. Objective: This work identifies, classifies, and evaluates the state of the art of research in large-scale agile development. Method: We conducted a systematic mapping study and rigorously selected 136 studies. We designed a classification framework and extracted key information from the studies. We synthesized the obtained data and created an overview of the state of the art. Results: This work contributes with (i) a description of large-scale agile endeavors reported in the industry, (ii) a systematic map of existing research in the field, (iii) an overview of influential studies, (iv) an overview of the central research themes, and (v) a research agenda for future research. Conclusion: This study portrays the state of the art in large-scale agile development and offers researchers and practitioners a reflection of the past thirteen years of research and practice on the large-scale application of agile methods.

cs.SE↗
arXiv2016

Exact simulation of coined quantum walks with the continuous-time model

The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and taking appropriate limits. In this work, we produce the evolution of a coined quantum walk on a generic graph using a continuous-time quantum walk on a larger graph. In addition to expanding the underlying structure, we also have to switch on and off edges during the continuous-time evolution to accommodate the alternation between the shift and coin operators from the coined model. In one particular case, the connection is very natural, and the continuous-time quantum walk that simulates the coined quantum walk is driven by the graph Laplacian on the dynamically changing expanded graph.

quant-ph↗
arXiv2016

Engineering the Success of Quantum Walk Search Using Weighted Graphs

Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked vertex is limited. We give an example with two linked cliques, proving that the captive probability can be liberated by increasing the weights of the links. This allows the search to succeed with probability 1 without increasing the energy scaling of the algorithm. Further increasing the weights, however, slows the runtime, so the optimal search requires weights that are neither too weak nor too strong.

quant-ph↗
arXiv2016

Continuous-Time Quantum Search on Balanced Trees

We examine the effect of network heterogeneity on the performance of quantum search algorithms. To this end, we study quantum search on a tree for the oracle Hamiltonian formulation employed by continuous-time quantum walks. We use analytical and numerical arguments to show that the exponent of the asymptotic running time $\sim N^{\beta}$ changes uniformly from $\beta=0.5$ to $\beta=1$ as the searched-for site is moved from the root of the tree towards the leaves. These results imply that the time complexity of the quantum search algorithm on a balanced tree is closely correlated with certain path-based centrality measures of the searched-for site.

quant-ph↗