Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2508.00562

Persistent Quantum Memory in Iterated Lifts

Hartosh Singh Bal

Published Aug 1, 2025• 0 citations
arXivHTMLPDF

Abstract

We study quantum coherence in continuous-time quantum walks on perfect graphs generated by the symmetric lift ${\mathrm{HL}}'_2(G)$, a canonical, unweighted, undirected construction defined as the line graph of a bipartite double cover of $G$. This lift acts as both a coherence-preserving and coherence-inducing transformation: it preserves and scales structured quantum interference in highly symmetric base graphs, and induces sustained coherence in random or weakly structured ones. In small graphs such as $K_4$, $K_5$, and the Petersen graph, where quantum walks exhibit sharp revivals and high return probability, repeated $\mathrm{HL}'_2$ lifting produces towers of perfect graphs with thousands to tens of thousands of vertices that retain periodic or quasi-periodic coherence. When applied to random regular or Erdős--Rényi graphs with flat or decaying return behavior, the lift introduces structured interference and significant amplification of mean and peak return probabilities. To quantify these effects, we evaluate standard coherence metrics from quantum resource theory, including inverse participation ratio (IPR), purity, relative entropy of coherence, and the logarithmic coherence number. These measures confirm that $\mathrm{HL}'_2$ lifting delocalizes eigenstates, increases coherence entropy, and expands the basis support of quantum states. These results demonstrate that $\mathrm{HL}'_2$ is a scalable and structurally grounded mechanism for organizing quantum interference, and introduce a new family of perfect graphs that support long-time quantum coherence without spectral tuning or engineered weights.

DOI
10.48550/arxiv.2508.00562

Related papers

Localization Without Disorder: Quantum Walks on Structured Graphs

Shyam Dhamapurkar, K. Venkata Subrahmanyam

Continuous-time quantum walks (CTQWs) exhibit localization phenomena that differ fundamentally from their classical counterparts, yet the precise relationship between network structure, spectral degeneracy, and confined dynamics remains incompletely understood. In this work, we present a complete analytical characterization of localization in CTQWs on two highly symmetric graph families: barbell graphs and star-of-cliques graphs. These networks combine pronounced spectral degeneracy with modular structure, enabling exact diagonalization and explicit computation of both eigenstate and dynamical inverse participation ratios (IPRs). Our analysis reveals that localization is governed by the interplay between degenerate subspaces, which generate families of confined modes, and hybridization between invariant subspaces, which redistributes spectral weight. Notably, the dynamical IPR can exceed expectations based solely on eigenstate IPRs, demonstrating that coherent superposition within degenerate eigenspaces enhances confinement. By connecting IPR values to the effective number of vertices visited, we provide a structural diagnostic for predicting quantum transport outcomes in modular networks, establishing that connectivity alone can determine where and how strongly a quantum walk localizes.

quant-pharXiv:2603.05643•Physical Review A•Mar 9, 2026•0 citations

The Geometry of Quantum Walks on Graphs—Theory and Applications

Ernesto Estrada

We introduce a geometric framework for continuous-time quantum walks on graphs by embedding each vertex into a Euclidean space through its time-dependent quantum probability distribution. This construction induces a rich geometry in which quantum transport is characterized by distances, radii, angles, and simplex volumes, allowing interference, localization, and spreading to be analyzed within a unified metric-angular formalism. We prove that, in contrast to classical diffusion, which collapses to a spherical geometry, quantum dynamics generate a generically non-spherical affine geometry with persistent anisotropy. Applying this theory to real-world networks—including transportation systems, semantic graphs, and neuronal connectomes—we show that quantum geometry reveals dynamically meaningful backbones, interference-based “communities”, and vulnerability structures that are invisible to classical random-walk and spectral methods. In particular, angular and radial quantum descriptors isolate functional hubs, control cores, and coherence classes without any topological or dimensionality assumptions. Together, these results demonstrate that quantum-walk-induced geometry provides a powerful new lens for understanding structure and function in complex networks.

Mathematics•Jun 20, 2026•0 citations

