QUANTUM WALKS ON NECKLACES AND MIXING

DOI10.1142/S0219749912500256zbMath1242.81107arXiv1111.4433WikidataQ59482317 ScholiaQ59482317MaRDI QIDQ2896888

Mária Kieferová, Daniel Nagaj

Publication date: 5 July 2012

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.4433

zbMATH Keywords

mixingcontinuous quantum walkscyclical graph

Mathematics Subject Classification ID

Quantum stochastic calculus (81S25)

Related Items (2)

Quantum walks: a comprehensive review ⋮ An improved noise quantum annealing method for TSP

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Polynomial-Time Approximation Algorithms for the Ising Model
• Grover's algorithm on a Feynman computer
• Fast universal quantum computation with railroad-switch local Hamiltonians
• The Complexity of the Local Hamiltonian Problem
• Monte Carlo sampling methods using Markov chains and their applications

This page was built for publication: QUANTUM WALKS ON NECKLACES AND MIXING