A hybrid quantum walk model unifying discrete and continuous quantum walks
- URL: http://arxiv.org/abs/2509.09221v1
- Date: Thu, 11 Sep 2025 07:55:37 GMT
- Title: A hybrid quantum walk model unifying discrete and continuous quantum walks
- Authors: Tianen Chen, Yun Shang,
- Abstract summary: This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with the Hamiltonian-driven time evolution of continuous walks.<n>The proposed framework demonstrates unifying capabilities by naturally encompassing existing quantum walk models as special cases.
- Score: 1.8835490533310801
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with the Hamiltonian-driven time evolution of continuous walks. Through systematic analysis of probability distributions, standard deviations, and entanglement entropy on fundamental graph structures (2-vertex circles, stars, and lines), we reveal distinctive dynamical characteristics that differentiate our model from conventional quantum walk paradigms. The proposed framework demonstrates unifying capabilities by naturally encompassing existing quantum walk models as special cases. Two significant applications emerge from this hybrid architecture: (1) We develop a novel protocol for perfect state transfer(PST) in general connected graphs, overcoming the limitations of previous graph-specific approaches. A PST on a tree graph has been implemented on a quantum superconducting processor. (2) We devise a quantum algorithm for multiplying $K$ adjacency matrices of $n$-vertex regular graphs with time complexity $O(n^2d_1\cdots d_K)$, outperforming classical matrix multiplication $(O(n^{2.371552}))$ when vertex degrees $d_i$ are bounded. The algorithm's efficacy for triangle counting is experimentally validated through the quantum simulation on PennyLane. These results establish the hybrid quantum walk as a versatile framework bridging discrete and continuous paradigms while enabling practical quantum advantage in graph computation tasks.
Related papers
- Trigonometric continuous-variable gates and hybrid quantum simulations [0.0]
We introduce a complementary paradigm based on trigonometric continuous-variable gates.<n>We develop a hybrid qubit-qumode quantum simulation of the lattice sine-Gordon model.<n>We expect that the trigonometric gates introduced here to find broader applications, including quantum simulations of condensed matter systems, quantum chemistry, and biological models.
arXiv Detail & Related papers (2025-12-22T17:08:41Z) - High-dimensional graphs convolution for quantum walks photonic applications [41.94295877935867]
We suggest a new method for lattices and hypercycle convolution that preserves quantum walk dynamics.<n>Our findings may be useful for saving a significant number of qubits required for algorithms that use quantum walk simulation on quantum devices.
arXiv Detail & Related papers (2025-07-21T18:28:34Z) - QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
arXiv Detail & Related papers (2025-04-15T11:29:09Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Unitary Coined Discrete-Time Quantum Walks on Directed Multigraphs [1.2183405753834557]
Unitary Coined Discrete-Time Quantum Walks (UC-DTQW) constitute a universal model of quantum computation.
Current quantum computers work based on the quantum circuit model of computation.
arXiv Detail & Related papers (2023-04-04T07:19:55Z) - Implementation of Continuous-Time Quantum Walks on Quantum Computers [0.0]
Quantum walks are interesting candidates to be implemented on quantum computers.
We describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes.
arXiv Detail & Related papers (2022-12-17T14:59:21Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - How to Teach a Quantum Computer a Probability Distribution [0.0]
We explore teaching a coined discrete time quantum walk on a regular graph a probability distribution.
We also discuss some hardware and software concerns as well as immediate applications and the several connections to machine learning.
arXiv Detail & Related papers (2021-04-15T02:41:27Z) - Quantum Simulation of a Discrete-Time Quantum Stochastic Walk [0.0]
We propose a trajectory-based quantum simulation protocol to implement a family of discrete-time QSWs in a quantum device.
We show how our protocol generalizes to a graph with arbitrary topology and connectivity.
arXiv Detail & Related papers (2020-04-13T18:44:59Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z) - Discrete-Time Quantum Walks on Oriented Graphs [0.0]
We define discrete-time quantum walks on arbitrary oriented graphs.
We introduce a parameter, called alpha, that quantifies the amount of orientation.
arXiv Detail & Related papers (2020-01-13T01:42:42Z)
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.