Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Quantum Counterfeit Coin Problems

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama

Published Jan 1, 2010• 4 citations
Publisher
DOI
10.1007/978-3-642-17517-6_10

Related papers

Quantum counterfeit coin problems

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond +1 more

arXiv:1009.0416•Theoretical Computer Science•Jun 1, 2012•17 citations

On Anomaly Identification and the Counterfeit Coin Problem

Eldin Wee Chuan Lim

We address a well-known problem in combinatorics involving the identification of counterfeit coins with a systematic approach. The methodology can be applied to cases where the total number of coins is exceedingly large such that brute force or enumerative comparisons become impractical. Based on the principle behind this approach, the minimum effort necessary for identification of the counterfeit coin can be determined and expressed as a simple relation. We further suggest a possible application of this methodology to error detection in quantum information processing.

arXiv:0905.0085•May 1, 2009•2 citations

Practical aspects of quantum coin flipping

Anna Pappa, Paul Jouguet, Thomas Lawson +4 more

•Nov 1, 2012•0 citations

Quantum Coin

Andrejs Baidins

Science News•Sep 30, 1989•0 citations

Counterfeit Coin Problem Can be Extended to Secure Multiparty Computation

Shohei Kaneko, Yang Li, Kazuo Sakiyama +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Toward Secure Quantum Money

Bhaskar Roberts

•Aug 19, 2019•3 citations
We address a well-known problem in combinatorics involving the identification of counterfeit coins with a systematic approach. The methodology can be applied to cases where the total number of coins is exceedingly large such that brute force or enumerative comparisons become impractical. Based on the principle behind this approach, the minimum effort necessary for identification of the counterfeit coin can be determined and expressed as a simple relation. We further suggest a possible application of this methodology to error detection in quantum information processing.