Toward Covert Quantum Computing
Evan J. D. Anderson, Kaushik Datta, and Boulat A. Bash

TL;DR
This paper introduces covert quantum computing, a method to hide quantum computations from adversaries sharing the same hardware, using information theory and quantum game theory to analyze detection risks and crosstalk effects.
Contribution
It proposes a new framework for covert quantum computing, derives bounds on detectability based on circuit layout, and experimentally investigates crosstalk on real quantum processors.
Findings
Detection information scales with the square root of the number of qubits.
Long-range crosstalk beyond border qubits can be exploited as a side channel.
Crosstalk from drive and control lines may weaken covertness and cause unintended interactions.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
