Toward Covert Quantum Computing

• URL: http://arxiv.org/abs/2605.14325v1
• Date: Thu, 14 May 2026 03:39:30 GMT
• Title: Toward Covert Quantum Computing
• Abstract summary: emphcovert quantum computing ensures an adversary with access to all other quantum computational units cannot detect on the subset that they cannot access.<n>We implement Ramsey experiments on qubits not used in computation, and detect nearest-neighbor crosstalk, as expected.<n>We also observe long-range coupling effects beyond the border qubits, revealing a side channel that the adversary can exploit.
• Score: 3.135152720206845
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As quantum computers become available through multi-tenant cloud platforms, ensuring privacy against adversaries sharing the same quantum processing unit becomes critical. We introduce and explore \emph{covert quantum computing}, a new concept that ensures an adversary with access to all other quantum computational units (QCUs) of a quantum computer cannot detect computation on the subset that they cannot access. Analogous to covert communication, we employ information theory. However, since here the adversary controls the systems used for detection, we require a richer framework for covertness analysis that accounts for the use of quantum memories and adaptive operations. Thus, we adopt the \emph{quantum-strategy} framework used in quantum game theory and memory channel discrimination. Current quantum computers use planar graph circuit layouts and typically assume nearest-neighbor crosstalk. We derive discrete isoperimetric inequalities to show that, for an $n$-qubit circuit under this model, only $\mathcal{O}(\sqrt{n})$ border qubits provide detection information to the adversary. We then explore this scaling law on IQM's 54-qubit \emph{Emerald} processor and IBM's 156-qubit \emph{ibm\_fez} machine employing the Heron 2 architecture. We implement Ramsey experiments on qubits not used in computation, and detect nearest-neighbor crosstalk, as expected. However, we also observe long-range coupling effects beyond the border qubits, revealing a side channel that the adversary can exploit. We hypothesize that this long-range crosstalk is induced by leakage from the drive and control lines. Beyond weakening covertness, it exposes co-tenants to both adversarial and unintended crosstalk and degrades circuits that span spatially distributed qubits, motivating further work on spatial isolation and crosstalk characterization.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Trajectory-Protected Quantum Computing [0.0]
  We demonstrate a quantum computing model that utilizes a qubit's motion to protect it from decoherence.<n>We are able to perform one-qubit gates by stimulating the counter-rotating wave terms and two-qubit gates by extracting the entanglement from the quantum field prepared in a squeezed state.
  arXiv  Detail & Related papers  (2025-10-14T17:51:03Z)
• Hacking quantum computers with row hammer attack [41.94295877935867]
  We demonstrate a hardware vulnerability in quantum computing systems by exploiting cross-talk effects on an available commercial quantum computer (IBM)<n>Specifically, based on the cross-talk produced by certain quantum gates, we implement a row hammer attack that ultimately allows us to flip a qubit.<n>Our findings reveal that two-qubit operations applied near the target qubit significantly influence it through cross-talk, effectively compromising its state.
  arXiv  Detail & Related papers  (2025-03-27T16:14:08Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
  Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing. In this paper, we show that such constrained architectures can also support fault tolerance. We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
  arXiv  Detail & Related papers  (2024-02-19T23:31:55Z)
• Estimating the Effect of Crosstalk Error on Circuit Fidelity Using Noisy Intermediate-Scale Quantum Devices [0.0]
  Crosstalk between parallel instructions can corrupt quantum states and cause incorrect program execution. We present a necessary analysis of the crosstalk error effect on NISQ devices. Our results demonstrate the crosstalk error model of three different IBM quantum devices over the experimental week.
  arXiv  Detail & Related papers  (2024-02-10T13:42:14Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Characterizing crosstalk of superconducting transmon processors [0.0]
  We show how to efficiently and systematically characterize the magnitude of crosstalk effects on an entire quantum chip. We propose more accurate means to simulate noisy quantum hardware by devising an appropriate crosstalk-aware noise model.
  arXiv  Detail & Related papers  (2023-03-24T16:11:28Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Investigating the Chinese Postman Problem on a Quantum Annealer [0.0]
  D-Wave annealers are promising platforms to solve problems in the form of quadratic unconstrained binary optimization. We provide a formulation of the Chinese postman problem that can be used as a tool for probing the local connectivity of graphs and networks.
  arXiv  Detail & Related papers  (2020-08-06T17:11:54Z)

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.