Quantum walks on graphs
From MaRDI portal
Publication:5175952
DOI10.1145/380752.380758zbMath1323.81020arXivquant-ph/0012090MaRDI QIDQ5175952
Andris Ambainis, Umesh V. Vazirani, Julia Kempe, Dorit Aharonov
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0012090
68Q25: Analysis of algorithms and problem complexity
81P68: Quantum computation
81S25: Quantum stochastic calculus
82C10: Quantum dynamics and nonequilibrium statistical mechanics (general)
05C81: Random walks on graphs
Related Items
Möbius quantum walk, One-dimensional lackadaisical quantum walks, Probability distributions for Markov chain based quantum walks, Limiting properties of stochastic quantum walks on directed graphs, Fast universal quantum computation with railroad-switch local Hamiltonians, Quantum Walks, Continuous-time quantum walk on integer lattices and homogeneous trees, The staggered quantum walk model, Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model, Grover walks on a line with absorbing boundaries, Open quantum random walks, Controllability of system dynamics on networks, quantum walks and random walks, Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties, Propagation of correlations in local random quantum circuits, Connection between continuous and discrete time quantum walks. From \(D\)-dimensional lattices to general graphs, Quantum walks, Ihara zeta functions and cospectrality in regular graphs, Crossover from diffusive to ballistic transport in periodic quantum maps, On the relationship between continuous- and discrete-time quantum walk, The minimum semidefinite rank of a triangle-free graph, A hybrid classical-quantum clustering algorithm based on quantum walks, On limiting distributions of quantum Markov chains, Tree search and quantum computation, Dynamical localization of quantum walks in random environments, Random time-dependent quantum walks, The QWalk simulator of quantum walks, Simulating a perceptron on a quantum computer, Hamilton cycles in digraphs of unitary matrices, Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix, Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory, Quantum loop programs, Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm, Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory, Graph matching using the interference of continuous-time quantum walks, A note on the search for \(k\) elements via quantum walk, A quantum Jensen-Shannon graph kernel for unattributed graphs, Exceptional quantum walk search on the cycle, Localization of a multi-dimensional quantum walk with one defect, Equivalence of Szegedy's and coined quantum walks, Generalized teleportation by quantum walks, Coherence of one-dimensional quantum walk on cycles, The spectral analysis of the unitary matrix of a 2-tessellable staggered quantum walk on a graph, Quantum walks: a comprehensive review, Time averaged distribution of a discrete-time quantum walk on the path, Asymptotic distributions of quantum walks on the line with two entangled coins, Spatial search using the discrete time quantum walk, Correlated Markov quantum walks, One-dimensional quantum walks with absorbing boundaries, Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks, Intricacies of quantum computational paths, Coined quantum walks lift the cospectrality of graphs and trees, Efficient quantum circuits for Szegedy quantum walks, One-dimensional continuous-time quantum walks, Exact simulation of coined quantum walks with the continuous-time model, Comparing classical and quantum pageranks, On the hitting times of quantum versus random walks, Spectral transition for random quantum walks on trees, Graphs of unitary matrices and positive semidefinite zero forcing, Termination of nondeterministic quantum programs, Proof rules for the correctness of quantum programs, Optimal computation with non-unitary quantum walks, Entangled Markov chains, Spectral properties of quantum walks on rooted binary trees, Discrete quantum walks hit exponentially faster, Ergodic quantum computing, Quantum walks, deformed relativity and Hopf algebra symmetries, Virtually Abelian quantum walks, A simple method for finding the scattering coefficients of quantum graphs, Quantum Predictor Models, Infinite dimensional entangled Markov chains, Quantum Walk Based Search Algorithms, The Quantum Complexity of Markov Chain Monte Carlo, CONTINUOUS-TIME QUANTUM WALKS AND TRAPPING, Characteristic Polynomial Analysis on Matrix Representations of Graphs
Cites Work
