Quantum sampling for balanced allocations

DOI10.1007/3-540-45071-8_32MaRDI QIDQ3082938zbMATH OpenOpenAlexFDO

Authors Akinori Kawachi, S. Yamasita, Kazuo Iwama

Publication date 18 March 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45071-8_32

Mathematics Subject Classification ID

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

Recommendations

• Phase matching in Grover's algorithm
• Rapid sampling though quantum computing
• Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters
• Improved Grover's quantum searching algorithm
• PHASE MATCHING IN FIXED-POINT QUANTUM SEARCH ALGORITHM

Cited in

(1)

• Sampling of bosonic qubits

This page was built for publication: Quantum sampling for balanced allocations

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