Back to News
quantum-computing

Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies

arXiv Quantum Physics
Loading...
4 min read
0 likes
⚡ Quantum Brief
Researchers analyzed crosstalk risks in multitenant quantum computing across seven IBM processors, including Heron and Nighthawk architectures, revealing security vulnerabilities from concurrent job execution. Three circuit types emerged: aggressive (e.g., Grover’s Algorithm, showing t-statistics of 1.37–2.61), sensitive (e.g., Quantum Fourier Transform), and cotenant-dependent, each reacting differently to interference. Crosstalk patterns proved consistent within processor revisions (intra-revision similarity up to 0.77) but diverged between revisions (inter-revision similarity as low as 0.43). A "topological decoupling" was found between Heavy-Hex and square lattice systems, with structural similarity plummeting to 0.01 between Heron r1 and Nighthawk r1. The study proposes hardware-aware scheduling to pair jobs strategically, balancing system utilization with computational integrity.
Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies

Summarize this article with:

Quantum Physics arXiv:2605.00118 (quant-ph) [Submitted on 30 Apr 2026] Title:Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies Authors:Andrew Woods, Chi-Ren Shyu View a PDF of the paper titled Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies, by Andrew Woods and Chi-Ren Shyu View PDF HTML (experimental) Abstract:Multitenancy increases throughput and reduces costs in cloud-based quantum computing, but concurrent job execution introduces security risks through inter-circuit crosstalk. We characterize the structural predictability of these interference patterns across seven IBM superconducting processors, spanning Heron (r1-r3) and Nighthawk (r1) architectures and five different circuit types. We evaluate pairwise interactions, by applying the Structural Similarity Index (SSIM) and a structural $t$-statistic to the concurrent execution of five foundational quantum circuits (QAOA, Grover's, QPE, QFT, and ZZFeatureMap), we quantify behavioral consistency across disparate hardware. Our results identify three types of circuits: universally aggressive, universally sensitive, and cotenant-dependent circuits. Aggressive circuits, such as Grover's Algorithm, exhibit a statistically significant interference pattern, yielding a $t$-statistic range of $[1.37,2.61]$ relative to the standalone baselines across all tested pairings. Conversely, sensitive circuits, such as the Quantum Fourier Transform, demonstrate a disproportionate susceptibility to multitenant execution, showing high deviations from single-tenant computational behavior. We demonstrate that crosstalk signatures are highly consistent within architectural revisions--with intra-revision similarity reaching $0.77$ (Hr3) and $0.68$ (Hr2)--while inter-revision similarity drops to $0.43$. Furthermore, we identify a ``topological decoupling" between Heavy-Hex and square lattice systems, where structural similarity falls to $0.01$ between Heron r1 and Nighthawk r1. These findings provide an empirical foundation for hardware-aware schedulers to strategically pair jobs, maximizing system utilization while preserving computational integrity. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2605.00118 [quant-ph] (or arXiv:2605.00118v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2605.00118 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Andrew Woods M [view email] [v1] Thu, 30 Apr 2026 18:18:41 UTC (848 KB) Full-text links: Access Paper: View a PDF of the paper titled Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies, by Andrew Woods and Chi-Ren ShyuView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-05 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

government-funding
quantum-computing
quantum-algorithms

Source Information

Source: arXiv Quantum Physics