Intricacies of quantum computational paths

DOI10.1007/S11128-012-0475-7MaRDI QIDQ1952642zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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 algorithms and complexity in the theory of computing (68Q12) Quantum coherence, entanglement, quantum correlations (81P40)

Recommendations

• Tree search and quantum computation
• Quantum walks and search algorithms
• Finding more than one path through a simple maze with a quantum walk
• A panoply of quantum algorithms
• QUANTUM WALKS ON GENERAL GRAPHS

Cites work

• scientific article; zbMATH DE number 5899272 (Why is no real title available?)
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 5076264 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 742629 (Why is no real title available?)
• scientific article; zbMATH DE number 1941662 (Why is no real title available?)
• scientific article; zbMATH DE number 1775389 (Why is no real title available?)
• A framework for structured quantum search.
• Discrete-query quantum algorithm for NAND trees
• Exponential algorithmic speedup by a quantum walk
• How significant are the known collision and element distinctness quantum algorithms?
• Introduction to algorithms
• Quantum Algorithms for Evaluating Min-Max Trees
• Quantum lower bounds by polynomials
• Quantum lower bounds by quantum arguments
• Quantum walks on graphs
• Strengths and Weaknesses of Quantum Computing
• Tree search and quantum computation

Cited in

(4)

• Quantum walks on two kinds of two-dimensional models
• Szegedy quantum walks with memory on regular graphs
• Tree search and quantum computation
• Quantum walks with memory provided by parity of memory

This page was built for publication: Intricacies of quantum computational paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952642)