Impact of Error Rate Misreporting on Resource Allocation in Multi-tenant Quantum Computing and Defense

• URL: http://arxiv.org/abs/2504.04285v1
• Date: Sat, 05 Apr 2025 21:20:01 GMT
• Title: Impact of Error Rate Misreporting on Resource Allocation in Multi-tenant Quantum Computing and Defense
• Abstract summary: Cloud-based quantum service providers allow multiple users to run programs on shared hardware concurrently.<n>Error-prone qubits can degrade computational accuracy asymmetrically for users sharing the hardware.
• Score: 2.348041867134616
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Cloud-based quantum service providers allow multiple users to run programs on shared hardware concurrently to maximize resource utilization and minimize operational costs. This multi-tenant computing (MTC) model relies on the error parameters of the hardware for fair qubit allocation and scheduling, as error-prone qubits can degrade computational accuracy asymmetrically for users sharing the hardware. To maintain low error rates, quantum providers perform periodic hardware calibration, often relying on third-party calibration services. If an adversary within this calibration service misreports error rates, the allocator can be misled into making suboptimal decisions even when the physical hardware remains unchanged. We demonstrate such an attack model in which an adversary strategically misreports qubit error rates to reduce hardware throughput, and probability of successful trial (PST) for two previously proposed allocation frameworks, i.e. Greedy and Community-Based Dynamic Allocation Partitioning (COMDAP). Experimental results show that adversarial misreporting increases execution latency by 24% and reduces PST by 7.8%. We also propose to identify inconsistencies in reported error rates by analyzing statistical deviations in error rates across calibration cycles.

Related papers

• A Replicate-and-Quantize Strategy for Plug-and-Play Load Balancing of Sparse Mixture-of-Experts LLMs [64.8510381475827]
  Sparse Mixture-of-Experts (SMoE) architectures are increasingly used to scale large language models efficiently.<n>SMoE models often suffer from severe load imbalance across experts, where a small subset of experts receives most tokens while others are underutilized.<n>We present a systematic analysis of expert routing during inference and identify three findings: (i) load imbalance persists and worsens with larger batch sizes, (ii) selection frequency does not reliably reflect expert importance, and (iii) overall expert workload and importance can be estimated using a small calibration set.
  arXiv  Detail & Related papers  (2026-02-23T15:11:16Z)
• A Graph-Based Forensic Framework for Inferring Hardware Noise of Cloud Quantum Backend [0.5352699766206807]
  Cloud quantum platforms give users access to many backends with different qubit technologies, coupling layouts, and noise levels.<n>Execution of a circuit depends on internal allocation and routing policies that are not observable to the user.<n>We introduce a Graph Neural Network (GNN)-based forensic framework that predicts per-qubit and per-qubit link error rates of an unseen backend.
  arXiv  Detail & Related papers  (2025-12-16T16:17:04Z)
• Forensics of Error Rates of Quantum Hardware [2.348041867134616]
  We estimate the error rate of the backend from the original and transpiled circuit.<n>For the forensics, we exploit the fact that qubit mapping and routing steps of the transpilation process select qubits and qubit pairs with less single qubit and two-qubit gate errors.
  arXiv  Detail & Related papers  (2025-05-16T21:25:12Z)
• Low bit-flip rate probabilistic error cancellation [0.0]
  Noise remains one of the most significant challenges in the development of reliable and scalable quantum processors. In this work, we explore how the unique noise bias of cat-qubits can be harnessed to enhance error mitigation efficiency.
  arXiv  Detail & Related papers  (2024-11-10T11:04:16Z)
• SignSGD with Federated Voting [69.06621279967865]
  SignSGD with majority voting (signSGD-MV) is an effective distributed learning algorithm that can significantly reduce communication costs by one-bit quantization. We propose a novel signSGD with textitfederated voting (signSGD-FV) The idea of federated voting is to exploit learnable weights to perform weighted majority voting. We demonstrate that the proposed signSGD-FV algorithm has a theoretical convergence guarantee even when edge devices use heterogeneous mini-batch sizes.
  arXiv  Detail & Related papers  (2024-03-25T02:32:43Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• FIRE: A Failure-Adaptive Reinforcement Learning Framework for Edge Computing Migrations [52.85536740465277]
  FIRE is a framework that adapts to rare events by training a RL policy in an edge computing digital twin environment. We propose ImRE, an importance sampling-based Q-learning algorithm, which samples rare events proportionally to their impact on the value function. We show that FIRE reduces costs compared to vanilla RL and the greedy baseline in the event of failures.
  arXiv  Detail & Related papers  (2022-09-28T19:49:39Z)
• Volumetric Benchmarking of Error Mitigation with Qermit [0.0]
  We develop a methodology to assess the performance of quantum error mitigation techniques. Our benchmarks are volumetric in design, and are performed on different superconducting hardware devices. Qermit is an open source python package for quantum error mitigation.
  arXiv  Detail & Related papers  (2022-04-20T18:13:04Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Experimental demonstration of continuous quantum error correction [0.0]
  We implement a continuous quantum bit-flip correction code in a multi-qubit architecture. We achieve an average bit-flip detection efficiency of up to 91%. Our results showcase resource-efficient stabilizer measurements in a multi-qubit architecture.
  arXiv  Detail & Related papers  (2021-07-23T18:00:55Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Qubit Readout Error Mitigation with Bit-flip Averaging [0.0]
  We present a scheme to more efficiently mitigate qubit readout errors on quantum hardware. Our scheme removes biases in the readout errors allowing a general error model to be built with far fewer calibration measurements. Our approach can be combined with, and simplify, other mitigation methods allowing tractable mitigation even for large numbers of qubits.
  arXiv  Detail & Related papers  (2021-06-10T15:08:06Z)
• Federated Learning with Unreliable Clients: Performance Analysis and Mechanism Design [76.29738151117583]
  Federated Learning (FL) has become a promising tool for training effective machine learning models among distributed clients. However, low quality models could be uploaded to the aggregator server by unreliable clients, leading to a degradation or even a collapse of training. We model these unreliable behaviors of clients and propose a defensive mechanism to mitigate such a security risk.
  arXiv  Detail & Related papers  (2021-05-10T08:02:27Z)
• Straggler-aware Distributed Learning: Communication Computation Latency Trade-off [56.08535873173518]
  Straggling workers can be tolerated by assigning redundant computations and coding across data and computations. In most existing schemes, each non-straggling worker transmits one message per iteration to the parameter server (PS) after completing all its computations. Imposing such a limitation results in two main drawbacks; over-computation due to inaccurate prediction of the straggling behaviour, and under-utilization due to treating workers as straggler/non-straggler.
  arXiv  Detail & Related papers  (2020-04-10T08:39:36Z)

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.