Quantum counterfeit coin problems
From MaRDI portal
Publication:714865
DOI10.1016/J.TCS.2012.05.039zbMATH Open1253.68177OpenAlexW1902734015MaRDI QIDQ714865FDOQ714865
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
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
Analysis of algorithms and problem complexity (68Q25) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum Complexity Theory
- Quantum Algorithms for the Triangle Problem
- Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
- Title not available (Why is that?)
- Quantum Query Complexity of State Conversion
- Reflections for quantum query algorithms
- Polynomial degree vs. quantum query complexity
- Title not available (Why is that?)
- Quantum lower bounds by quantum arguments
- Title not available (Why is that?)
- On the power of Ambainis lower bounds
- Coin-Weighing Problems
- Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
- The general counterfeit coin problem
- Searching for two counterfeit coins with two-arms balance
- Counterfeit Coin Problems
- Classical and Quantum Algorithms for Exponential Congruences
Cited In (6)
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Quantum algorithm for learning secret strings and its experimental demonstration
- Quantum counterfeit coin problems
- Title not available (Why is that?)
- Quantum algorithms for learning hidden strings with applications to matroid problems
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
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)
