pith. sign in

arxiv: 2605.30676 · v1 · pith:H6TTLUJ3new · submitted 2026-05-29 · 🪐 quant-ph

Experimental Implementation of the Quantum Volunteer's Dilemma on NISQ Hardware: Noise Analysis and Digital-Twin Validation

Pith reviewed 2026-06-28 22:28 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum volunteer's dilemmaNISQ hardwarequantum gamesreadout error correctiondigital twinmultiplayer quantum games
0
0 comments X

The pith

Readout-corrected quantum volunteer's dilemma on NISQ hardware matches theory up to six players and exceeds classical equilibrium to nine.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper implements the multiplayer quantum volunteer's dilemma on actual NISQ hardware for player counts from 2 to 9. After applying mthree readout error correction the measured global average payoffs match the ideal quantum predictions exactly for N up to 6 and remain above the classical Nash equilibrium for the entire range. The work also tests four transpiler optimization levels, identifies level 2 as the most stable, and compares hardware results to a calibration-based digital twin model. These outcomes indicate that the collective quantum advantage in this game survives current hardware noise levels.

Core claim

With readout correction, the global average payoff reproduces the quantum theoretical benchmark exactly for N <= 6 and exceeds the classical Nash equilibrium across the full tested range of N = 2 to 9.

What carries the argument

The multiplayer quantum volunteer's dilemma implemented as quantum circuits on NISQ hardware, post-processed with mthree readout error correction.

If this is right

  • Aggregate quantum advantage in the game persists under NISQ noise for N up to 9 after correction.
  • State-level quantum advantage remains observable up to N=8 with post-processed readout correction.
  • Single-qubit errors dominate the Hamming distance at small N while multi-qubit errors grow beyond N=6.
  • The digital twin reproduces global trends but diverges from hardware fidelity decay at large N.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Readout correction may enable similar observation of quantum advantage in other multiplayer quantum games on present hardware.
  • Noise models that include correlated errors would be needed to predict the N at which advantage disappears.
  • Repeating the experiment on hardware with lower readout error rates could test whether exact matching extends past N=6.

Load-bearing premise

The mthree readout error correction accurately recovers the ideal quantum state probabilities without systematic bias that grows with N.

What would settle it

A measurement on the same backend showing that corrected payoffs for N=5 deviate from the quantum benchmark by more than statistical fluctuation would falsify the exact reproduction claim.

read the original abstract

We present an experimental implementation of the multiplayer Quantum Volunteer's Dilemma on noisy intermediate-scale quantum (NISQ) hardware, executed on the ibm_kingston backend via Qiskit Runtime. The game is evaluated for N = 2 to 9 players under four transpiler optimization levels, with 20 independent repetitions per configuration and 2048 shots per circuit, including post-processing readout error correction via mthree. Target-state fidelity decays with system size but remains above 70% (corrected) through N = 9. With readout correction, the global average payoff reproduces the quantum theoretical benchmark exactly for N <= 6 and exceeds the classical Nash equilibrium across the full tested range. Optimization level 2 is selected as the reference configuration after gate count analysis reveals that levels 2 and 3 produce identical transpiled circuits, with level 2 achieving superior fidelity stability. A Hamming distance analysis of raw measurement counts shows that single-qubit errors dominate at small N, with multi-qubit contributions growing beyond N = 6. A calibration-based digital twin captures global payoff trends but exhibits a linear fidelity decay profile that diverges from the hardware behavior at large N, exposing the limits of first-order independent per-qubit noise models. These results demonstrate that aggregate quantum advantage in multiplayer games is robust to NISQ noise conditions across the full tested range, while the practical observability of state-level advantage is constrained to N <= 8 under post-processed readout correction.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript reports an experimental implementation of the multiplayer Quantum Volunteer's Dilemma (N=2 to 9) on the ibm_kingston NISQ backend via Qiskit Runtime. Circuits are executed with 2048 shots, 20 repetitions, and four transpiler optimization levels, followed by mthree readout-error correction. Reported results include corrected target-state fidelity above 70% through N=9, exact reproduction of the ideal quantum theoretical benchmark in global average payoff for N≤6, and payoffs exceeding the classical Nash equilibrium for the full range. Optimization level 2 is selected after gate-count analysis; Hamming-distance analysis of raw counts shows single-qubit errors dominate at small N while multi-qubit contributions grow beyond N=6. A calibration-based digital twin reproduces payoff trends but diverges from hardware fidelity decay at large N.

Significance. If the central experimental claims hold after addressing validation gaps, the work supplies concrete NISQ data showing that aggregate quantum advantage in a multiplayer game remains observable after standard readout correction up to N=9, while the digital-twin mismatch usefully illustrates the breakdown of independent per-qubit noise models. The use of multiple optimization levels, repeated executions, Hamming-distance error decomposition, and explicit comparison to a calibration-derived simulator are positive elements that aid reproducibility and benchmarking of similar game-theoretic experiments on hardware.

