Multi-query Quantum Sums
From MaRDI portal
Publication:3453317
DOI10.1007/978-3-642-54429-3_10zbMath1451.68126arXiv1107.1940OpenAlexW2136938775MaRDI QIDQ3453317
David A. Meyer, James E. Pommersheim
Publication date: 20 November 2015
Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1940
Quantum computation (81P68) Algorithms on strings (68W32) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the uselessness of quantum queries
- Optimum testing of multiple hypotheses in quantum detection theory
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- On the Power of Quantum Computation
- Quantum lower bounds by polynomials
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
This page was built for publication: Multi-query Quantum Sums
