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:2504.04285 · ACM Great Lakes Symposium on VLSI (GLSVLSI)

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

Subrata Das, Swaroop Ghosh

Published Jun 27, 2025• 2 citations
arXivHTMLPDF

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.

DOI
10.1145/3716368.3735191

Related papers

SHARE: Secure Hardware Allocation and Resource Efficiency in Quantum Systems

Suryansh Upadhyay, Swaroop Ghosh

Quantum computing (QC) is poised to revolutionize problem-solving across various fields, with research suggesting that systems with over 50 qubits may achieve quantum advantage-surpassing supercomputers in certain optimization tasks. As the hardware size of Noisy Intermediate-Scale Quantum (NISQ) computers continues to grow, Multi-tenant computing (MTC) has emerged as a viable approach to enhance hardware utilization by allowing shared resource access across multiple quantum programs. However, MTC can also bring challenges and security concerns. This paper focuses on optimizing quantum hardware utilization in shared environments by implementing multi-programming strategies that not only enhance hardware utilization but also effectively manage associated risks like crosstalk and fault injection. We propose a novel partitioning and allocation method called Community-Based Dynamic Allocation Partitioning (COMDAP) and Secure COMDAP to refine and secure multi-programming capabilities in quantum systems. COMDAP ensures equitable and efficient resource distribution, addresses the issues of suboptimal partitioning, and significantly improves hardware utilization. We report a 23% average improvement in hardware utilization rate compared to existing greedy heuristics, with rates averaging 92%. COMDAP introduces an average increase of approximately 0.05X in$\Delta \mathbf{CX}$, alongside a 3.5% average reduction in PST across benchmarks.

arXiv:2405.00863•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•12 citations

Stealthy SWAPs: Adversarial SWAP Injection in Multi-Tenant Quantum Computing

Suryansh Upadhyay, Swaroop Ghosh

Quantum computing (QC) holds tremendous promise in revolutionizing problem-solving across various domains. It has been suggested in literature that 50+ qubits are sufficient to achieve quantum advantage (i.e., to surpass supercomputers in solving certain class of optimization problems). The hardware size of existing Noisy Intermediate-Scale Quantum (NISQ) computers have been ever increasing over the years. Therefore, Multi-tenant computing (MTC) has emerged as a potential solution for efficient hardware utilization, enabling shared resource access among multiple quantum programs. However, MTC can also bring new security concerns. This paper proposes one such threat for MTC in superconducting quantum hardware i.e., adversarial SWAP gate injection in victim’s program during compilation for MTC. We present a representative scheduler designed for optimal resource allocation. To demonstrate the impact of this attack model, we conduct a detailed case study using a sample scheduler. Exhaustive experiments on circuits with varying depths and qubits offer valuable insights into the repercussions of these attacks. We report a max of $\approx 55$% and a median increase of $\approx 25$% in SWAP overhead. As a countermeasure, we also propose a sample machine learning model for detecting any abnormal user behavior and priority adjustment.

arXiv:2310.17426•International Conference on VLSI Design•Jan 6, 2024•19 citations

Forensics of Error Rates of Quantum Hardware

Rupshali Roy, Swaroop Ghosh

The qubit technologies, basis gate set, noise behavior, speed and coupling architecture are among the various factors that vary among various backends. Although third-party cloud providers offering quantum hardware as a service offer lower cost and flexibility to the users to choose from several qubit technologies, quantum hardware, and coupling maps; the actual execution of the program is not clearly visible to the customer. The success of the user program, in addition to various other metadata such as cost, performance, & number of iterations to converge, depends on the error rate of the backend used. Moreover, the third-party provider and/or tools (e.g., hardware allocator and mapper) may hold insider/outsider adversarial agents to conserve resources and maximize profit by running the quantum circuits on error-prone hardware. Thus it is important to gain visibility of the backend from various perspectives of the computing process e.g., execution, transpilation and outcomes. In this paper, we estimate the error rate of the backend from the original and transpiled circuit. Although many quantum services providers publish the error rates of their backends, we assume that such information may not be accurate and/or correspond to the actual hardware allocated to the program. For the forensics we propose two complementary approaches. First, we exploit the fact that qubit mapping and routing steps of the transpilation process select qubits and qubit pairs with low gate errors to minimize overall error accumulation. We leverage this to rank qubit links into bins and compare with publicly available data we are able to assign a bin rank within a difference of 2 with respect to the actual bin for upto$\mathbf{8 3. 5 \%}$of the qubit links in IBM Sherbrooke and$\mathbf{8 0 \%}$in IBM Brisbane, 127 qubit IBM backends. Second, we derive the error rates of the backends from a pool of programs by solving fidelity equations using numerical nonlinear optimizer. We achieve upto$92.7 \%(97.3 \%)$accuracy for single qubit (2 qubit) gate error rates.

arXiv:2505.11706•IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD)•Nov 10, 2025•2 citations

Coherence Rather Than Error Rate Governs Privacy in Multi-Tenant Quantum Computing

