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

Physica Scripta

Quantum walk of two particles on the graphene structure graph with interaction

Qi Han, Ning Bai, Lijie Gou, Shuai Wang, Rong Zhang

Published May 24, 2024• 1 citation
Publisher

Abstract

Abstract In this paper, we discuss the quantum walk of two interacting particles on graphene structure graph. Based on the localized graphene structure graph, we get three cases for the position of the two particles, that is ∂(i, j) = 0, ∂(i, j) = 1, and ∂(i, j) = 2. Subsequently, we investigate the quantum walk of two interacting particles from a new perspective, namely, based on the view of quantum probability, a localized quantum decomposition was used to get the corresponding creation operators and annihilation operators for the first time. Finally, we get the Hamiltonian and the time evolution operator of two interacting particles on the graphene structure graph.

DOI
10.1088/1402-4896/ad4bd5

Related papers

Bilayer graphene coherent states

David J. Fernández C., Dennis I. Martínez-Moreno

In this paper we consider the interaction of electrons in bilayer graphene with a constant homogeneous magnetic field which is orthogonal to the bilayer surface. Departing from the energy eigenstates of the effective Hamiltonian, the corresponding coherent states will be constructed. For doing this, first we will determine appropriate creation and annihilation operators in order to subsequently derive the coherent states as eigenstates of the annihilation operator with complex eigenvalue. Then, we will calculate some physical quantities, as the Heisenberg uncertainty relation, the probabilities and current density as well as the mean energy value. Finally, we will explore the time evolution for these states and we will compare it with the corresponding evolution for monolayer graphene coherent states.

arXiv:2007.02229•Jul 5, 2020•2 citations

Bilayer graphene coherent states

J C David Fernández, Dennis I. Martínez-Moreno

In this paper we consider the interaction of electrons in bilayer graphene with a constant homogeneous magnetic field which is orthogonal to the bilayer surface. Departing from the energy eigenstates of the effective Hamiltonian, the corresponding coherent states will be constructed. For doing this, first we will determine appropriate creation and annihilation operators in order to subsequently derive the coherent states as eigenstates of the annihilation operator with complex eigenvalue. Then, we will calculate some physical quantities, as the Heisenberg uncertainty relation, the probabilities and current density as well as the mean energy value. Finally, we will explore the time evolution for these states and we will compare it with the corresponding evolution for monolayer graphene coherent states.

•Jul 5, 2020•0 citations

Two-particle quantum walks: Entanglement and graph isomorphism testing

Scott M. Berry, Jingbo B. Wang

We study discrete-time quantum walks on the line and on general undirected graphs with two interacting or noninteracting particles. We introduce two simple interaction schemes and show that they both lead to a diverse range of probability distributions that depend on the correlations and relative phases between the initial coin states of the two particles. We investigate the characteristics of these quantum walks and the time evolution of the entanglement between the two particles from both separable and entangled initial states. We also test the capability of two-particle discrete-time quantum walks to distinguish nonisomorphic graphs. For strongly regular graphs, we show that noninteracting discrete-time quantum walks can distinguish some but not all nonisomorphic graphs with the same family parameters. By incorporating an interaction between the two particles, all nonisomorphic strongly regular graphs tested are successfully distinguished.

Physical Review A•Apr 14, 2011•153 citations

Alternated two-particle discrete-time quantum walk on arbitrary graphs and its application on graph isomorphism testing

Panlong Li, Dan Li, Yuqian Zhou +2 more

Abstract This paper introduces a novel alternated two-particle discrete-time quantum walk model on arbitrary graphs, overcoming the limitation that conventional shared coin schemes are confined to regular graphs. By employing a fixed-dimension coin operator and encoding the graph structural information into the shift operator, the new model becomes applicable to arbitrary graphs. Further, by adding interaction between the two particles, an extension is presented, which can enhance the model’s dynamic properties and facilitate more intricate quantum interference phenomena. Based on the new model, a kind of quantum graph isomorphism algorithm framework is proposed. It just need O(N 0.5*∣E∣) steps of quantum walk and O(N 2) dimensions of Hilbert space, which offers a significant reduction in complexity compared to other quantum walk based algorithms. The graph isomorphism testing is performed in the framework using non-interacting and interacting quantum walks respectively. Experimental results illustrate that the algorithm based on interacting particles achieves a 100% success rate in discriminating all test graphs. While the algorithm with non-interacting particles performs a 100% distinction success rate on general non-regular graphs, albeit being ineffective on strongly regular graphs. Due to the effectiveness of the algorithm on arbitrary graphs, the algorithm has broad application prospects in the identification and comparison of chemical molecular structures, the analysis of social networks and so on.

