hardware sensing

Optimal finite-copy readout of three-qubit entanglement with state retention

Curator's Take

AI Commentary

This article pinpoints the exact resource‑trade‑off for certifying genuine three‑qubit GHZ entanglement while still preserving the original state, showing that five copies already boost the success probability and enable conditional state retention—a capability that could streamline error‑diagnostics in near‑term quantum processors. By framing the problem in terms of symmetry‑based “additional‑copy” theorems and delivering concrete local Schur measurement circuits, it connects abstract entanglement theory to hardware‑friendly protocols that are directly implementable on superconducting or trapped‑ion platforms. The results also clarify how multi‑copy strategies outperform binary thinning for variance reduction, offering a practical blueprint for more efficient quantum sensing and verification tasks as devices scale beyond a few qubits.

— Mark Eatherly

Summary

For unknown three-qubit pure states, we characterize the optimal trade-off among GHZ-class certification, binary probability readout of the three-tangle, and conditional state retention. The vanishing ideal of the null class specifies the optimal certification subspace, while a polynomial multiplication operator gives the spectral limit for binary readout. Four copies are necessary for a nonzero certificate. A fifth copy raises the optimal success probability from $τ^{2}/48$ to $5τ^{2}/72$ and permits the original unknown state to be retained, where $τ$ is the three-tangle. We obtain this gain as an instance of a general symmetry-based additional-copy theorem. At six copies the optimal certification probability is $(39+2S)τ^{2}/296$, with $S=\sum_{X}\mathrm{Tr}\,ρ_{X}^{2}$, whereas the largest exact binary probability is $τ^{2}/8$. Local Schur measurements and conditional local operations with classical communication attain these bounds. Retaining the full six-copy branch record yields a weighted estimator with lower variance than binary thinning of the same data. Explicit circuits and fixed-budget comparisons connect the success probabilities to input-copy consumption, retained quantum output, and coherent gate cost.