Farhad Farokhi

Multi-tenant computing enables providers of commercial cloud quantum processors to rent disjoint sectors of a device to independent users. Average gate error, which cloud quantum computing providers report, does not determine how much one tenant learns about another. We propose an information-theoretic notion of information leakage across co-tenancy boundaries stemming from quantum state distinguishability. We measure this leakage on commercially-available 156-qubit (IBM Kingston) and 20-qubit (IQM Garnet) devices. Boundaries with identical benchmarked error can offer significantly different amount of information leakage because standard reported measures of error are blind to coherent-versus-stochastic nature of the error while the proposed notion of information leakage is not. A uniform Pauli randomisation implemented over the victim's whole register is used as a defence mechanism to reduce the information leakage to zero. The defence theoretically does not incur a fidelity cost, but the experiments show a non-trivial degradation caused by accumulation of errors. We provide a specific call-for-action to the providers of quantum cloud computing to report information leakage in addition to standard error rates in their device datasheet to enable users to compute privacy and security risks prior to engagement with the device.

quant-pharXiv:2609.34411•Sep 29, 2026•0 citations

Optimizing Resource Allocation in a Distributed Quantum Computing Cloud: a Game-Theoretic Approach

Bernard Ousmane Sane, Michal Hajdušek, Rodney Van Meter

Quantum cloud computing will play a vital role in achieving quantum supremacy by providing flexible allocation of resources for applications that demand extensive computational power. Such a platform allows various clients to run their quantum jobs (quantum circuits) without managing the quantum hardware and to pay based on resource usage. Therefore, defining optimal quantum resource allocation is essential to prevent overcharging clients and to help quantum cloud providers maximize resource utilization. Our approach involves examining the problem from a game theory perspective. We introduce a quantum circuit partitioning resource allocation game model (QC-PRAGM) designed to minimize client costs and inter-node communication. This is achieved by solving a convex optimization problem that finds the system's optimal cost while maximizing the number of local gates within a partition through the selection of the best qubit combinations. We demonstrate analytically that clients are charged fairly. Additionally, our simulations show that our solutions outperform traditional methods.

arXiv:2504.18298•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•2 citations

Predicting the Temporal Variability of Error Rates in Superconducting Quantum Processors: Mitigating Error Accuracy Loss in Queue-Based Quantum Computing Platforms [Focus: Quantum Software and its Engineering]

Laura Rodríguez-Soriano, Francisco García-Herrero, Carmen G. Almudéver

Multiple layers of the quantum system full-stack require data on temporal variations in error rates of physical elements. The absence of this information, especially when users access cloud-based quantum systems with waiting queues between compilation and execution, can lead to unreliable computations due to outdated calibration data. One example is the compilation process that impacts the success rate of quantum circuits. This paper proposes using five machine learning and time-series models to predict error rate variability for two-qubit gates based on calibration data. We compare model accuracy and complexity in terms of execution time. The predicted information is applied to a noise-aware compiler to evaluate the impact on success rate. Experimental results on a real superconducting quantum processor demonstrate accurate predictions of temporal error rate variability, achieving performance comparable to that of real calibration data, reducing the impact of queue waiting times that can reach up to two days.

