Searcharxiv⌕ Search

arXiv subjects

Hamza Bougroura

Publications and source records attributed to Hamza Bougroura.

2 recordsLinked to original sources

Four-Sector Propagation-Trapping Decomposition and Inverse Design of Initial States in Grover-Coined Quantum Walks on Multiedge Path Graphs

Controlling propagation and trapping through initial-state preparation requires an explicit relation between the initial amplitudes and the corresponding directional probabilities. We establish this relation for a discrete-time Grover-coined quantum walk on a multiedge path graph with even degree d = 2M, where M is at least 2, and two equal directional blocks. Each block of an arbitrary local state is expressed as its mean component plus a zero-sum deviation. The Grover coin performs a pure exchange of the two block means and reverses the sign of each zero-sum deviation. Together with the graph routing, this gives a unique orthogonal decomposition into four sectors: propagation in opposite directions and bounded trapping on either side of the launch vertex. We derive the four sector probabilities and solve the inverse problem, constructing initial states for any prescribed nonnegative probability quadruple that sums to unity. Explicit representatives are given for d = 4 and d = 6. Sector-resolved simulations reproduce the predicted motion, conservation of sector weights, and local probability additivity, including repeated spatial overlaps. We also derive the local Grover action for an arbitrary partition into blocks of possibly unequal sizes, explicitly describing how their means are redistributed while each zero-sum deviation remains within its block and changes sign. The framework provides direct control of propagation and trapping within one fixed graph and walk operator through the preparation of the initial state.

quant-ph↗

Quantum walk transport properties on graphene structures

We present numerical studies of quantum walks on \C60 and related graphene structures, to investigate their transport properties. Also known as a \emph{honeycomb lattice}, the lattice formed by carbon atoms in the graphene phase can be rolled up to form nanotubes of various dimensions. Graphene nanotubes have many important applications, some of which rely on their unusual electrical conductivity and related properties. Quantum walks on graphs provide an abstract setting in which to study such transport properties independent of the other chemical and physical properties of a physical substance. They can thus be used to further the understanding of mechanisms behind such properties. We find that nanotube structures are significantly more efficient in transporting a quantum walk than cycles of equivalent size, provided the symmetry of the structure is respected in how they are used. We find faster transport on zig-zag nanotubes compared to armchair nanotubes, which is unexpected given that for the actual materials the armchair nanotube is metallic, while the zig-zag is semiconducting.

quant-ph↗