Perfect State Transfer in Quantum Walks on Graphs

Viv M. Kendon, Christino Tamon

We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time walks quantum walks on highly structured graphs exhibit perfect state transfer for the complete graph of size 2, the path of length 3, and the cycle of size 4. From these, larger graphs can be constructed, and the use of edge weights widens this set considerably. Discrete-time quantum walks have more flexibility through exploiting the coin degrees of freedom, but with the disadvantage that local control of the coin is required if the degree of the vertices varies. The closely related property of periodicity (exact return to the starting state) is also mentioned.

Journal of Computational and Theoretical Nanoscience•Mar 1, 2011•104 citations

Time-continuous open quantum walks (Conference Presentation)

Radhakrishnan Balu, Chaobin Liu

Continuous-time open quantum walks (CTOQW) are introduced as the formulation of quantum dynamical semigroups of trace-preserving and completely positive linear maps (or quantum Markov semigroups) on graphs. We show that a CTOQW always converges to a steady state regardless of the initial state when a graph is connected. When the graph is both connected and regular, it is shown that the steady state is the maximally mixed state. The difference of long-time behaviors between CTOQW and other two continuous-time processes on graphs is exemplified. The examples demonstrate that the structure of a graph can affect a quantum coherence effect on CTOQW through a long time run. Precisely, a quantum coherence effect persists throughout the evolution of the CTOQW when the underlying topology is certain irregular graphs (such as a path or a star as shown in the examples). In contrast, a quantum coherence effect will eventually vanish from the open quantum system when the underlying topology is a regular graph (such as a cycle).

•Jun 7, 2017•0 citations

Continuous-time quantum walks on directed bipartite graphs

Beat Tödtli, Monika Laner, Jouri Semenov +3 more

This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by tuning a model parameter $\ensuremath{\alpha}$. We provide analytic solutions to the quantum walks for the star and circulant graph classes that are valid for an arbitrary value of the number of nodes $N$, time $t$, and the model parameter $\ensuremath{\alpha}$. We discuss quantitative and qualitative aspects of quantum walks based on directed graphs and their undirected counterparts. Numerical simulations of quantum walks on circulant graphs show complex interference phenomena and how complete suppression of transport is achieved near $\ensuremath{\alpha}=\ensuremath{\pi}/2$. By proving two mirror symmetries around $\ensuremath{\alpha}=0$ and $\ensuremath{\pi}/2$ we show that these quantum walks have a period of $\ensuremath{\pi}$ in $\ensuremath{\alpha}$. We show that undirected edges lose their effect on the quantum walk at $\ensuremath{\alpha}=\ensuremath{\pi}/2$ and present non-bipartite graphs that exhibit suppression of transport. Finally, we analytically compute the Hamiltonians of quantum walks on the directed ring graph.

arXiv:1606.00992•Physical Review A•Nov 30, 2016•11 citations

Temporal nonclassicality in continuous-time quantum walks

Paolo Luppi, Claudia Benedetti, Andrea Smirne

We investigate the genuinely quantum features of continuous-time quantum walks by combining a single-time and a multi-time quantifier of nonclassicality. On the one hand, we consider the quantum-classical dynamical distance $D_{\mathrm{QC}}(t)$, which measures the departure of the time-evolved quantum state of a continuous-time quantum walk from the classical state of a random walk on the same graph. On the other, we analyse the joint probability distributions associated with sequential measurements of the walker's position, assessing their violation of the classical Kolmogorov consistency conditions via a dedicated quantifier $\bar{K}(t)$. We demonstrate a quadratic short-time scaling of $\bar{K}(t)$, which differs from the known linear scaling of $D_{\mathrm{QC}}(t)$, but, as the latter, is fully determined by the degree of the initially occupied node and is independent of the global graph topology. At longer times, instead, $\bar{K}(t)$ exhibits a pronounced topology-driven behavior: it is strongly suppressed on complete graphs while remaining finite and oscillatory on cycles, in contrast with the almost topology-independent asymptotics of $D_{\mathrm{QC}}(t)$. We then extend the analysis to Markovian open-system dynamics, focusing on dephasing in the position basis (Haken-Strobl model) and in the energy basis (intrinsic decoherence). Site dephasing drives both quantifiers to zero, with the decay of $\bar{K}(t)$ controlled by the spectral gap of the corresponding Lindblad generator. By contrast, energy-basis dephasing preserves a finite asymptotic value of $\bar{K}(t)$, depending on the overlap structure of the Laplacian eigenspaces with the site basis.