IEEE Software•May 26, 2025•1 citation
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.
Quantum computing (QC) is poised to revolutionize problem-solving across various fields, with research suggesting that systems with over 50 qubits may achieve quantum advantage-surpassing supercomputers in certain optimization tasks. As the hardware size of Noisy Intermediate-Scale Quantum (NISQ) computers continues to grow, Multi-tenant computing (MTC) has emerged as a viable approach to enhance hardware utilization by allowing shared resource access across multiple quantum programs. However, MTC can also bring challenges and security concerns. This paper focuses on optimizing quantum hardware utilization in shared environments by implementing multi-programming strategies that not only enhance hardware utilization but also effectively manage associated risks like crosstalk and fault injection. We propose a novel partitioning and allocation method called Community-Based Dynamic Allocation Partitioning (COMDAP) and Secure COMDAP to refine and secure multi-programming capabilities in quantum systems. COMDAP ensures equitable and efficient resource distribution, addresses the issues of suboptimal partitioning, and significantly improves hardware utilization. We report a 23% average improvement in hardware utilization rate compared to existing greedy heuristics, with rates averaging 92%. COMDAP introduces an average increase of approximately 0.05X inΔCX\Delta \mathbf{CX}ΔCX, alongside a 3.5% average reduction in PST across benchmarks.
Quantum computing (QC) holds tremendous promise in revolutionizing problem-solving across various domains. It has been suggested in literature that 50+ qubits are sufficient to achieve quantum advantage (i.e., to surpass supercomputers in solving certain class of optimization problems). The hardware size of existing Noisy Intermediate-Scale Quantum (NISQ) computers have been ever increasing over the years. Therefore, Multi-tenant computing (MTC) has emerged as a potential solution for efficient hardware utilization, enabling shared resource access among multiple quantum programs. However, MTC can also bring new security concerns. This paper proposes one such threat for MTC in superconducting quantum hardware i.e., adversarial SWAP gate injection in victim’s program during compilation for MTC. We present a representative scheduler designed for optimal resource allocation. To demonstrate the impact of this attack model, we conduct a detailed case study using a sample scheduler. Exhaustive experiments on circuits with varying depths and qubits offer valuable insights into the repercussions of these attacks. We report a max of ≈55\approx 55≈55% and a median increase of ≈25\approx 25≈25% in SWAP overhead. As a countermeasure, we also propose a sample machine learning model for detecting any abnormal user behavior and priority adjustment.
The qubit technologies, basis gate set, noise behavior, speed and coupling architecture are among the various factors that vary among various backends. Although third-party cloud providers offering quantum hardware as a service offer lower cost and flexibility to the users to choose from several qubit technologies, quantum hardware, and coupling maps; the actual execution of the program is not clearly visible to the customer. The success of the user program, in addition to various other metadata such as cost, performance, & number of iterations to converge, depends on the error rate of the backend used. Moreover, the third-party provider and/or tools (e.g., hardware allocator and mapper) may hold insider/outsider adversarial agents to conserve resources and maximize profit by running the quantum circuits on error-prone hardware. Thus it is important to gain visibility of the backend from various perspectives of the computing process e.g., execution, transpilation and outcomes. In this paper, we estimate the error rate of the backend from the original and transpiled circuit. Although many quantum services providers publish the error rates of their backends, we assume that such information may not be accurate and/or correspond to the actual hardware allocated to the program. For the forensics we propose two complementary approaches. First, we exploit the fact that qubit mapping and routing steps of the transpilation process select qubits and qubit pairs with low gate errors to minimize overall error accumulation. We leverage this to rank qubit links into bins and compare with publicly available data we are able to assign a bin rank within a difference of 2 with respect to the actual bin for upto83.5%\mathbf{8 3. 5 \%}83.5%of the qubit links in IBM Sherbrooke and80%\mathbf{8 0 \%}80%in IBM Brisbane, 127 qubit IBM backends. Second, we derive the error rates of the backends from a pool of programs by solving fidelity equations using numerical nonlinear optimizer. We achieve upto92.7%(97.3%)92.7 \%(97.3 \%)92.7%(97.3%)accuracy for single qubit (2 qubit) gate error rates.
Multi-tenant computing enables providers of commercial cloud quantum processors to rent disjoint sectors of a device to independent users. Average gate error, which cloud quantum computing providers report, does not determine how much one tenant learns about another. We propose an information-theoretic notion of information leakage across co-tenancy boundaries stemming from quantum state distinguishability. We measure this leakage on commercially-available 156-qubit (IBM Kingston) and 20-qubit (IQM Garnet) devices. Boundaries with identical benchmarked error can offer significantly different amount of information leakage because standard reported measures of error are blind to coherent-versus-stochastic nature of the error while the proposed notion of information leakage is not. A uniform Pauli randomisation implemented over the victim's whole register is used as a defence mechanism to reduce the information leakage to zero. The defence theoretically does not incur a fidelity cost, but the experiments show a non-trivial degradation caused by accumulation of errors. We provide a specific call-for-action to the providers of quantum cloud computing to report information leakage in addition to standard error rates in their device datasheet to enable users to compute privacy and security risks prior to engagement with the device.
Quantum cloud computing will play a vital role in achieving quantum supremacy by providing flexible allocation of resources for applications that demand extensive computational power. Such a platform allows various clients to run their quantum jobs (quantum circuits) without managing the quantum hardware and to pay based on resource usage. Therefore, defining optimal quantum resource allocation is essential to prevent overcharging clients and to help quantum cloud providers maximize resource utilization. Our approach involves examining the problem from a game theory perspective. We introduce a quantum circuit partitioning resource allocation game model (QC-PRAGM) designed to minimize client costs and inter-node communication. This is achieved by solving a convex optimization problem that finds the system's optimal cost while maximizing the number of local gates within a partition through the selection of the best qubit combinations. We demonstrate analytically that clients are charged fairly. Additionally, our simulations show that our solutions outperform traditional methods.
Multiple layers of the quantum system full-stack require data on temporal variations in error rates of physical elements. The absence of this information, especially when users access cloud-based quantum systems with waiting queues between compilation and execution, can lead to unreliable computations due to outdated calibration data. One example is the compilation process that impacts the success rate of quantum circuits. This paper proposes using five machine learning and time-series models to predict error rate variability for two-qubit gates based on calibration data. We compare model accuracy and complexity in terms of execution time. The predicted information is applied to a noise-aware compiler to evaluate the impact on success rate. Experimental results on a real superconducting quantum processor demonstrate accurate predictions of temporal error rate variability, achieving performance comparable to that of real calibration data, reducing the impact of queue waiting times that can reach up to two days.