Quantum counterfeit coin problems

DOI10.1016/j.tcs.2012.05.039zbMath1253.68177OpenAlexW1902734015MaRDI QIDQ714865

Rudy Raymond, Kazuo Iwama, Harumichi Nishimura, Junichi Teruyama

Publication date: 11 October 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.039

zbMATH Keywords

quantum computingquery complexitycounterfeit coin problems

Mathematics Subject Classification ID

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

Related Items (4)

Quantum algorithms for learning hidden strings with applications to matroid problems ⋮ RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC ⋮ Quantum algorithm for learning secret strings and its experimental demonstration ⋮ Quantum algorithms for learning symmetric juntas via the adversary bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the power of Ambainis lower bounds
• The general counterfeit coin problem
• Polynomial degree vs. quantum query complexity
• Searching for two counterfeit coins with two-arms balance
• Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
• Counterfeit Coin Problems
• Quantum Complexity Theory
• Coin-Weighing Problems
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
• Quantum Algorithms for the Triangle Problem
• Quantum Query Complexity of State Conversion
• Classical and Quantum Algorithms for Exponential Congruences
• Quantum lower bounds by quantum arguments

This page was built for publication: Quantum counterfeit coin problems