The paper defines covert quantum computing via quantum strategies, proves O(sqrt(n)) border qubits suffice for detection in planar n-qubit circuits with nearest-neighbor crosstalk, and experimentally detects additional long-range coupling on IQM Emerald and IBM Heron processors.
Isoperimetric Inequalities on Hexagonal Grids
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower bounds for the number of vertices in the neighborhood of W and for the number of vertices in the boundary of W. For the infinite hexagonal grid the given bounds are tight.
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Toward Covert Quantum Computing
The paper defines covert quantum computing via quantum strategies, proves O(sqrt(n)) border qubits suffice for detection in planar n-qubit circuits with nearest-neighbor crosstalk, and experimentally detects additional long-range coupling on IQM Emerald and IBM Heron processors.