Intricacies of quantum computational paths

DOI10.1007/s11128-012-0475-7zbMath1264.68080OpenAlexW2007867706WikidataQ57696179 ScholiaQ57696179MaRDI QIDQ1952642

Luís Tarrataca, Andreas Wichert

Publication date: 31 May 2013

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-012-0475-7

zbMATH Keywords

quantum searchquantum random walksquantum computational paths

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Quantum walks on two kinds of two-dimensional models, Szegedy quantum walks with memory on regular graphs, Quantum walks with memory provided by parity of memory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree search and quantum computation
• A framework for structured quantum search.
• Discrete-query quantum algorithm for NAND trees
• Exponential algorithmic speedup by a quantum walk
• Strengths and Weaknesses of Quantum Computing
• Quantum walks on graphs
• Quantum lower bounds by polynomials
• Quantum Algorithms for Evaluating Min-Max Trees
• Quantum lower bounds by quantum arguments