The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Quantum Strategies
Open accessAbstract
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). While not every two-person zero-sum finite game has an equilibrium in the set of pure strategies, von Neumann showed that there is always an equilibrium at which each player follows a mixed strategy. A mixed strategy deviating from the equilibrium strategy cannot increase a player's expected payoff. We show by example, however, that a player who implements a quantum strategy can increase his expected payoff, and explain the relation to efficient quantum algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Equilibrium points in n -person games
Nash, J. F. (1950) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.36.1.48 · Cited by 7,560
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Theory of Games and Economic Behavior
ROWLAND, E. (1946) · Nature · doi:10.1038/157172a0 · Cited by 3,280
Mathematical foundations of quantum mechanics
Offenbacher, E. L. (1955) · Journal of the Franklin Institute · doi:10.1016/0016-0032(55)90752-3 · Cited by 2,930
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Zur Theorie der Gesellschaftsspiele
v. Neumann, J. (1928) · Mathematische Annalen · doi:10.1007/bf01448847 · Cited by 2,572
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Measurement of Conditional Phase Shifts for Quantum Logic
Turchette, Q. A., Hood, C. J., Lange, W., Mabuchi, H., & Kimble, H. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4710 · Cited by 1,409
Schumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090
Experimental Quantum Error Correction
Cory, D. G., Price, M. D., Maas, W., Knill, E., Laflamme, R., Zurek, W. H., Havel, T. F., & Somaroo, S. S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.2152 · Cited by 581
Principles of Quantum Mechanics
Basdevant, J.-L. (2016) · Graduate Texts in Physics · doi:10.1007/978-3-319-43479-7_6 · Cited by 434
Substituting quantum entanglement for communication
Cleve, R., & Buhrman, H. (1997) · Physical Review A · doi:10.1103/physreva.56.1201 · Cited by 416
11 Mathematische Grundlagen der Quantenmechanik
(2012) · Quantenmechanik 1 · doi:10.1524/9783486717365.213 · Cited by 335
Bulk quantum computation with nuclear magnetic resonance: theory and experiment
Chuang, I. L., Gershenfeld, N., Kubinec, M. G., & Leung, D. W. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0170 · Cited by 316
Cited by
New Paradoxical Games Based on Brownian Ratchets
Parrondo, J. M. R., Harmer, G. P., & Abbott, D. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5226 · Cited by 261
Does quantum mechanics play a non-trivial role in life?
Davies, P. C. W. (2004) · Biosystems · doi:10.1016/j.biosystems.2004.07.001 · Cited by 187
A survey of the current status of research on quantum games
Huang, D., & Li, S. (2018) · 2018 4th International Conference on Information Management (ICIM) · doi:10.1109/infoman.2018.8392807 · Cited by 8
Metadata
- Authors
- Meyer, D. A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1999-02-01
- Volume
- 82
- Issue
- 5
- Pages
- 1052-1055
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W3038125555
- Cited by
- 773
- References
- 19
- FWCI
- 21.16
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.