Quantum counterfeit coin problems

DOI10.1016/J.TCS.2012.05.039MaRDI QIDQ714865zbMATH OpenOpenAlexFDO

Authors Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, 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

query complexityquantum computingcounterfeit coin problems

Mathematics Subject Classification ID

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

Recommendations

• Quantum counterfeit coin problems
• Quantum coin hedging, and a counter measure
• scientific article
• Optimal counterfeiting attacks and generalizations for Wiesner's quantum money
• Quantum-Secure Coin-Flipping and Applications
• Cheat-sensitive coin flipping and quantum gambling
• The impossibility of efficient Quantum weak coin flipping
• Quantum weak coin flipping
• Quantum money with mintage supervision

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5899240 (Why is no real title available?)
• scientific article; zbMATH DE number 5485488 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Classical and Quantum Algorithms for Exponential Congruences
• Coin-Weighing Problems
• Counterfeit Coin Problems
• Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
• On the power of Ambainis lower bounds
• Polynomial degree vs. quantum query complexity
• Quantum Algorithms for the Triangle Problem
• Quantum Complexity Theory
• Quantum Query Complexity of State Conversion
• Quantum lower bounds by quantum arguments
• Reflections for quantum query algorithms
• Searching for two counterfeit coins with two-arms balance
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
• The general counterfeit coin problem

Cited in

(6)

• Quantum algorithm for learning secret strings and its experimental demonstration
• Quantum counterfeit coin problems
• Quantum algorithms for learning hidden strings with applications to matroid problems
• scientific article; zbMATH DE number 5901453 (Why is no real title available?)
• RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
• Quantum algorithms for learning symmetric juntas via the adversary bound

This page was built for publication: Quantum counterfeit coin problems

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