The Quantum Complexity of Markov Chain Monte Carlo

DOI10.1007/978-3-540-69407-6_55zbMath1142.68375OpenAlexW1581352660MaRDI QIDQ3507468

Peter C. Richter

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_55

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Analysis of algorithms and problem complexity (68Q25) Monte Carlo methods (65C05) Sums of independent random variables; random walks (60G50) Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric bounds for eigenvalues of Markov chains
• From quantum cellular automata to quantum lattice gases
• On the absence of homogeneous scalar unitary cellular automata.
• An example of the difference between quantum and classical random walks
• Some Inequalities for Reversible Markov Chains
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Quantum walks in higher dimensions
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• One-dimensional quantum walks
• Quantum walks on graphs
• Decoherence in quantum walks – a review
• Adiabatic Quantum State Generation
• Quantum Walk Algorithm for Element Distinctness
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Quantum simulations of classical random walks and undirected graph connectivity

This page was built for publication: The Quantum Complexity of Markov Chain Monte Carlo