Counting by quantum eigenvalue estimation

DOI10.1016/S0304-3975(00)00217-6zbMath0972.68080WikidataQ127185664 ScholiaQ127185664MaRDI QIDQ5941565

No author found.

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

quantum counting

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items

Simulation of a quantum algorithm for phase estimation, Quantum computer algorithm for parity determination based on quantum counting, QUANTUM SEARCH ALGORITHMS, Obtaining a linear combination of the principal components of a matrix on quantum computers, Generalized quantum counting algorithm for non-uniform amplitude distribution, Entanglement in phase estimation algorithm and quantum counting algorithm, HIERARCHICAL QUANTUM SEARCH, Quantum solution to a class of two-party private summation problems, Fixed-Point Quantum Search, Strong privacy-preserving two-party scalar product quantum protocol, Quantum private set intersection cardinality and its application to anonymous authentication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random generation of combinatorial structures from a uniform distribution
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum algorithms revisited
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Strengths and Weaknesses of Quantum Computing
• Quantum complexity theory