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

arXiv:quant-ph/0110052

Formalization of the distinguishability heuristics

Kirkpatrick, K. A.

Published Oct 9, 2001• 0 citations
arXivHTMLPDF

Abstract

Withdrawn. Replaced by quant-ph/0308160 (cf accompanying txt file)
DOI
10.48550/arxiv.quant-ph/0110052

Related papers

A New Formulation of Grover's Algorithm

Michael Stay

Withdrawn; replaced by longer, more detailed paper quant-ph/0010065.

arXiv:quant-ph/0010028•Oct 6, 2000•0 citations

Graph identification by quantum walks

Jingbo B. Wang, B. L. Douglas

This paper has been withdrawn by the authors; replaced by arXiv:0705.2531v2 [quant-ph].

arXiv:quant-ph/0701033•Jan 8, 2007•1 citation

Formalizing Heuristics in Decision-Making: A Quantum Probability Perspective

Emmanuel M. Pothos, Jerome R. Busemeyer

Frontiers in Psychology•Jan 1, 2011•9 citations

Secure Ping-Pong quantum key distribution protocol with 33.3% bit error rate

Kai Wen, Long, Gui Lu

This paper has been withdrawn and replaced by quant-ph/0609207.

arXiv:quant-ph/0512092•Dec 12, 2005•0 citations

Stochastic Local Distinguishability

Somshubhro Bandyopadhyay, Anirban Roy, Jonathan Walgate

Bulletin of the American Physical Society•Mar 8, 2007•0 citations

A Constructive Approach to Strong Tractability Using Quasi-Monte Carlo Algorithms

Xiaoqun Wang

Journal of Complexity•Sep 1, 2002•43 citations