Physica Scripta•Feb 7, 2025•0 citations

The continuous-time quantum walk on some graphs based on the view of quantum probability

Qi Han, Yaxin Kou, Ning Bai +1 more

In this paper, continuous-time quantum walk is discussed based on the view of quantum probability, i.e. the quantum decomposition of the adjacency matrix A of graph. Regard adjacency matrix A as Hamiltonian which is a real symmetric matrix with elements 0 or 1, so we regard [Formula: see text] as an unbiased evolution operator, which is related to the calculation of probability amplitude. Combining the quantum decomposition and spectral distribution [Formula: see text] of adjacency matrix A, we calculate the probability amplitude reaching each stratum in continuous-time quantum walk on complete bipartite graphs, finite two-dimensional lattices, binary tree, [Formula: see text]-ary tree and [Formula: see text]-fold star power [Formula: see text]. Of course, this method is also suitable for studying some other graphs, such as growing graphs, hypercube graphs and so on, in addition, the applicability of this method is also explained.

International Journal of Quantum Information•Apr 29, 2022•6 citations

Quantum Walk-Based Algorithms for Graph Traversal and Search

Jincheng Zhang

This paper explores the application of quantum walk algorithms to graph traversal and search problems. Classical algorithms often struggle with the computational complexity of traversing and searching large graphs, leading to significant time and resource limitations. Quantum walks, utilizing superposition and interference, offer a potential pathway to achieve exponential speedups. This work details the theoretical framework for applying quantum walks to graph problems, specifically focusing on traversal and search tasks. We present a generalized approach for mapping graph structures onto quantum walk systems and discuss the key mathematical formulations involved. The core of our investigation revolves around the construction of quantum walk operators that mimic the movement and interaction rules inherent in graph traversal. We analyze the evolution of the quantum walk state and derive expressions for the probability of reaching a specific node in the graph. Furthermore, we examine the impact of graph topology on the performance of the quantum walk, highlighting the potential for tailored algorithms to exploit specific graph structures. The results demonstrate the theoretical feasibility of quantum walk algorithms for significantly accelerating graph traversal and search operations, contributing to advancements in areas such as network analysis, database management, and artificial intelligence.