major comments (2)
  1. [Abstract and readout-correction results] Abstract (payoff reproduction claim) and the section describing mthree application: the statement that corrected global average payoffs reproduce the quantum benchmark exactly for N≤6 is load-bearing for the primary result. This requires that the linear inversion performed by mthree fully removes bias even as multi-qubit error contributions increase (explicitly noted in the Hamming-distance analysis beyond N=6). No comparison is shown between mthree-corrected hardware probabilities and the same observable evaluated on a noisy simulator seeded with the identical per-qubit calibration matrix; without this check the exact match could reflect over-correction rather than faithful state recovery.
  2. [Digital-twin validation] Digital-twin section: the manuscript states that the calibration-based digital twin captures global payoff trends yet exhibits a linear fidelity decay that diverges from hardware at large N. The discrepancy is presented qualitatively; a quantitative metric (e.g., RMS difference in fidelity vs N or per-N fidelity values for both hardware and twin) would be needed to assess how severely the first-order independent-error model fails and whether this affects the interpretation of the N≤6 exact-match result.
minor comments (2)
  1. [Abstract] Abstract: the phrase 'target-state fidelity' should be defined (state-vector fidelity, measurement fidelity, or process fidelity) and the computation method stated explicitly.
  2. [Methods] Methods or results: the precise definition of 'global average payoff' (how measurement counts are mapped to payoffs after correction) and any error-bar calculation should be given in a dedicated equation or paragraph.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed report. The comments highlight important validation aspects that we can strengthen. We respond to each major comment below and will incorporate the suggested additions in a revised manuscript.

read point-by-point responses
  1. Referee: [Abstract and readout-correction results] Abstract (payoff reproduction claim) and the section describing mthree application: the statement that corrected global average payoffs reproduce the quantum theoretical benchmark exactly for N≤6 is load-bearing for the primary result. This requires that the linear inversion performed by mthree fully removes bias even as multi-qubit error contributions increase (explicitly noted in the Hamming-distance analysis beyond N=6). No comparison is shown between mthree-corrected hardware probabilities and the same observable evaluated on a noisy simulator seeded with the identical per-qubit calibration matrix; without this check the exact match could reflect over-correction rather than faithful state recovery.

    Authors: We agree that an explicit comparison of mthree-corrected hardware probabilities against a noisy simulator using the identical per-qubit calibration matrix would provide stronger evidence against over-correction. Our Hamming-distance decomposition already shows single-qubit errors dominate for N≤6 (where the exact payoff match occurs), consistent with mthree's design assumptions. Nevertheless, to directly address the concern we will add this simulator comparison in the revision, evaluating both the corrected probability distributions and the resulting global average payoffs. This will confirm that the N≤6 reproduction reflects faithful recovery rather than artifactual cancellation. revision: yes

  2. Referee: [Digital-twin validation] Digital-twin section: the manuscript states that the calibration-based digital twin captures global payoff trends yet exhibits a linear fidelity decay that diverges from hardware at large N. The discrepancy is presented qualitatively; a quantitative metric (e.g., RMS difference in fidelity vs N or per-N fidelity values for both hardware and twin) would be needed to assess how severely the first-order independent-error model fails and whether this affects the interpretation of the N≤6 exact-match result.

    Authors: We accept that the digital-twin discrepancy is currently described only qualitatively. In the revised manuscript we will add a table listing per-N fidelity values for both hardware and the calibration-based digital twin, together with the RMS difference in fidelity as a function of N. These quantitative measures will make explicit the point at which the independent per-qubit noise model breaks down and will show that the breakdown occurs after N=6, thereby supporting rather than undermining the exact-match claim for N≤6. revision: yes

Circularity Check

0 steps flagged

No circularity: experimental benchmarks against independent theoretical predictions

full rationale

The manuscript is an experimental implementation study that executes circuits on ibm_kingston hardware, applies standard mthree readout correction, and reports observed global average payoffs. These are compared to the pre-existing quantum theoretical benchmark (from quantum game theory) and the classical Nash equilibrium, both of which are external to the present data set. No equations define a quantity in terms of itself, no parameters are fitted to a subset of the reported payoffs and then relabeled as predictions, and no load-bearing premise rests on a self-citation chain. The digital-twin comparison and Hamming-distance noise analysis are observational diagnostics, not derivations that reduce to the same inputs by construction. The work is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The central claims rest on standard assumptions of quantum game theory and NISQ noise models rather than new postulates; no free parameters or invented entities are introduced in the reported results.

pith-pipeline@v0.9.1-grok · 5846 in / 1105 out tokens · 19597 ms · 2026-06-28T22:28:42.896260+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Entanglement in the Quantum Volunteer's Dilemma

    quant-ph 2026-06 unverdicted novelty 6.0

    Generalized quantum Volunteer's Dilemma with tunable entanglement γ yields analytic thresholds for symmetric Nash equilibria depending on γ and n.

Reference graph

Works this paper leans on

83 extracted references · 61 canonical work pages · cited by 1 Pith paper · 3 internal anchors

  1. [1]

    Journal of Conflict Resolution29(4), 605– 610 (1985) https://doi.org/10.1177/0022002785029004003

    Diekmann, A.: Volunteer’s dilemma. Journal of Conflict Resolution29(4), 605– 610 (1985) https://doi.org/10.1177/0022002785029004003

  2. [2]

    A Social Trap without a Dominant Strategy and some Empirical Results, pp

    Diekmann, A.: Volunteer’s Dilemma. A Social Trap without a Dominant Strategy and some Empirical Results, pp. 187–197. Physica-Verlag HD, Heidelberg (1986). https://doi.org/10.1007/978-3-642-95874-8_13

  3. [3]

    Journal of Economic Behavior & Organization186, 646–661 (2021) https://doi

    Campos-Mercade, P.: The volunteer’s dilemma explains the bystander effect. Journal of Economic Behavior & Organization186, 646–661 (2021) https://doi. org/10.1016/j.jebo.2020.11.012

  4. [4]

    Journal of Conflict Resolution52(6), 961–984 (2008) https://doi.org/10.1177/0022002708321401

    Otsubo, H., Rapoport, A.: Dynamic volunteer’s dilemmas over a finite horizon: An experimental study. Journal of Conflict Resolution52(6), 961–984 (2008) https://doi.org/10.1177/0022002708321401

  5. [5]

    Games and Economic Behavior102, 303–315 (2017) https: //doi.org/10.1016/j.geb.2017.01.002

    Goeree, J.K., Holt, C.A., Smith, A.M.: An experimental examination of the vol- unteer’s dilemma. Games and Economic Behavior102, 303–315 (2017) https: //doi.org/10.1016/j.geb.2017.01.002

  6. [6]

    Physical Review Letters82(5), 1052–1055 (1999) https://doi.org/10.1103/PhysRevLett.82.1052

    Meyer, D.A.: Quantum strategies. Physical Review Letters82(5), 1052–1055 (1999) https://doi.org/10.1103/PhysRevLett.82.1052

  7. [7]

    Physical Review Letters83(15), 3077–3080 (1999) https://doi.org/10.1103/ PhysRevLett.83.3077

    Eisert, J., Wilkens, M., Lewenstein, M.: Quantum games and quantum strate- gies. Physical Review Letters83(15), 3077–3080 (1999) https://doi.org/10.1103/ PhysRevLett.83.3077

  8. [8]

    Quantum Information Processing 17(11), 309 (2018) https://doi.org/10.1007/s11128-018-2082-8

    Khan, F.S., Solmeyer, N., Balu, R., Humble, T.S.: Quantum games: a review of the history, current state, and interpretation. Quantum Information Processing 17(11), 309 (2018) https://doi.org/10.1007/s11128-018-2082-8

  9. [9]

    Journal of Modern Optics47(14-15), 2543–2556 (2000) https://doi.org/10.1080/09500340008232180 23

    Eisert, J., Wilkens, M.: Quantum games. Journal of Modern Optics47(14-15), 2543–2556 (2000) https://doi.org/10.1080/09500340008232180 23

  10. [10]

    Nash Equilibrium in the Quantum Battle of Sexes Game

    Du, J., Xu, X., Li, H., Zhou, X., Han, R.: Nash equilibrium in the quantum battle of sexes game. arXiv preprint quant-ph/0010050 (2000) https://doi.org/ 10.48550/arXiv.quant-ph/0010050

  11. [11]

    Fluctuation and Noise Letters2(04), 189–203 (2002) https: //doi.org/10.1142/S0219477502000993

    Du, J., Xu, X., Li, H., Zhou, X., Han, R.: Playing prisoner’s dilemma with quantum rules. Fluctuation and Noise Letters2(04), 189–203 (2002) https: //doi.org/10.1142/S0219477502000993

  12. [12]

    Physica A: Statistical Mechanics and its Applications312(1), 208–216 (2002) https://doi.org/10.1016/ S0378-4371(02)00842-7

    Piotrowski, E.W., Sładkowski, J.: Quantum market games. Physica A: Statistical Mechanics and its Applications312(1), 208–216 (2002) https://doi.org/10.1016/ S0378-4371(02)00842-7

  13. [13]

    Quantum Information Processing18(1), 10 (2018) https://doi.org/ 10.1007/s11128-018-2113-5

    Maioli,A.C.,Passos,M.H.M.,Balthazar,W.F.,Souza,C.E.R.,Huguenin,J.A.O., Schmidt, A.G.M.: Quantization and experimental realization of the Colonel Blotto game. Quantum Information Processing18(1), 10 (2018) https://doi.org/ 10.1007/s11128-018-2113-5

  14. [14]

    Entropy23(5), 506 (2021) https://doi.org/10.3390/e23050506

    Szopa, M.: Efficiency of classical and quantum games equilibria. Entropy23(5), 506 (2021) https://doi.org/10.3390/e23050506

  15. [15]

    Games14(6) (2023) https://doi.org/10.3390/g14060072

    Kastampolidou, K., Andronikos, T.: Quantum tapsilou—a quantum game inspired by the traditional greek coin tossing game tapsilou. Games14(6) (2023) https://doi.org/10.3390/g14060072

  16. [16]

    Quantum Information Processing23(3), 75 (2024) https://doi.org/10.1007/s11128-024-04283-3

    Frąckiewicz, P., Szopa, M.: Permissible extensions of classical to quantum games combining three strategies. Quantum Information Processing23(3), 75 (2024) https://doi.org/10.1007/s11128-024-04283-3

  17. [17]

    Future Internet17(9) (2025) https://doi.org/10.3390/fi17090408

    Andronikos, T., Bitsakos, C., Nikas, K., Goumas, G.I., Koziris, N.: A GHZ-based protocol for the dining information brokers problem. Future Internet17(9) (2025) https://doi.org/10.3390/fi17090408

  18. [18]

    Theory of electron spin resonance in scanning tunneling mi- croscopy

    Koh, D.E., Kumar, K., Goh, S.T.: Quantum volunteer’s dilemma. Physical Review Research7(1), 013104 (2025) https://doi.org/10.1103/PhysRevResearch. 7.013104

  19. [19]

    Quantum Economics and Finance2(1), 40–51 (2025) https://doi.org/10.1177/29767032251333418

    Khan, F.S., Linke, N.M., Than, A.T., Baron, D.: Quantum advantage in trading: A game-theoretic approach. Quantum Economics and Finance2(1), 40–51 (2025) https://doi.org/10.1177/29767032251333418

  20. [20]

    Quantum Information Processing24(7), 201 (2025) https://doi.org/10.1007/s11128-025-04808-4

    Frąckiewicz, P., Gorczyca-Goraj, A., Szopa, M.: Permissible four-strategy quan- tum extensions of classical games. Quantum Information Processing24(7), 201 (2025) https://doi.org/10.1007/s11128-025-04808-4

  21. [21]

    Quantum Information Processing24(5), 152 (2025) https://doi.org/10

    Tiago,G.,Naskar,J.,Maioli,A.C.,Balthazar,W.F.,Schmidt,A.G.M.,Huguenin, J.A.O.: Classical and quantum multiplayer Colonel Blotto game in all-optical setup. Quantum Information Processing24(5), 152 (2025) https://doi.org/10. 24 1007/s11128-025-04760-3

  22. [22]

    arXiv preprint arXiv:2511.15802 (2025) https://doi.org/10

    Weeks, C., Strange, P., Drmota, P., Quintanilla, J.: Quantum-assisted graph domination games. arXiv preprint arXiv:2511.15802 (2025) https://doi.org/10. 48550/arXiv.2511.15802

  23. [23]

    The European Physical Journal Plus141(4), 456 (2026) https://doi

    Makram-Allah, A.T.M., Abd-Rabbou, M.Y., Metwally, N.: The possibility of fairly mitigating penalties in the quantum prisoner’s dilemma via classical noise channels. The European Physical Journal Plus141(4), 456 (2026) https://doi. org/10.1140/epjp/s13360-026-07650-4

  24. [24]

    Native quantum games from interacting discrete-time quantum walks

    Ahmad, R.: Native quantum games from interacting discrete-time quantum walks. arXiv preprint arXiv:2604.20455 (2026) https://doi.org/10.48550/arXiv. 2604.20455

  25. [25]

    arXiv preprint arXiv:2602.03571 (2026) https://doi.org/10.48550/arXiv.2602.03571

    Essalmi, K., Garrido, F., Nashashibi, F.: Multi-player, multi-strategy quantum game model for interaction-aware decision-making in autonomous driving. arXiv preprint arXiv:2602.03571 (2026) https://doi.org/10.48550/arXiv.2602.03571

  26. [26]

    Benjamin, S.C., Hayden, P.M.: Multiplayer quantum games. Phys. Rev. A64, 030301 (2001) https://doi.org/10.1103/PhysRevA.64.030301

  27. [27]

    Chinese Physics Letters19(9), 1221 (2002) https://doi.org/10.1088/0256-307X/19/9/301

    Jiang-Feng, D., Hui, L., Xiao-Dong, X., Xian-Yi, Z., Rong-Dian, H.: Multi-player and multi-choice quantum game. Chinese Physics Letters19(9), 1221 (2002) https://doi.org/10.1088/0256-307X/19/9/301

  28. [28]

    Physics Letters A306(2-3), 73–78 (2002) https://doi.org/10.1016/S0375-9601(02)01628-6

    Li, H., Du, J., Massar, S.: Continuous-variable quantum games. Physics Letters A306(2-3), 73–78 (2002) https://doi.org/10.1016/S0375-9601(02)01628-6

  29. [29]

    Quantum Information Processing20(12), 387 (2021) https://doi.org/10.1007/ s11128-021-03295-7

    Ikeda, K., Aoki, S.: Infinitely repeated quantum games and strategic efficiency. Quantum Information Processing20(12), 387 (2021) https://doi.org/10.1007/ s11128-021-03295-7

  30. [30]

    Physics Letters A289(1-2), 9–15 (2001) https://doi.org/ 10.1016/S0375-9601(01)00575-8

    Du, J., Xu, X., Li, H., Zhou, X., Han, R.: Entanglement playing a dominating role in quantum games. Physics Letters A289(1-2), 9–15 (2001) https://doi.org/ 10.1016/S0375-9601(01)00575-8

  31. [31]

    Physics Letters A302(5), 229–233 (2002) https://doi.org/10

    Du, J., Li, H., Xu, X., Zhou, X., Han, R.: Entanglement enhanced multiplayer quantum games. Physics Letters A302(5), 229–233 (2002) https://doi.org/10. 1016/S0375-9601(02)01144-1

  32. [32]

    Scientific reports4(1), 6286 (2014) https: //doi.org/10.1038/srep06286

    Li, A., Yong, X.: Entanglement guarantees emergence of cooperation in quantum prisoner’s dilemma games on networks. Scientific reports4(1), 6286 (2014) https: //doi.org/10.1038/srep06286

  33. [33]

    Information and Computation256, 174–184 (2017) https://doi.org/10.1016/j.ic

    Wei, Z., Zhang, S.: Quantum game players can have advantage without discord. Information and Computation256, 174–184 (2017) https://doi.org/10.1016/j.ic. 2017.07.004 25

  34. [34]

    In: International Conference on Intelligent Information Technologies for Industry, pp

    Mohamed, N.M.A.A., Taisheng, H., Jinhui, P.: Quantum game theory on entan- gled players. In: International Conference on Intelligent Information Technologies for Industry, pp. 291–301 (2023). https://doi.org/10.1007/978-3-031-43789-2_27 . Springer

  35. [35]

    Johnson,N.F.:Playingaquantumgamewithacorruptedsource.PhysicalReview A63(2), 020302 (2001) https://doi.org/10.1103/PhysRevA.63.020302

  36. [36]

    Physics Letters A316(5), 317–323 (2003) https://doi.org/ 10.1016/S0375-9601(03)01175-7

    Chen,L.K.,Ang,H.,Kiang,D.,Kwek,L.C.,Lo,C.F.:Quantumprisonerdilemma under decoherence. Physics Letters A316(5), 317–323 (2003) https://doi.org/ 10.1016/S0375-9601(03)01175-7

  37. [37]

    Journal of Physics A: Mathematical and General38(2), 449 (2004) https://doi.org/10.1088/ 0305-4470/38/2/011

    Flitney, A.P., Abbott, D.: Quantum games with decoherence. Journal of Physics A: Mathematical and General38(2), 449 (2004) https://doi.org/10.1088/ 0305-4470/38/2/011

  38. [38]

    Chinese Physics16(4), 915–918 (2007) https://doi.org/10.1088/ 1009-1963/16/4/008

    Shuai, C., Mao-Fa, F., Xiao-Juan, Z.: The effect of quantum noise on multiplayer quantum game. Chinese Physics16(4), 915–918 (2007) https://doi.org/10.1088/ 1009-1963/16/4/008

  39. [39]

    International Journal of Theoretical Physics55, 965–992 (2016) https://doi.org/10.1007/ s10773-015-2741-9

    Huang, Z., Qiu, D.: Quantum games under decoherence. International Journal of Theoretical Physics55, 965–992 (2016) https://doi.org/10.1007/ s10773-015-2741-9

  40. [40]

    Reports on Mathematical Physics 81(3), 399–413 (2018) https://doi.org/10.1016/S0034-4877(18)30056-9

    Khan, S., Alam, S.: The dynamics of Nash equilibrium under non-Markovian classical noise in quantum prisoners’ dilemma. Reports on Mathematical Physics 81(3), 399–413 (2018) https://doi.org/10.1016/S0034-4877(18)30056-9

  41. [41]

    Quantum information processing 19, 1–18 (2020) https://doi.org/10.1007/s11128-020-02830-2

    Kairon, P., Thapliyal, K., Srikanth, R., Pathak, A.: Noisy three-player dilemma game: robustness of the quantum advantage. Quantum information processing 19, 1–18 (2020) https://doi.org/10.1007/s11128-020-02830-2

  42. [42]

    Entropy25(8), 1222 (2023) https://doi.org/10.3390/e25081222

    Legón, A.R., Medina, E.: Joint probabilities approach to quantum games with noise. Entropy25(8), 1222 (2023) https://doi.org/10.3390/e25081222

  43. [43]

    Physics Letters A330(1-2), 48–53 (2004) https://doi.org/10

    Lu, J., Zhou, L., Kuang, L.-M.: Linear optics implementation for quantum game with two players. Physics Letters A330(1-2), 48–53 (2004) https://doi.org/10. 1016/j.physleta.2004.07.063

  44. [44]

    Physics Letters A358(2), 100–104 (2006) https://doi.org/10.1016/j.physleta.2006.04

    Buluta, I.M., Fujiwara, S., Hasegawa, S.: Quantum games in ion traps. Physics Letters A358(2), 100–104 (2006) https://doi.org/10.1016/j.physleta.2006.04. 114

  45. [45]

    Journal of Magnetic Resonance187(2), 306–313 (2007) https://doi.org/10.1016/j.jmr.2007.05.013 26

    Mitra, A., Sivapriya, K., Kumar, A.: Experimental implementation of a three qubit quantum game with corrupt source using nuclear magnetic resonance quan- tum information processor. Journal of Magnetic Resonance187(2), 306–313 (2007) https://doi.org/10.1016/j.jmr.2007.05.013 26

  46. [46]

    New Journal of Physics12(6), 063031 (2010) https://doi.org/10.1088/1367-2630/12/ 6/063031

    Schmid, C., Flitney, A.P., Wieczorek, W., Kiesel, N., Weinfurter, H., Hollen- berg, L.C.: Experimental implementation of a four-player quantum game. New Journal of Physics12(6), 063031 (2010) https://doi.org/10.1088/1367-2630/12/ 6/063031

  47. [47]

    In: 2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE), pp

    Xu, K., Wu, Z.: Experimental implementation of quantum prisoner dilemma on IBM quantum computers. In: 2022 15th International Conference on Advanced Computer Theory and Engineering (ICACTE), pp. 13–18 (2022). https://doi. org/10.1109/ICACTE55855.2022.9943732 . IEEE

  48. [48]

    In: 2025 IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON), pp

    Díaz Agreda, G., Durán Paredes, C.A., Buenaventura Samboni, M., Andrade, J.A., Cajas Ordoñez, S.: Bridging theory and practice in quantum game theory: Optimized implementation of the battle of the sexes with error mitigation on NISQ hardware. In: 2025 IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologie...

  49. [49]

    Jour- nal of Conflict Resolution42(5), 600–618 (1998) https://doi.org/10.1177/ 0022002798042005004

    Weesie, J., Franzen, A.: Cost sharing in a volunteer’s dilemma. Jour- nal of Conflict Resolution42(5), 600–618 (1998) https://doi.org/10.1177/ 0022002798042005004

  50. [50]

    Quantum computing in the nisq era and beyond.Quantum2, 79 (2018)

    Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum2, 79 (2018) https://doi.org/10.22331/q-2018-08-06-79

  51. [51]

    Frontiers of Physics18(2), 21308 (2023) https://doi.org/10.1007/ s11467-022-1249-z

    Cheng, B., Deng, X.-H., Gu, X., He, Y., Hu, G., Huang, P., Li, J., Lin, B.-C., Lu, D., Lu, Y., Qiu, C., Wang, H., Xin, T., Yu, S., Yung, M.-H., Zeng, J., Zhang, S., Zhong, Y., Peng, X., Nori, F., Yu, D.: Noisy intermediate-scale quantum computers. Frontiers of Physics18(2), 21308 (2023) https://doi.org/10.1007/ s11467-022-1249-z

  52. [52]

    Nielsen and Isaac L

    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge (2010). https: //doi.org/10.1017/CBO9780511976667

  53. [53]

    Building logical qubits in a superconducting quantum computing system,

    Gambetta, J.M., Chow, J.M., Steffen, M.: Building logical qubits in a supercon- ducting quantum computing system. npj Quantum Information3(1), 2 (2017) https://doi.org/10.1038/s41534-016-0004-0

  54. [54]

    In: Proceedings of the 25th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS ’20), pp

    Murali, P., McKay, D.C., Martonosi, M., Javadi-Abhari, A.: Software mitigation of crosstalk on noisy intermediate-scale quantum computers. In: Proceedings of the 25th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS ’20), pp. 1001–1016. ACM, New York (2020). https://doi.org/10.1145/3373376.3378477

  55. [55]

    Detecting crosstalk errors in quantum information processors

    Sarovar, M., Proctor, T., Rudinger, K., Young, K., Nielsen, E., Blume-Kohout, R.: Detecting crosstalk errors in quantum information processors. Quantum4, 321 (2020) https://doi.org/10.22331/q-2020-09-11-321 27

  56. [56]

    https://quantum

    IBM Quantum: QiskitRuntimeService API reference. https://quantum. cloud.ibm.com/docs/en/api/qiskit-ibm-runtime/qiskit_ibm_runtime. QiskitRuntimeService. Accessed: 2026-04-27 (n.d.)

  57. [57]

    PRX Quantum2(4), 040326 (2021) https://doi.org/10.1103/PRXQuantum.2.040326

    Nation, P.D., Kang, H., Sundaresan, N., Gambetta, J.M.: Scalable mitigation of measurement errors on quantum computers. PRX Quantum2(4), 040326 (2021) https://doi.org/10.1103/PRXQuantum.2.040326

  58. [58]

    Accessed: Apr

    Qiskit Contributors: mthree: Matrix-free Measurement Mitigation. Accessed: Apr. 2026 (2024). https://qiskit.github.io/qiskit-addon-mthree/

  59. [59]

    https: //quantum.cloud.ibm.com/docs/en/api/qiskit/qiskit.transpiler.generate_ preset_pass_manager

    IBM Quantum: qiskit.transpiler.generate_preset_pass_manager. https: //quantum.cloud.ibm.com/docs/en/api/qiskit/qiskit.transpiler.generate_ preset_pass_manager. Accessed: 2026-04-27 (n.d.)

  60. [60]

    https://quantum.cloud.ibm.com/docs/en/guides/simulate-with-qiskit-aer

    IBM Quantum: Exact and noisy simulation with Qiskit Aer primi- tives. https://quantum.cloud.ibm.com/docs/en/guides/simulate-with-qiskit-aer. Accessed: 2026-04-27 (n.d.)

  61. [61]

    Cai, Z., Babbush, R., Benjamin, S.C., Endo, S., Huggins, W.J., Li, Y., McClean, J.R., O’Brien, T.E.: Quantum error mitigation. Rev. Mod. Phys.95, 045005 (2023) https://doi.org/10.1103/RevModPhys.95.045005

  62. [62]

    Temme, K., Bravyi, S., Gambetta, J.M.: Error mitigation for short-depth quan- tum circuits. Phys. Rev. Lett.119, 180509 (2017) https://doi.org/10.1103/ PhysRevLett.119.180509

  63. [63]

    Li, Y., Benjamin, S.C.: Efficient variational quantum simulator incorporating active error minimization. Phys. Rev. X7, 021050 (2017) https://doi.org/10. 1103/PhysRevX.7.021050

  64. [64]

    Giurgica-Tiron, Y

    Giurgica-Tiron, T., Hindy, Y., LaRose, R., Mari, A., Zeng, W.J.: Digital zero noise extrapolation for quantum error mitigation. In: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 306–316 (2020). https://doi.org/10.1109/QCE49297.2020.00045

  65. [65]

    Endo, S., Benjamin, S.C., Li, Y.: Practical quantum error mitigation for near- future applications. Phys. Rev. X8, 031027 (2018) https://doi.org/10.1103/ PhysRevX.8.031027

  66. [66]

    International Journal of Game Theory22(1), 75–85 (1993) https://doi.org/10.1007/BF01245571

    Diekmann, A.: Cooperation in an asymmetric volunteer’s dilemma game theory and experimental evidence. International Journal of Game Theory22(1), 75–85 (1993) https://doi.org/10.1007/BF01245571

  67. [67]

    Journal of conflict resolution37(3), 569–590 (1993) https://doi.org/10.1177/0022002793037003008 28

    Weesie, J.: Asymmetry and timing in the volunteer’s dilemma. Journal of conflict resolution37(3), 569–590 (1993) https://doi.org/10.1177/0022002793037003008 28

  68. [68]

    pone.0271685

    He, J.-Z., Wang, R.-W., Li, Y.-T.: Evolutionary stability in the asymmetric vol- unteer’s dilemma. PloS one9(8), 103931 (2014) https://doi.org/10.1371/journal. pone.0103931

  69. [69]

    Social Choice and Welfare51(3), 465–491 (2018) https://doi.org/10.1007/s00355-018-1124-6

    Healy, A.J., Pate, J.G.: Cost asymmetry and incomplete information in a vol- unteer’s dilemma experiment. Social Choice and Welfare51(3), 465–491 (2018) https://doi.org/10.1007/s00355-018-1124-6

  70. [70]

    Chaos, Solitons & Fractals166, 112928 (2023) https://doi.org/10.1016/j.chaos

    Guo, Z.-X., He, J.-Z., Li, Q.-M., Shi, L., Wang, R.-W.: Asymmetric interac- tion and diverse forms in public goods production in volunteer dilemma game. Chaos, Solitons & Fractals166, 112928 (2023) https://doi.org/10.1016/j.chaos. 2022.112928

  71. [71]

    Journal of theoretical biology335, 13–21 (2013) https://doi.org/10.1016/j.jtbi.2013.06.014

    Chen, X., Gross, T., Dieckmann, U.: Shared rewarding overcomes defection traps in generalized volunteer’s dilemmas. Journal of theoretical biology335, 13–21 (2013) https://doi.org/10.1016/j.jtbi.2013.06.014

  72. [72]

    Economic Inquiry61(1), 138–161 (2023) https: //doi.org/10.1111/ecin.13117

    Mago, S.D., Pate, J.: Greed and fear: Competitive and charitable priming in a threshold volunteer’s dilemma. Economic Inquiry61(1), 138–161 (2023) https: //doi.org/10.1111/ecin.13117

  73. [73]

    Available at SSRN 6765666 (2026) https://doi.org/10.2139/ssrn.6765666

    O’Riordan, C.: The k-threshold volunteer’s dilemma on networks. Available at SSRN 6765666 (2026) https://doi.org/10.2139/ssrn.6765666

  74. [74]

    Journal of Conflict Resolution38(3), 557–585 (1994) https://doi.org/10.1177/0022002794038003008

    Weesie, J.: Incomplete information and timing in the volunteer’s dilemma: A comparison of four models. Journal of Conflict Resolution38(3), 557–585 (1994) https://doi.org/10.1177/0022002794038003008

  75. [75]

    Social Science Research93, 102488 (2021) https://doi.org/10.1016/j.ssresearch.2020.102488

    Przepiorka, W., Bouman, L., de Kwaadsteniet, E.W.: The emergence of conven- tions in the repeated volunteer’s dilemma: The role of social value orientation, payoff asymmetries and focal points. Social Science Research93, 102488 (2021) https://doi.org/10.1016/j.ssresearch.2020.102488

  76. [76]

    Games and Economic Behavior142, 812–832 (2023) https: //doi.org/10.1016/j.geb.2023.10.008

    Kloosterman, A., Mago, S.: The infinitely repeated volunteer’s dilemma: An experimental study. Games and Economic Behavior142, 812–832 (2023) https: //doi.org/10.1016/j.geb.2023.10.008

  77. [77]

    Available at SSRN 5634211 (2026) https://doi.org/10

    Amir, R., Liu, H., Mayskaya, T., Tian, J.: On the repeated volunteer’s dilemma with equal cost sharing. Available at SSRN 5634211 (2026) https://doi.org/10. 2139/ssrn.5634211

  78. [78]

    Physica A: Statistical Mechanics and its Applications637, 129613 (2024) https://doi.org/10.1016/j.physa.2024.129613

    Mukhopadhyay, A., Sur, S., Saha, T., Sadhukhan, S., Chakraborty, S.: Repeated quantum game as a stochastic game: Effects of the shadow of the future and entanglement. Physica A: Statistical Mechanics and its Applications637, 129613 (2024) https://doi.org/10.1016/j.physa.2024.129613

  79. [79]

    29 Journal of Conflict Resolution70(6), 1095–1117 (2026) https://doi.org/10.1177/ 00220027251388601

    Amir, R., Machowska, D., Tian, J.: The volunteer’s dilemma with cost synergies. 29 Journal of Conflict Resolution70(6), 1095–1117 (2026) https://doi.org/10.1177/ 00220027251388601

  80. [80]

    Measuring error rates of mid-circuit measurements

    Hothem, D., Hines, J., Baldwin, C., Gresh, D., Blume-Kohout, R., Proctor, T.: Measuring error rates of mid-circuit measurements. Nature Communications 16(1), 5761 (2025) https://doi.org/10.1038/s41467-025-60923-x

Showing first 80 references.