Influence of coin symmetry on infinite hitting times in quantum walks

• URL: http://arxiv.org/abs/2107.02383v1
• Date: Tue, 6 Jul 2021 04:42:25 GMT
• Title: Influence of coin symmetry on infinite hitting times in quantum walks
• Abstract summary: Quantum walks on finite connected graphs can have infinite hitting times. We study the effect of coin symmetry by analyzing the group of coin-permutation symmetries.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classical random walks on finite graphs have an underrated property: a walk from any vertex can reach every other vertex in finite time, provided they are connected. Discrete-time quantum walks on finite connected graphs however, can have infinite hitting times. This phenomenon is related to graph symmetry, as previously characterized by the group of direction-preserving graph automorphisms that trivially affect the coin Hilbert space. If a graph is symmetric enough (in a particular sense) then the associated quantum walk unitary will contain eigenvectors that do not overlap a set of target vertices, for any coin flip operator. These eigenvectors span the Infinite Hitting Time (IHT) subspace. Quantum states in the IHT subspace never reach the target vertices, leading to infinite hitting times. However, this is not the whole story: the graph of the 3D cube does not satisfy this symmetry constraint, yet quantum walks on this graph with certain symmetric coins can exhibit infinite hitting times. We study the effect of coin symmetry by analyzing the group of coin-permutation symmetries (CPS): graph automorphisms that act nontrivially on the coin Hilbert space but leave the coin operator invariant. Unitaries using highly symmetric coins with large CPS groups, such as the permutation-invariant Grover coin, are associated with higher probabilities of never arriving, as a result of their larger IHT subspaces.

Related papers

• Behavioral Memory under Symmetry in One-Way Quantum Automata [12.042012916861829]
  Under compact symmetry, observable behavior reduces to an invariant operator algebra, but its dimension is not yet classical memory.<n>We develop an operator algebraic theory that separates these effects through three filters.
  arXiv  Detail & Related papers  (2026-09-01T15:56:26Z)
• Chaos in Systems with Quantum Group Symmetry [45.88028371034407]
  We show an explicit example of a system with quantum group global symmetry which is chaotic.<n>The spin chain is non-unitary but PT-symmetric and, in addition to chaos, exhibits an interesting transition after which the eigenvalues become complex.
  arXiv  Detail & Related papers  (2025-10-27T12:07:16Z)
• Gain on ground state of quantum system for truly $\mathcal{PT}$ symmetry [15.84033037381773]
  For a truly $mathcalPT$-symmetric quantum system, the conventional non-Hermitian Hamiltonian is $H = Omegasigma_x -igamma|1ranglelangle1| + igamma|0ranglelangle0|.<n>We propose a pathway to efficiently construct truly $mathcalPT$-symmetric quantum devices, offering a powerful platform for engineering quantum resources vital for quantum information technology applications.
  arXiv  Detail & Related papers  (2025-07-30T14:47:50Z)
• Solving graph problems using permutation-invariant quantum machine learning [35.99391901074448]
  In quantum machine learning, the ansatz can be tuned to correspond to the specific symmetry of the problem.<n>We show how the symmetry can be included in the quantum circuit in a straightforward constructive method.
  arXiv  Detail & Related papers  (2025-05-19T06:44:03Z)
• Better bounds on Grothendieck constants of finite orders [20.068273625719943]
  We exploit a recent Frank-Wolfe approach to provide good candidates for lower bounding some Grothendieck constants. The complete proof relies on solving difficult binary quadratic optimisation problems.
  arXiv  Detail & Related papers  (2024-09-05T17:53:52Z)
• Symmetry-restricted quantum circuits are still well-behaved [45.89137831674385]
  We show that quantum circuits restricted by a symmetry inherit the properties of the whole special unitary group $SU(2n)$. It extends prior work on symmetric states to the operators and shows that the operator space follows the same structure as the state space.
  arXiv  Detail & Related papers  (2024-02-26T06:23:39Z)
• Exponential speedups for quantum walks in random hierarchical graphs [8.984888893275713]
  We show how to generalize the use of quantum walks to a class of hierarchical graphs. The hitting times of quantum walks on these graphs are related to the localization properties of zero modes in certain disordered tight binding Hamiltonians.
  arXiv  Detail & Related papers  (2023-07-27T17:59:58Z)
• Walking on Vertices and Edges by Continuous-Time Quantum Walk [0.0]
  We define a version of the continuous-time quantum walk that allows the walker to hop from vertices to edges and vice versa. We analyze the spatial search algorithm on the complete bipartite graph by modifying the new version of the Hamiltonian.
  arXiv  Detail & Related papers  (2022-06-07T15:10:18Z)
• Discrete Quantum Walks on the Symmetric Group [0.0]
  In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. In this paper we investigate the discrete time coined quantum walk (DTCQW) model using tools from non-commutative Fourier analysis. Specifically, we are interested in characterizing the DTCQW on Cayley graphs generated by the symmetric group ($sym$) with appropriate generating sets.
  arXiv  Detail & Related papers  (2022-03-28T23:48:08Z)
• Perfect State Transfer in Weighted Cubelike Graphs [0.0]
  A continuous-time quantum random walk describes the motion of a quantum mechanical particle on a graph. We generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs.
  arXiv  Detail & Related papers  (2021-09-26T13:44:44Z)
• Information retrieval and eigenstates coalescence in a non-Hermitian quantum system with anti-$\mathcal{PT}$ symmetry [15.273168396747495]
  Non-Hermitian systems with parity-time reversal ($mathcalPT$) or anti-$mathcalPT$ symmetry have attracted a wide range of interest owing to their unique characteristics and counterintuitive phenomena. We implement a Floquet Hamiltonian of a single qubit with anti-$mathcalPT$ symmetry by periodically driving a dissipative quantum system of a single trapped ion.
  arXiv  Detail & Related papers  (2021-07-27T07:11:32Z)
• Graph-Theoretic Framework for Self-Testing in Bell Scenarios [37.067444579637076]
  Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely. We present a new approach for quantum self-testing in Bell non-locality scenarios.
  arXiv  Detail & Related papers  (2021-04-27T08:15:01Z)
• Quantum symmetry vs nonlocal symmetry [0.0]
  We introduce the notion of nonlocal symmetry of a graph $G$, defined as a winning quantum correlation for the $G$-automorphism game that cannot be produced classically. Recent connections between quantum group theory and quantum information show that quantum correlations for this game correspond to tracial states on $C(textQut(G))$. We show that quantum symmetry is necessary but not sufficient for nonlocal symmetry.
  arXiv  Detail & Related papers  (2020-12-24T17:01:46Z)
• Continuous-time quantum walks in the presence of a quadratic perturbation [55.41644538483948]
  We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
  arXiv  Detail & Related papers  (2020-05-13T14:53:36Z)
• Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk [0.0]
  The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph. It can improve spatial search on the complete graph, discrete torus, cycle, and regular complete bipartite graph. We present a number of numerical simulations supporting this hypothesis.
  arXiv  Detail & Related papers  (2020-02-26T00:10:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.