•Sep 6, 2026•0 citations
Abstract In this paper, we discuss the quantum walk of two interacting particles on graphene structure graph. Based on the localized graphene structure graph, we get three cases for the position of the two particles, that is ∂(i, j) = 0, ∂(i, j) = 1, and ∂(i, j) = 2. Subsequently, we investigate the quantum walk of two interacting particles from a new perspective, namely, based on the view of quantum probability, a localized quantum decomposition was used to get the corresponding creation operators and annihilation operators for the first time. Finally, we get the Hamiltonian and the time evolution operator of two interacting particles on the graphene structure graph.
In this paper we consider the interaction of electrons in bilayer graphene with a constant homogeneous magnetic field which is orthogonal to the bilayer surface. Departing from the energy eigenstates of the effective Hamiltonian, the corresponding coherent states will be constructed. For doing this, first we will determine appropriate creation and annihilation operators in order to subsequently derive the coherent states as eigenstates of the annihilation operator with complex eigenvalue. Then, we will calculate some physical quantities, as the Heisenberg uncertainty relation, the probabilities and current density as well as the mean energy value. Finally, we will explore the time evolution for these states and we will compare it with the corresponding evolution for monolayer graphene coherent states.
In this paper we consider the interaction of electrons in bilayer graphene with a constant homogeneous magnetic field which is orthogonal to the bilayer surface. Departing from the energy eigenstates of the effective Hamiltonian, the corresponding coherent states will be constructed. For doing this, first we will determine appropriate creation and annihilation operators in order to subsequently derive the coherent states as eigenstates of the annihilation operator with complex eigenvalue. Then, we will calculate some physical quantities, as the Heisenberg uncertainty relation, the probabilities and current density as well as the mean energy value. Finally, we will explore the time evolution for these states and we will compare it with the corresponding evolution for monolayer graphene coherent states.
We study discrete-time quantum walks on the line and on general undirected graphs with two interacting or noninteracting particles. We introduce two simple interaction schemes and show that they both lead to a diverse range of probability distributions that depend on the correlations and relative phases between the initial coin states of the two particles. We investigate the characteristics of these quantum walks and the time evolution of the entanglement between the two particles from both separable and entangled initial states. We also test the capability of two-particle discrete-time quantum walks to distinguish nonisomorphic graphs. For strongly regular graphs, we show that noninteracting discrete-time quantum walks can distinguish some but not all nonisomorphic graphs with the same family parameters. By incorporating an interaction between the two particles, all nonisomorphic strongly regular graphs tested are successfully distinguished.
Abstract This paper introduces a novel alternated two-particle discrete-time quantum walk model on arbitrary graphs, overcoming the limitation that conventional shared coin schemes are confined to regular graphs. By employing a fixed-dimension coin operator and encoding the graph structural information into the shift operator, the new model becomes applicable to arbitrary graphs. Further, by adding interaction between the two particles, an extension is presented, which can enhance the model’s dynamic properties and facilitate more intricate quantum interference phenomena. Based on the new model, a kind of quantum graph isomorphism algorithm framework is proposed. It just need O(N 0.5*∣E∣) steps of quantum walk and O(N 2) dimensions of Hilbert space, which offers a significant reduction in complexity compared to other quantum walk based algorithms. The graph isomorphism testing is performed in the framework using non-interacting and interacting quantum walks respectively. Experimental results illustrate that the algorithm based on interacting particles achieves a 100% success rate in discriminating all test graphs. While the algorithm with non-interacting particles performs a 100% distinction success rate on general non-regular graphs, albeit being ineffective on strongly regular graphs. Due to the effectiveness of the algorithm on arbitrary graphs, the algorithm has broad application prospects in the identification and comparison of chemical molecular structures, the analysis of social networks and so on.
In this paper, continuous-time quantum walk is discussed based on the view of quantum probability, i.e. the quantum decomposition of the adjacency matrix A of graph. Regard adjacency matrix A as Hamiltonian which is a real symmetric matrix with elements 0 or 1, so we regard [Formula: see text] as an unbiased evolution operator, which is related to the calculation of probability amplitude. Combining the quantum decomposition and spectral distribution [Formula: see text] of adjacency matrix A, we calculate the probability amplitude reaching each stratum in continuous-time quantum walk on complete bipartite graphs, finite two-dimensional lattices, binary tree, [Formula: see text]-ary tree and [Formula: see text]-fold star power [Formula: see text]. Of course, this method is also suitable for studying some other graphs, such as growing graphs, hypercube graphs and so on, in addition, the applicability of this method is also explained.
This paper explores the application of quantum walk algorithms to graph traversal and search problems. Classical algorithms often struggle with the computational complexity of traversing and searching large graphs, leading to significant time and resource limitations. Quantum walks, utilizing superposition and interference, offer a potential pathway to achieve exponential speedups. This work details the theoretical framework for applying quantum walks to graph problems, specifically focusing on traversal and search tasks. We present a generalized approach for mapping graph structures onto quantum walk systems and discuss the key mathematical formulations involved. The core of our investigation revolves around the construction of quantum walk operators that mimic the movement and interaction rules inherent in graph traversal. We analyze the evolution of the quantum walk state and derive expressions for the probability of reaching a specific node in the graph. Furthermore, we examine the impact of graph topology on the performance of the quantum walk, highlighting the potential for tailored algorithms to exploit specific graph structures. The results demonstrate the theoretical feasibility of quantum walk algorithms for significantly accelerating graph traversal and search operations, contributing to advancements in areas such as network analysis, database management, and artificial intelligence.