How fast do quantum walks mix?
- URL: http://arxiv.org/abs/2001.06305v1
- Date: Tue, 14 Jan 2020 10:45:41 GMT
- Title: How fast do quantum walks mix?
- Authors: Shantanav Chakraborty, Kyle Luh, J\'er\'emie Roland
- Abstract summary: We find the quantum mixing time of Erd"os-Renyi random networks where each edge exists with probability $p$ independently.
Our results could lead to novel insights into the equilibration times of isolated quantum systems defined by random Hamiltonians.
- Score: 0.34410212782758054
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The fundamental problem of sampling from the limiting distribution of quantum
walks on networks, known as \emph{mixing}, finds widespread applications in
several areas of quantum information and computation. Of particular interest in
most of these applications, is the minimum time beyond which the instantaneous
probability distribution of the quantum walk remains close to this limiting
distribution, known as the \emph{quantum mixing time}. However this quantity is
only known for a handful of specific networks. In this letter, we prove an
upper bound on the quantum mixing time for \emph{almost all networks}, i.e.\
the fraction of networks for which our bound holds, goes to one in the
asymptotic limit. To this end, using several results in random matrix theory,
we find the quantum mixing time of Erd\"os-Renyi random networks: networks of
$n$ nodes where each edge exists with probability $p$ independently. For
example for dense random networks, where $p$ is a constant, we show that the
quantum mixing time is $\mathcal{O}\left(n^{3/2 + o(1)}\right)$. Besides
opening avenues for the analytical study of quantum dynamics on random
networks, our work could find applications beyond quantum information
processing. Owing to the universality of Wigner random matrices, our results on
the spectral properties of random graphs hold for general classes of random
matrices that are ubiquitous in several areas of physics. In particular, our
results could lead to novel insights into the equilibration times of isolated
quantum systems defined by random Hamiltonians, a foundational problem in
quantum statistical mechanics.
Related papers
- Mixing time of quantum Gibbs sampling for random sparse Hamiltonians [0.23020018305241333]
A newly developed quantum Gibbs sampling algorithm by Chen, Kastoryano, and Gily'en provides an efficient simulation of non-commutative quantum systems.
We establish a polylog(n) upper bound on its mixing time for various families of random n by n sparse Hamiltonians at any constant temperature.
Our result places this method for Gibbs sampling on par with other efficient algorithms for preparing low-energy states of quantumly easy Hamiltonians.
arXiv Detail & Related papers (2024-11-07T06:01:19Z) - Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.
We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.
We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
arXiv Detail & Related papers (2024-10-10T16:10:10Z) - Constant-Time Quantum Search with a Many-Body Quantum System [39.58317527488534]
We consider a many-body quantum system that naturally effects parallel queries.
We show that its parameters can be tuned to search a database in constant time.
arXiv Detail & Related papers (2024-08-09T22:57:59Z) - A quantum walk-based scheme for distributed searching on arbitrary
graphs [0.0]
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton.
This work introduces a new quantum walk-based searching scheme, designed to search nodes or edges on arbitrary graphs.
arXiv Detail & Related papers (2023-10-16T14:35:05Z) - On the quantum simulation of complex networks [0.0]
Continuous-time quantum walk algorithms assume that we can simulate the dynamics of quantum systems where the Hamiltonian is given by the adjacency matrix of the graph.
We extend the state-of-the-art results on quantum simulation to graphs that contain a small number of hubs, but that are otherwise sparse.
arXiv Detail & Related papers (2022-12-12T18:55:31Z) - Quantum walks on random lattices: Diffusion, localization and the
absence of parametric quantum speed-up [0.0]
We study propagation of quantum walks on percolation-generated two-dimensional random lattices.
We show that even arbitrarily weak concentrations of randomly removed lattice sites give rise to a complete breakdown of the superdiffusive quantum speed-up.
The fragility of quantum speed-up implies dramatic limitations for quantum information applications of quantum walks on random geometries and graphs.
arXiv Detail & Related papers (2022-10-11T10:07:52Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - 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) - 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) - Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise.
Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
arXiv Detail & Related papers (2021-03-31T02:41:36Z) - Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics.
The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system.
Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
arXiv Detail & Related papers (2021-03-05T08:32:43Z)
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.