arXiv subjects

Ilkwon Sohn

Publications and source records attributed to Ilkwon Sohn.

5 recordsLinked to original sources

arXiv2026

An Entanglement-Assisted Stabilizer Framework for Distributed Sensing of Local Phases

Distributed quantum sensing requires spatially separated probes to acquire local parameters while maintaining compatibility with network-level quantum information processing. We develop an entanglement-assisted stabilizer framework based on the extended structure of entanglement-assisted quantum error-correcting (EAQEC) codes, in which the remote halves of pre-shared ebits are used directly as local phase probes while the joint state simultaneously carries an encoded logical subsystem. Each remote probe acquires a local Z-axis phase and subsequently returns through an X-type noise channel. Within the extended EAQEC stabilizer structure, the stabilizer containing $X_{B_j}$ provides phase-dependent measurement statistics, whereas its partner containing $Z_{B_j}$ records the corresponding return-error syndrome. A graph-code formulation is introduced to make this structure explicit, together with an illustrative [[5,1,3;2]] construction. We further show that, conditioned on the joint sensing-and-syndrome measurement record, the post-sensing state differs from the original encoded state only by a known Pauli transformation, so that the logical information remains available for subsequent encoded operations. For the local-phase model considered here, the stabilizer readout attains the available quantum Fisher information, while the finite-shot estimator approaches the corresponding $1/\sqrt{M}$ scaling as the number of repetitions increases. The framework therefore provides a common entanglement-assisted stabilizer structure for distributed local-phase sensing, restricted return-error identification, and post-sensing logical-state retention, without relying on an intrinsic metrological enhancement from EAQEC itself.

quant-ph↗

arXiv2026

Low Spatial Cost CCZ Magic State Factory

We propose a design framework for reconstructing gate-based magic state distillation protocols as compact joint-measurement architectures implementable with the surface code. The goal is to reduce the surface-code resource cost of a magic state factory while preserving the logical function and error-detection structure of the distillation protocol. We construct a reduced architecture for implementing an eight-to-three CCZ distillation protocol using smaller surface-code patches. The proposed factory preserves the single-fault-detection property and the leading-order error suppression of the protocol, while producing CCZ magic states with lower spatial cost than the design of Gidney and Fowler. The proposed design perspective can also be applied to T-state factories and other multiqubit non-Clifford resource-state factories. Our approach provides a framework for extending the design space of surface-code magic state factories beyond a single CCZ layout optimization.

quant-ph↗

arXiv2026

Sharpening Worst-Case Error Assessment for Fault-Tolerant Quantum Computing: Fidelity and Its Deviation

Gate fidelity -- an average fidelity over all possible input states -- is the workhorse metric for benchmarking quantum gates or circuits, yet fault-tolerant quantum computing ultimately depends on the worst-case behavior, typically quantifiable by so-called the diamond distance. In the low-error regime, the coherent errors can inflate the worst-case error even when the reported gate fidelity is high, making the gate fidelity alone an unreliable proxy for fault-tolerance readiness. To capture the missing information, we introduce a companion observable -- what we dub the fidelity deviation -- that quantifies how strongly the state-dependent fidelities fluctuate across input states. Adopting such fluctuations in assessing the fault-tolerance is physically natural because some input directions are nearly unaffected while others form narrow "valleys" that dominate adversarial circuit behavior. For coherent (unitary) gate errors on two or more qubits, we show that the gate fidelity together with the fidelity deviation constrains the relevant spectral moments of the error unitary, enabling an explicit and tight certificate of the worst-case error. Both quantities are estimated directly from the same randomized input-measurement experiment, without full process tomography. We show that the fidelity and its deviation can provide an economical, operationally meaningful, and accurate standard for assessing the fault tolerance of the engineered quantum gates and circuits.

quant-ph↗

arXiv2025

Improving Entanglement Resilience in Quantum Memories with Error-Detection-Based Distillation

The degradation of entanglement in quantum memories due to decoherence is a critical challenge for scalable quantum networks. We present an entanglement distillation protocol based on the [[4,2,2]] quantum error-detecting code, deriving analytical expressions for its output fidelity and yield, and benchmarking it against the BBPSSW protocol. In addition to single round performance, we further examine the iterative behavior of both protocols through multi-round fidelity and cumulative yield analysis. We then investigate a storage-stage recovery strategy in which the retained logical entangled state is subjected to repeated stabilizer-based syndrome checks without decoding and re-encoding, avoiding the need to regenerate and redistribute entanglement from scratch. Our analysis shows that this strategy can extend the usable storage lifetime beyond the BBPSSW baseline when the classical communication latency is sufficiently small. We derive latency thresholds and quantify the cumulative acceptance probabilities for different numbers of syndrome checks. A sensitivity analysis further shows that local gate and measurement errors reduce the fidelity advantage region and the admissible communication latency window, highlighting the importance of sufficiently accurate local operations. These results provide a quantitative framework for assessing the storage-stage benefit of logical state retention in the presence of finite communication latency and nonideal local operations.

quant-ph↗

arXiv2024

Designing generalized elegant Bell inequalities in higher dimensions from a Tsirelson bound

Elegant Bell inequality is well known for its distinctive property, being maximally violated by maximal entanglement, mutually unbiased bases, and symmetric informationally complete positive operator-valued measure elements. Despite its significance in quantum information theory demonstrated based on its unique violation feature, it remains the only known one with the characteristic. We present a method to construct Bell inequalities with violation feature analogous to elegant Bell inequality in higher local dimensions from a simple, analytic quantum bound. A Bell inequality with the generalized violation feature is derived in three dimension for the first time. It exhibits larger violation than existing Bell inequalities of similar classes, including the original elegant Bell inequality, while requiring arguably small number of measurements.

quant-ph↗