Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

DOI10.1007/b11961zbMath1279.81056arXivquant-ph/0305182OpenAlexW4298253479MaRDI QIDQ5900941

Heath Gerhardt, John Watrous

Publication date: 26 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0305182

Mathematics Subject Classification ID

Representations of finite symmetric groups (20C30) Quantum computation (81P68) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Quantum stochastic calculus (81S25)

Related Items (11)

Efficient quantum circuits for Szegedy quantum walks ⋮ Quantum decomposition of random walk on Cayley graph of finite group ⋮ Quantum Walks ⋮ One-dimensional continuous-time quantum walks ⋮ Uniform mixing and association schemes ⋮ Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix ⋮ Quantum walk and its application domains: a systematic review ⋮ Continuous-time quantum walks on Cayley graphs of extraspecial groups ⋮ Quantum tunneling on graphs ⋮ The Quantum Complexity of Markov Chain Monte Carlo ⋮ Absorption probabilities of discrete quantum mechanical systems

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques