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

• URL: http://arxiv.org/abs/2605.30676v1
• Date: Fri, 29 May 2026 00:10:35 GMT
• Title: Experimental Implementation of the Quantum Volunteer's Dilemma on NISQ Hardware: Noise Analysis and Digital-Twin Validation
• Abstract summary: We present an experimental implementation of the multiplayer Quantum Volunteer's Dilemma on noisy quantum (NISQ) hardware.<n>The game is evaluated for N = 2 to 9 players under four transpiler optimization levels.<n>With readout correction, the global average payoff reproduces the quantum theoretical benchmark exactly for N = 6.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Recurrent Residual Quantization: A Progressive Multi-Precision Representation for LLMs [9.68624792431081]
  We introduce Recurrent Residual Quantization (RRQ), a post-training quantization framework.<n>RRQ represents weights as a low-bit quantized base together with a sequence of quantized residual corrections.<n>In our Qwen3-8B setup, the full all-RTN 2-/4-/6-/8-bit package is constructed in 1,293 seconds, 3.3 times faster than the measured MatGPTQ construction.
  arXiv  Detail & Related papers  (2026-08-04T08:32:05Z)
• Performance of Krotov, PRONTO and PINN for optimal control of quantum gates [0.0]
  We propose an enhanced PINN scheme for quantum optimal control (PINNQOC)<n>We benchmark our framework against two premier continuous control solvers.<n>Our advanced PINNQOC approach successfully suppresses population leakage while achieving gate fidelities exceeding 99.9$%$.
  arXiv  Detail & Related papers  (2026-07-25T16:21:48Z)
• An Empirical Study of OpenPangu Quantization on Ascend NPUs [43.29474342134475]
  OpenPangu models are attractive targets for private and domestic large-language-model deployment.<n>This paper conducts a controlled empirical study of OpenPangu 1B and 7B models on Huawei Ascend 910B1 NPUs.
  arXiv  Detail & Related papers  (2026-06-19T09:33:11Z)
• Comparing Classical and Quantum Variational Classifiers on the XOR Problem [0.0]
  Variational quantum models operate on qubits in high-dimensional Hilbert spaces.<n>We compare classical models and a variational quantum classifier on the XOR problem.
  arXiv  Detail & Related papers  (2026-02-27T17:46:52Z)
• Enhancing Kerr-Cat Qubit Coherence with Controlled Dissipation [64.05054054401175]
  Kerr-cat qubit (KCQ) is a bosonic quantum processor.<n>KCQs are experimentally compatible with on-chip architectures and high-fidelity operations.<n>We present direct evidence that the bit-flip time in a KCQ is limited by leakage out of the qubit manifold.
  arXiv  Detail & Related papers  (2025-11-02T17:58:36Z)
• Hardware-Efficient Rydberg Atomic Quantum Solvers for NP Problems [3.842223753702757]
  We construct a generic quantum solver for NP problems based on Grover's search algorithm, specifically tailored for Rydberg-atom quantum computing platforms.<n>We design the quantum oracles in the search algorithm using parallelizable single-qubit and multi-qubit entangling gates in the Rydberg atom system.<n>Our construction indicates that atomic qubits offer favorable circuit depth scaling compared to quantum processors with fixed local connectivity.
  arXiv  Detail & Related papers  (2025-07-30T13:48:57Z)
• Pushing the Limits of Low-Bit Optimizers: A Focus on EMA Dynamics [64.62231094774211]
  Statefuls (e.g., Adam) maintain auxiliary information even 2x the model size in order to achieve optimal convergence.<n>SOLO enables Adam-styles to maintain quantized states with precision as low as 3 bits, or even 2 bits.<n>SOLO can thus be seamlessly applied to Adam-styles, leading to substantial memory savings with minimal accuracy loss.
  arXiv  Detail & Related papers  (2025-05-01T06:47:45Z)
• Benchmarking the quality of multiplexed qubit readout beyond assignment fidelity [0.0]
  We use detector tomography to fully characterize multiqubit readout of superconducting transmon qubits.<n>The impact of different readout parameters on the rate of information extraction is studied.<n>We propose the rate of infidelity convergence as a validation tool for assignment fidelity.
  arXiv  Detail & Related papers  (2025-02-12T17:21:38Z)
• ParetoQ: Improving Scaling Laws in Extremely Low-bit LLM Quantization [73.60493264901359]
  We present a unified framework for rigorous comparisons across 1-bit, 1.58-bit, 2-bit, 3-bit, and 4-bit quantization settings.<n>We show that ternary, 2-bit, and 3-bit quantization maintains comparable performance in the size-accuracy trade-off.<n>Considering hardware constraints, 2-bit quantization offers promising potential for memory reduction and speedup.
  arXiv  Detail & Related papers  (2025-02-04T18:59:26Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Designing strong baselines for ternary neural network quantization through support and mass equalization [7.971065005161565]
  Deep neural networks (DNNs) offer the highest performance in a wide range of applications in computer vision. This computational burden can be dramatically reduced by quantizing floating point values to ternary values. We show experimentally that our approach allows to significantly improve the performance of ternary quantization through a variety of scenarios.
  arXiv  Detail & Related papers  (2023-06-30T07:35:07Z)
• Multistate Transition Dynamics by Strong Time-Dependent Perturbation in NISQ era [0.0]
  We develop a quantum computing scheme utilizing McLachlan variational principle in a hybrid quantum-classical algorithm. Results for transition probabilities are obtained with accuracy better than 1%, as established by comparison to the benchmark data.
  arXiv  Detail & Related papers  (2021-12-13T00:49:15Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.