Irrational quantum walks
- URL: http://arxiv.org/abs/2208.08971v1
- Date: Thu, 18 Aug 2022 17:21:47 GMT
- Title: Irrational quantum walks
- Authors: Gabriel Coutinho, Pedro Ferreira Baptista, Chris Godsil, Thom\'as Jung
Spier, Reinhard Werner
- Abstract summary: We develop theory to study any quantum walk generated by an integral Hamiltonian.
We use our methods to study geometric properties of beautiful curves arising from entries of the quantum walk matrix.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The adjacency matrix of a graph G is the Hamiltonian for a continuous-time
quantum walk on the vertices of G. Although the entries of the adjacency matrix
are integers, its eigenvalues are generally irrational and, because of this,
the behaviour of the walk is typically not periodic. In consequence we can
usually only compute numerical approximations to parameters of the walk. In
this paper, we develop theory to exactly study any quantum walk generated by an
integral Hamiltonian. As a result, we provide exact methods to compute the
average of the mixing matrices, and to decide whether pretty good (or almost)
perfect state transfer occurs in a given graph. We also use our methods to
study geometric properties of beautiful curves arising from entries of the
quantum walk matrix, and discuss possible applications of these results.
Related papers
- One-dimensional Continuous-Time Quantum Markov Chains: qubit
probabilities and measures [0.0]
We study continuous-time QMCs on the integer line, half-line and finite segments.
We are able to obtain exact probability calculations in terms of the associated matrix-valueds and measures.
arXiv Detail & Related papers (2024-02-24T18:02:41Z) - Polynomial-depth quantum algorithm for computing matrix determinant [46.13392585104221]
We propose an algorithm for calculating the determinant of a square matrix, and construct a quantum circuit realizing it.
Each row of the matrix is encoded as a pure state of some quantum system.
The admitted matrix is therefore arbitrary up to the normalization of quantum states of those systems.
arXiv Detail & Related papers (2024-01-29T23:23:27Z) - Quantum tomography of helicity states for general scattering processes [65.268245109828]
Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics.
We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
arXiv Detail & Related papers (2023-10-16T21:23:42Z) - General Graph Random Features [42.75616308187867]
We propose a novel random walk-based algorithm for unbiased estimation of arbitrary functions of a weighted adjacency matrix.
Our algorithm enjoys subquadratic time complexity with respect to the number of nodes, overcoming the notoriously prohibitive cubic scaling of exact graph kernel evaluation.
arXiv Detail & Related papers (2023-10-07T15:47:31Z) - Discrete-time quantum walks on Cayley graphs of Dihedral groups using
generalized Grover coins [0.0]
We study discrete-time quantum walks on Cayley graphs corresponding to Dihedral groups.
We show that the walks are periodic only for coins that are permutation or negative of a permutation matrix.
arXiv Detail & Related papers (2023-09-26T18:53:35Z) - Closed-form expressions for the probability distribution of quantum walk
on a line [0.0]
We derive expressions for the probability distribution of quantum walks on a line.
The most general two-state coin operator and the most general (pure) initial state are considered.
We retrieve the simulated probability distribution of Hadamard walk on a line.
arXiv Detail & Related papers (2023-08-09T20:32:40Z) - Vectorization of the density matrix and quantum simulation of the von
Neumann equation of time-dependent Hamiltonians [65.268245109828]
We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations.
We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix.
A quantum algorithm to simulate the dynamics of the density matrix is proposed.
arXiv Detail & Related papers (2023-06-14T23:08:51Z) - Mean hitting time formula for positive maps [0.0]
We present an analogous construction for the setting of irreducible, positive, trace preserving maps.
The problem at hand is motivated by questions on quantum information theory.
arXiv Detail & Related papers (2022-03-21T01:25:25Z) - Designing exceptional-point-based graphs yielding topologically
guaranteed quantum search [0.0]
We show how to construct walks with the property that all the eigenvalues of the non-Hermitian survival operator, coalesce to zero.
The resulting search is guaranteed to succeed in a bounded time for any initial condition.
arXiv Detail & Related papers (2022-02-08T04:30:24Z) - Spectral clustering under degree heterogeneity: a case for the random
walk Laplacian [83.79286663107845]
This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree.
In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
arXiv Detail & Related papers (2021-05-03T16:36:27Z) - 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)
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.