Quantum Queries on Permutations

DOI10.1007/978-3-319-19225-3_15zbMath1432.68160OpenAlexW1180844790MaRDI QIDQ5500691

Taisia Mischenko-Slatenkova, Ilja Kucevalovs, Alina Vasilieva, Rūsiņš Freivalds

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_15

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Revisiting Deutsch-Jozsa algorithm

Cites Work

• Complexity measures and decision tree complexity: a survey.
• Quantum Queries on Permutations with a Promise
• Rapid solution of problems by quantum computation
• Quantum algorithms revisited
• Algebraic factoring and geometry theorem proving
• Quantum lower bounds by polynomials
• Quantum lower bounds by quantum arguments
• Implementation and Application of Automata
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum Queries on Permutations