Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.02169

Universal Z-only Correction for Distributing Arbitrary Graph States in Quantum Networks

Soumyojyoti Dutta
View original source ↗Read source document ↗Export metadata ↓

Abstract

Distributing arbitrary graph states across quantum networks is a central challenge for modular quantum computing and measurement-based quantum communication. I present a protocol converting |E| elementary two-qubit resource states -- one per edge of the target graph G = (V,E) -- into the distributed graph state |G>, using only single-qubit operations, measurements, and classical communication, and reaching arbitrary topologies, not just the GHZ class of prior walk-based schemes. The central result is a universal correction theorem: for any graph and any measurement outcome, the local correction C_v = Z_v^{g_v}, with g_v the XOR of the far-side outcomes on edges at v, restores the state to |G> -- one formula for all topologies, no case analysis. The elementary step comes from the coined discrete-time quantum walk with the position-permuting shift replaced by a diagonal conditional phase (CZ) gate: the phase quantum walk (PQW). Formulas are verified exhaustively on 22 connected graphs -- all up to four vertices, and five-vertex graphs with at most six edges -- over 32,212 outcomes at F = 1.0. Exact closed-form fidelities under independent depolarising and phase damping noise on the resource qubitsfollow, F*_dep = prod_v [1 + (1 - 4p/3)^{deg v}]/2 and F*_pd = prod_v [1 +(1 - p)^{(deg v)/2}]/2: the noise budget is set by the degree sequence of the target graph, not by its edge count. On ibm_kingston (IBM Heron r2, CZ-native) direct fidelity estimation certifies F = 0.815(3) for |L_4>, 0.776(3) for |GHZ_4>, and 0.733(3) for |C_4> in a single native-layout batch. I also establish a necessary condition for native (SWAP-free) execution at coupling girth g: the target graph must have girth at least g/3 and maximum degree at most 3. On heavy-hex (g = 12) this forbids triangles and places |L_4>, |C_4>, and |K_4> in a strict embeddability hierarchy -- flexible, rigid, and provably impossible.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Soumyojyoti Dutta. 2026-04-02. Universal Z-only Correction for Distributing Arbitrary Graph States in Quantum Networks. https://arxiv.org/abs/2604.02169

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