quant-pharXiv:2512.18873•Physical Review A•Dec 23, 2025•4 citations
We study quantum coherence in continuous-time quantum walks on perfect graphs generated by the symmetric lift HL2′(G){\mathrm{HL}}'_2(G)HL2′​(G), a canonical, unweighted, undirected construction defined as the line graph of a bipartite double cover of GGG. This lift acts as both a coherence-preserving and coherence-inducing transformation: it preserves and scales structured quantum interference in highly symmetric base graphs, and induces sustained coherence in random or weakly structured ones. In small graphs such as K4K_4K4​, K5K_5K5​, and the Petersen graph, where quantum walks exhibit sharp revivals and high return probability, repeated HL2′\mathrm{HL}'_2HL2′​ lifting produces towers of perfect graphs with thousands to tens of thousands of vertices that retain periodic or quasi-periodic coherence. When applied to random regular or Erdős--Rényi graphs with flat or decaying return behavior, the lift introduces structured interference and significant amplification of mean and peak return probabilities. To quantify these effects, we evaluate standard coherence metrics from quantum resource theory, including inverse participation ratio (IPR), purity, relative entropy of coherence, and the logarithmic coherence number. These measures confirm that HL2′\mathrm{HL}'_2HL2′​ lifting delocalizes eigenstates, increases coherence entropy, and expands the basis support of quantum states. These results demonstrate that HL2′\mathrm{HL}'_2HL2′​ is a scalable and structurally grounded mechanism for organizing quantum interference, and introduce a new family of perfect graphs that support long-time quantum coherence without spectral tuning or engineered weights.
Continuous-time quantum walks (CTQWs) exhibit localization phenomena that differ fundamentally from their classical counterparts, yet the precise relationship between network structure, spectral degeneracy, and confined dynamics remains incompletely understood. In this work, we present a complete analytical characterization of localization in CTQWs on two highly symmetric graph families: barbell graphs and star-of-cliques graphs. These networks combine pronounced spectral degeneracy with modular structure, enabling exact diagonalization and explicit computation of both eigenstate and dynamical inverse participation ratios (IPRs). Our analysis reveals that localization is governed by the interplay between degenerate subspaces, which generate families of confined modes, and hybridization between invariant subspaces, which redistributes spectral weight. Notably, the dynamical IPR can exceed expectations based solely on eigenstate IPRs, demonstrating that coherent superposition within degenerate eigenspaces enhances confinement. By connecting IPR values to the effective number of vertices visited, we provide a structural diagnostic for predicting quantum transport outcomes in modular networks, establishing that connectivity alone can determine where and how strongly a quantum walk localizes.
We introduce a geometric framework for continuous-time quantum walks on graphs by embedding each vertex into a Euclidean space through its time-dependent quantum probability distribution. This construction induces a rich geometry in which quantum transport is characterized by distances, radii, angles, and simplex volumes, allowing interference, localization, and spreading to be analyzed within a unified metric-angular formalism. We prove that, in contrast to classical diffusion, which collapses to a spherical geometry, quantum dynamics generate a generically non-spherical affine geometry with persistent anisotropy. Applying this theory to real-world networks—including transportation systems, semantic graphs, and neuronal connectomes—we show that quantum geometry reveals dynamically meaningful backbones, interference-based “communities”, and vulnerability structures that are invisible to classical random-walk and spectral methods. In particular, angular and radial quantum descriptors isolate functional hubs, control cores, and coherence classes without any topological or dimensionality assumptions. Together, these results demonstrate that quantum-walk-induced geometry provides a powerful new lens for understanding structure and function in complex networks.
We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time walks quantum walks on highly structured graphs exhibit perfect state transfer for the complete graph of size 2, the path of length 3, and the cycle of size 4. From these, larger graphs can be constructed, and the use of edge weights widens this set considerably. Discrete-time quantum walks have more flexibility through exploiting the coin degrees of freedom, but with the disadvantage that local control of the coin is required if the degree of the vertices varies. The closely related property of periodicity (exact return to the starting state) is also mentioned.
Continuous-time open quantum walks (CTOQW) are introduced as the formulation of quantum dynamical semigroups of trace-preserving and completely positive linear maps (or quantum Markov semigroups) on graphs. We show that a CTOQW always converges to a steady state regardless of the initial state when a graph is connected. When the graph is both connected and regular, it is shown that the steady state is the maximally mixed state. The difference of long-time behaviors between CTOQW and other two continuous-time processes on graphs is exemplified. The examples demonstrate that the structure of a graph can affect a quantum coherence effect on CTOQW through a long time run. Precisely, a quantum coherence effect persists throughout the evolution of the CTOQW when the underlying topology is certain irregular graphs (such as a path or a star as shown in the examples). In contrast, a quantum coherence effect will eventually vanish from the open quantum system when the underlying topology is a regular graph (such as a cycle).
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by tuning a model parameter $\ensuremath{\alpha}$. We provide analytic solutions to the quantum walks for the star and circulant graph classes that are valid for an arbitrary value of the number of nodes NNN, time ttt, and the model parameter $\ensuremath{\alpha}$. We discuss quantitative and qualitative aspects of quantum walks based on directed graphs and their undirected counterparts. Numerical simulations of quantum walks on circulant graphs show complex interference phenomena and how complete suppression of transport is achieved near $\ensuremath{\alpha}=\ensuremath{\pi}/2$. By proving two mirror symmetries around $\ensuremath{\alpha}=0$ and $\ensuremath{\pi}/2$ we show that these quantum walks have a period of $\ensuremath{\pi}$ in $\ensuremath{\alpha}$. We show that undirected edges lose their effect on the quantum walk at $\ensuremath{\alpha}=\ensuremath{\pi}/2$ and present non-bipartite graphs that exhibit suppression of transport. Finally, we analytically compute the Hamiltonians of quantum walks on the directed ring graph.
We investigate the genuinely quantum features of continuous-time quantum walks by combining a single-time and a multi-time quantifier of nonclassicality. On the one hand, we consider the quantum-classical dynamical distance DQC(t)D_{\mathrm{QC}}(t)DQC​(t), which measures the departure of the time-evolved quantum state of a continuous-time quantum walk from the classical state of a random walk on the same graph. On the other, we analyse the joint probability distributions associated with sequential measurements of the walker's position, assessing their violation of the classical Kolmogorov consistency conditions via a dedicated quantifier Kˉ(t)\bar{K}(t)Kˉ(t). We demonstrate a quadratic short-time scaling of Kˉ(t)\bar{K}(t)Kˉ(t), which differs from the known linear scaling of DQC(t)D_{\mathrm{QC}}(t)DQC​(t), but, as the latter, is fully determined by the degree of the initially occupied node and is independent of the global graph topology. At longer times, instead, Kˉ(t)\bar{K}(t)Kˉ(t) exhibits a pronounced topology-driven behavior: it is strongly suppressed on complete graphs while remaining finite and oscillatory on cycles, in contrast with the almost topology-independent asymptotics of DQC(t)D_{\mathrm{QC}}(t)DQC​(t). We then extend the analysis to Markovian open-system dynamics, focusing on dephasing in the position basis (Haken-Strobl model) and in the energy basis (intrinsic decoherence). Site dephasing drives both quantifiers to zero, with the decay of Kˉ(t)\bar{K}(t)Kˉ(t) controlled by the spectral gap of the corresponding Lindblad generator. By contrast, energy-basis dephasing preserves a finite asymptotic value of Kˉ(t)\bar{K}(t)Kˉ(t), depending on the overlap structure of the Laplacian eigenspaces with the site basis.