NUI Galway – UL Alliance First Annual ENGINEERING AND - ARAN ...

More documents

Recommendations

Info

MODELLING, ALGORITHMS & CONTROL 9.1 Fairness in Lazy Quantum Random Walks 152 9.2 Eigen‐based Approach for Leverage Parameter Identification in System Dynamics 153 9.3 An analysis of population diversity and multi‐chromosome GAs on deceptive problems 154 9.4 Evolutionary Modelling of Industrial Systems with Genetic Programming 155 9.5 Steganography techniques in the AutoCAD environment 156 9.6 Graphical Semantic Wiki for use in the Pre‐coding Phase of Discrete Event Simulation 157 9.7 Particle Swarm Optimisation with Gradually Increasing Directed Neighbourhoods 158 9.8 Low Coverage Genome Assembly Using Fuzzy Hash Maps 159 9.9 Traffic‐Aware Intelligent Access Point (TAIAP) 160 9.10 Evolving a Robust Open‐Ended Language 161 9.11 Merging Business Process Models 162 9.12 Context Stamp ‐ A Topic‐based Content Abstraction for Visual Concordance Analysis 163 9.13 Service Science: Exploring the Implications of IT‐enabled Relational Structures on Service Performance 164 9.14 DSP‐Based Control of Multi‐Rail DC‐DC Converter Systems with Non‐Integer Switching Frequency Ratios 165 151
Fairness in Lazy Quantum Random Walks David F. Dolphin, Michael McGettrick Department of Information Technology, National University of Ireland, <strong>Galway</strong> {d.dolphin1,michael.mcgettrick}@nuigalway.ie Abstract Quantum Walks provide a model for universal computation. Many Quantum algorithms have been shown to have substantial speedup over their most efficient classical counterparts. Some of these (e.g. Grover’ algorithm) make use of Quantum Random walks. However, much of the work concerning Quantum Walks deals with two state walks. In this work we observe the properties of three state walks on a graph. 1. Introduction Random walks are a statistical tool, used to study patterns in randomness. They can be applied over a finite space (typically a graph) or an infinite continuum. Quantum (random) walks are the quantum equivalent of classical random walks. They are studied to observe the statistical properties of quantum systems. These results aid in the general design of randomised quantum algorithms, particularly regarding efficiency concerns for those algorithms[1]. Much of the work concerning discrete quantum walks deals with two-state bits, known as qubits. At each time step in a qubit system the particle must move. Our work looks at three-state systems, whose particles are known as qutrits. In a qutrit system the particle is not forced to move at each time step; there is a possibility that it can remain in the same location. This possibility to remain in place gives rise to the name “lazy” quantum walks. 2. Classic Walks The most approachable application of a discrete classical random walk is a fair coin toss, the result of which moves a particle left or right on an infinite line. After this experiment has been run a number of times, the distance from the origin is recorded. This series of experiments is then run a number of times, and the distance from the origin is recorded each time. When a histogram of these results is plotted, we see that the distribution of distances from the origin is approximately normal. As the particle can only land on an odd numbered space after an odd number of steps and an even 152 numbered space after an even number of steps, over a larger number of steps every second value will be zero. The lazy classical walk has a normal distribution; the introduction of the lazy step removes the odd/even restriction. Like the standard classical walk, the lazy classical walk converges to equal values on a closed graph. It is possible to vary the lazy bias of a classical walk. A common bias is to choose a probability per iteration of ½ for the lazy move, ¼ for the clockwise move, and ¼ for the counter-clockwise move. This bias can be modeled as two coin tosses, where one coin signals movement or its absence, the second signals the direction of movement (if the first coin signals movement). Fig 1 - Histogram of final positions, 10,000 iterations of 100-step classical walk. 3. Quantum Walks Two state quantum walks are well studied. We use Marttala's generalization of a Hadamard coin[2] to study the properties of a three state Quantum Random Walk on a graph. 4. References [1] Julia Kempe. Quantum random walks - an introductory overview. Contemporary Physics, 44(4):307<strong>–</strong>327, Mar 2003. [2] Peter Marttala. An extension of the Deutsch- Jozsa algorithm to arbitrary qudits. Master’s thesis, University of Saskatchewan, 2007.
Page 1 and 2:
NUI Galway - UL Alliance First Annu
Page 4 and 5:
FULL TABLE OF CONTENTS 1 GAMES, VIS
Page 6 and 7:
4 MECHANICAL AND BIOMEDICAL ENGINEE
Page 8 and 9:
5.21 Detecting Topics and Events in
Page 10 and 11:
8.7 Modelling Extreme Flood Events
Page 12 and 13:
GAMES, VISUALISATION & EDUCATION 1.
Page 14 and 15:
Generation and Analysis of Graph St
Page 16 and 17:
Evolution and Analysis of Strategie
Page 18 and 19:
Abstract The delivery of multimedia
Page 20 and 21:
Applications of Reinforcement Learn
Page 22 and 23:
Assessing the effects of interactiv
Page 24 and 25:
Real-time depth map generation usin
Page 26 and 27:
An analysis of the capability of pr
Page 28 and 29:
Building Information Modelling duri
Page 30 and 31:
Dwelling Energy Measurement Procedu
Page 32 and 33:
Numerical Modelling of Tidal Turbin
Page 34 and 35:
Energy Storage using Microencapsula
Page 36 and 37:
Data Centre Energy Efficiency Mark
Page 38 and 39:
An embodied energy and carbon asses
Page 40 and 41:
SmartOp - Smart Buildings Operation
Page 42 and 43:
Ocean Wave Energy Exploitation in D
Page 44 and 45:
Future Smart Grid Synchronization C
Page 46 and 47:
Web-Based Building Energy Usage Vis
Page 48 and 49:
Image Recognition and Classificatio
Page 50 and 51:
Android Based Multi-Feature Elderly
Page 52 and 53:
Determining Subjects’ Activities
Page 54 and 55:
New Analysis Techniques for ICU Dat
Page 56 and 57:
National E-Prescribing Systems in I
Page 58 and 59:
Using Mashups to Satisfy Personalis
Page 60 and 61:
3D Computational Modeling of Blood
Page 62 and 63:
Experimental and Computational Inve
Page 64 and 65:
Experimental Analysis of the Therma
Page 66 and 67:
Simulating Actin Cytoskeleton Remod
Page 68 and 69:
Computational Analysis of Transcath
Page 70 and 71:
An In vitro Shear Stress System for
Page 72 and 73:
Development of a Micropipette Aspir
Page 74 and 75:
A Computational Test-Bed to Examine
Page 76 and 77:
Computational Modeling of Ceramic-b
Page 78 and 79:
Multi-Scale Computational Modelling
Page 80 and 81:
Development of a mixed-mode cohesiv
Page 82 and 83:
Active Computational Modelling of C
Page 84 and 85:
Modelling the Management of Medical
Page 86 and 87:
SOCIAL MEDIA, SEARCH & RECOMMENDATI
Page 88 and 89:
Improving Twitter Search by Removin
Page 90 and 91:
Abstract The goal of this research
Page 92 and 93:
Generalized Blockmodeling Samantha
Page 94 and 95:
Life-Cycles and Mutual Effects of S
Page 96 and 97:
dcat: Searching Public Sector Infor
Page 98 and 99:
The Effect of User Features on Chur
Page 100 and 101:
User Similarity and Interaction in
Page 102 and 103:
Improving Categorisation in Social
Page 104 and 105:
Natural Language Queries on Enterpr
Page 106 and 107:
Studying Forum Dynamics from a User
Page 108 and 109:
Provenance in the Web of Data: a bu
Page 110 and 111:
Towards Social Descriptions of Serv
Page 112 and 113: ENVIRONMENTAL ENGINEERING 6.1 Asses
Page 114 and 115: Novel Agri-engineering solutions fo
Page 116 and 117: Evaluation of amendments to control
Page 118 and 119: Determination of optimal applicatio
Page 120 and 121: Treatment of Piggery Wastewaters us
Page 122 and 123: NEXT GENERATION INTERNET 7.1 Extens
Page 124 and 125: Enabling Federation of Government M
Page 126 and 127: Curated Entities for Enterprise Uma
Page 128 and 129: Mobile Web + Social Web + Semantic
Page 130 and 131: Engaging Citizens in the Policy-Mak
Page 132 and 133: Preference-based Discovery of Dynam
Page 134 and 135: RDF On the Go: An RDF Storage and Q
Page 136 and 137: Policy Modeling meets Linked Open D
Page 138 and 139: A Contextualized Perspective for Li
Page 140 and 141: Improving discovery in Life Science
Page 142 and 143: The Semantic Public Service Portal
Page 144 and 145: Personalized Content Delivery on Mo
Page 146 and 147: A Framework to Describe Localisatio
Page 148 and 149: The influence of secondary settleme
Page 150 and 151: Analysis of Shear Transfer in Void-
Page 152 and 153: Cost-Effective Sustainable Construc
Page 154 and 155: Modelling Extreme Flood Events due
Page 156 and 157: Axial Load Capacity of a Driven Cas
Page 158 and 159: Chemical amendment of dairy cattle
Page 160 and 161: Seismic Design of Concentrically Br
Page 164 and 165: Eigen-based Approach for Leverage P
Page 166 and 167: Evolutionary Modelling of Industria
Page 168 and 169: Abstract: Graphical Semantic Wiki f
Page 170 and 171: Low Coverage Genome Assembly Using
Page 172 and 173: Evolving a Robust Open-Ended Langua
Page 174 and 175: Context Stamp - A Topic-based Conte
Page 176 and 177: DSP-Based Control of Multi-Rail DC-
Page 178 and 179: Topographical Cues - Controlling Ce
Page 180 and 181: Creep Relaxation and Crack Growth P
Page 182 and 183: Finite Element Modelling of Failure
Page 184 and 185: Influence of Fluorine and Nitrogen
Page 186 and 187: Phase Decompositions of Bioceramic
Page 188 and 189: High Resolution Microscopical Analy
Page 190 and 191: An Experimental and Numerical Analy
Page 192 and 193: Thermomechanical characterisation o
Page 194 and 195: A multiaxial damage mechanics metho
Page 196: The effect of citrate ester plastic
show all

NUI Galway – UL Alliance First Annual ENGINEERING AND - ARAN ...

Create successful ePaper yourself

Delete template?

Save as template?