SearcharxivSearch

arXiv subjects

Jun Heo

Publications and source records attributed to Jun Heo.

At least 19 recordsLinked to original sources

Direct Cultivation of Entangled $|CS\rangle$ Magic States

Magic-state cultivation has so far focused mainly on single-qubit non-Clifford resources. We develop a direct cultivation architecture for the entangled state $|CS\rangle=CS|++\rangle$. Two commuting Clifford involutions project onto four usable branches related by Pauli-frame updates. A minimal six-bit $[6,2,4]$ record protects the branch label against readout errors that map one valid record to another. Verified CAT$_7$ gadgets, Steane error detection, CZZ-based controlled checks, and immediate Steane-to-surface expansion form the complete factory. The decoder uses 263 operational detector bits, while 168 additional bits are withheld for later validation. Decoding proceeds through exact low-order resolution, a precomputed higher-order catalogue, and four-coset BP+OSD. Under the stated active-location stochastic-Pauli model, exact enumeration finds no accepted closed-boundary logical-failure mechanism through fault order two, while explicit order-three failure mechanisms exist. Finite-$p$ simulations quantify acceptance, residual syndromes, and decoder workload, and targeted sampling of order-three faults estimates the leading logical-error channels. Optimizing the direct $d=5\rightarrow13$ expansion reduces accepted-output operation count by approximately 35--37\%. We compare the two routes at the same binary logical-error rate. Direct CS remains cheaper in operation count at the two lower-noise benchmark points even when the three-$T$ route is given pre-existing output patches. The ordering reverses between $8\times10^{-4}$ and $9\times10^{-4}$. These results show that an entangled non-Clifford state can be cultivated directly with a protected branch record and an explicitly certified fault-order-three output channel.

quant-ph

Coded Clifford Measurements for Multiqubit Magic-State Cultivation

Magic-state cultivation suppresses errors by measuring logical Clifford checks and discarding inconsistent outcomes. For an entangled resource, several measurement branches are usable, so their outcomes form a multibit classical record whose corruption can produce a logical-frame error. We show that this measurement record can be protected as a binary linear code. For any third-level Clifford-hierarchy unitary $U\in\mathcal C_3$, every parity of the branch bits can be measured by a commuting Hermitian Clifford check $C(v)=UX(v)U^\dagger$. Choosing which parities to measure therefore defines a binary code $y(a)=aG$. If the valid records have minimum distance $d$, at least $d$ readout-bit flips are required to confuse one valid branch with another, giving $P_{\rm wv}=O(q^d)$. A Plotkin bound limits the length of any binary branch record, and the Clifford schedules attain this limit: at distance four, six logical measurements suffice for $|CS\rangle$ and seven for $|CCZ\rangle$, compared with eight and twelve under independent repetition. Thus restricting the logical schedule to Clifford parities requires no additional measurements. In a native-CZZ-assisted Steane implementation, the $[6,2,4]$ CS schedule is also the unique minimum-cost distance-four solution within the compiled Clifford-check family, reducing the cultivation core by $26.6\%$ in active locations. State-vector simulations without a final ideal code-space projection further show higher acceptance and approximately half the residual error weight on the two Steane blocks. Coding the logical measurement record therefore reduces both measurement redundancy and compiled fault-tolerant overhead.

quant-ph

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

Ring Optimized M-APSK Modulation for Discrete Modulated CV-QKD

This paper proposes a multi ring M-APSK constellation optimization method for discrete-modulated continuous variable quantum key distribution. Unlike conventional APSK structures with fixed ring spacing and predefined ring probabilities, the proposed method optimizes the ring radius ratio and ring probability to improve the finite-size secret key rate. A method based on the Gram matrix is used to calculate the nonzero spectrum of the average state $\tau$, and fidelity is used to compare the optimized discrete average state with the Gaussian average state. The results show that the proposed structure extends the maximum transmission distance of 16-APSK by approximately 15% compared with the conventional binomial APSK structure. The optimization gain is larger for small size APSK constellations, where the average state has a larger structural gap from Gaussian modulation.

quant-ph

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

Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches

Defect-adaptive surface-code methods have substantially advanced the construction of valid logical patches on imperfect hardware, but fault-tolerant computation also requires executable logical oper ations on the resulting irregular geometries. We formulate the seam-boundary defect problem: how to perform a lattice-surgery merge when the intended seam intersects deformed boundaries, disabled checks, and gauge-inferred super-stabilizers. We introduce a defect-adaptive lattice-surgery method that reconstructs the target joint logical parity from the seam-related measurements available on the irregular merged patch, together with constraints inherited from the separated pre-merge code space. The reconstruction is expressed as a compact GF(2) binary-support synthesis problem. If the requested parity is realizable, the solution gives an executable parity-extraction rule over raw, schedule-tagged gauge outcomes; otherwise, it certifies a parity-synthesis failure rather than conflat ing it with patch invalidity. The framework accommodates boundary data-qubit defects, seam-check ancilla defects, and gauge-inferred seam super-checks within a single synthesis layer. Circuit-level samples of the synthesized merge operation show improved compile yield, preserved effective dis tance, and only modest success-conditioned logical-error overhead relative to the defect-free merge reference; an explicit ZZ-merge sampling check confirms the expected transposed-geometry behav ior under the same success-conditioned observable construction. More broadly, the results identify certified parity synthesis as a compilation layer between defect-adaptive patch construction and executable fault-tolerant logical operations on imperfect surface-code hardware.

quant-ph

Numerical Evaluation of Angle-Dependent IR-Transparent Radiative Cooling Performance for Asymmetric Periodic Structures

Infrared (IR)-transparent passive radiative cooling (PRC) enables non-contact thermal management by regulating radiative heat exchange without direct attachment to the cooling object. While asymmetric IR transmission at a specific incidence angle -- typically normal incidence -- is often emphasized, we show that such single-angle asymmetry is neither sufficient nor predictive of practical cooling performance. In this work, we demonstrate that effective non-contact PRC requires angularly distributed asymmetric IR transparency evaluated through hemispherical integration over emission directions, rather than asymmetry at a single incidence angle. To quantify this effect, an angle-resolved full-wave electromagnetic (EM) model with Bloch periodic boundary conditions and Floquet mode decomposition is employed to compute wavelength- and angle-dependent bidirectional reflection and transmission of periodic PRC structures. The resulting EM response is coupled to an energy-balance-based thermal model to predict the transient temperature evolution of the cooling object. By comparing models that account for the full angular distribution with normal-incidence-only approximations, we show that pronounced asymmetric transmission at normal incidence is generally not preserved at oblique angles. As a result, angular integration yields only marginal cooling or may even result in net heating, whereas normal-incidence-based models can substantially overestimate cooling performance. These results establish angularly distributed asymmetric transparency as a key EM design principle for IR-transparent PRC and wide-angle asymmetric metasurfaces.

physics.comp-ph

Subspace-Confined QAOA with Generalized Dicke States for Multi-Channel Allocation in 5G CBRS Networks

Efficient spectrum sharing in the Citizens Broadband Radio Service (CBRS) band is essential for maximizing 5G network capacity, particularly when high-traffic base stations require simultaneous access to multiple channels. Standard formulations of the Quantum Approximate Optimization Algorithm (QAOA) impose such multi-channel constraints using penalty terms, so most of the explored Hilbert space corresponds to invalid assignments. We propose a subspace-confined QAOA tailored to CBRS multi-channel allocation, in which each node-wise channel register is initialized in a Generalized Dicke state and evolved under an intra-register XY mixer. This ansatz confines the dynamics to a tensor product of Johnson graphs that exactly encode per-node Hamming-weight constraints. For an 8-node CBRS interference graph with 24 qubits, the effective search space is reduced from the full Hilbert space of size $2^{24}$ to 2916 feasible configurations. Within this subspace, the algorithm converges rapidly to low-conflict assignments without large penalty coefficients. Simulations on instances with up to eight nodes show that the proposed ansatz achieves near-optimal conflict levels and consistently outperforms standard penalty-based QAOA and a greedy classical heuristic in terms of feasibility. Noise simulations with depolarizing channels further indicate that the constraint-preserving structure maintains a high feasibility ratio in NISQ-relevant error regimes.

quant-ph

3D Stacked Surface-Code Architecture for Measurement-Free Fault-Tolerant Quantum Error Correction

Mid-circuit measurements are a major bottleneck for superconducting quantum processors because they are slower and noisier than gates. Measurement-free quantum error correction (mfec) replaces repeated measurements and classical feed-forward by coherent quantum feedback, but existing mfec protocols suffer from severe connectivity overhead when mapped to planar surface-code architectures: transversal interactions between logical patches require SWAP chains of length $O(d)$ in the code distance, which increase depth and generate hook errors. This work introduces a 3D stacked surface-code architecture for measurement-free fault-tolerant quantum error correction that removes this connectivity bottleneck. Vertical transversal couplers between aligned surface-code patches enable coherent parity mapping and feedback with zero SWAP overhead, realizing constant-depth $O(1)$ inter-layer operations in d while preserving local 2D stabilizer checks. A fault-tolerant mfec protocol for the surface code is constructed that suppresses hook errors under realistic noise. An analytical performance model shows that the 3D architecture overcomes the readout error floor and achieves logical error rates orders of magnitude below both standard measurement-based surface codes and 2D mfec variants in regimes with slow, noisy measurements, identifying 3D integration as a key enabler for scalable measurement-free fault tolerance.

quant-ph

NWP-based Atmospheric Refractivity Modeling and Fast & Stable Non-uniform Plane Wave Ray-Tracing Simulations for LEO Link Analysis

Existing low-Earth-orbit (LEO) communication link analyses face two main challenges: (1) limited accuracy of 3D atmospheric refractivity reconstructed from sparsely sampled radiosonde data, and (2) numerical instability in previous non-uniform plane-wave ray-tracing algorithms (i.e., underflow under standard double precision), where non-uniform plane waves inevitably arise at complex-valued dielectric interfaces, is caused by extremely small atmospheric loss terms. To address these issues, we reconstruct a high-resolution 3D complex-valued refractivity model using numerical weather prediction data, and develop a fast and numerically stable non-uniform plane-wave ray tracer. The method remains stable in double precision and delivers a 24-fold speedup over high-precision benchmarks. Comparisons show that boresight-error deviations and path-loss differences between the rigorous method and the uniform-plane-wave approximation remain negligible, even under heavy precipitation. Although rays in a lossy atmosphere experience different phase- and attenuation-direction vectors-forming non-uniform plane waves-the resulting effective attenuation along the path is nearly identical to that predicted by the uniform-plane-wave model. These findings justify the continued use of uniform-plane-wave ray tracing in practical LEO link analyses.

eess.SY

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

ATLS: Automated Trailer Loading for Surface Vessels

Automated docking technologies of marine boats have been enlightened by an increasing number of literature. This paper contributes to the literature by proposing a mathematical framework that automates "trailer loading" in the presence of wind disturbances, which is unexplored despite its importance to boat owners. The comprehensive pipeline of localization, system identification, and trajectory optimization is structured, followed by several techniques to improve performance reliability. The performance of the proposed method was demonstrated with a commercial pontoon boat in Michigan, in 2023, securing a success rate of 80\% in the presence of perception errors and wind disturbance. This result indicates the strong potential of the proposed pipeline, effectively accommodating the wind effect.

eess.SY

Activation of zero-error classical capacity in low-dimensional quantum systems

Channel capacities of quantum channels can be nonadditive even if one of two quantum channels has no channel capacity. We call this phenomenon \emph{activation} of the channel capacity. In this paper, we show that when we use a quantum channel on a qubit system, only a noiseless qubit channel can generate the activation of the zero-error classical capacity. In particular, we show that the zero-error classical capacity of two quantum channels on qubit systems cannot be activated. Furthermore, we present a class of examples showing the activation of the zero-error classical capacity in low-dimensional systems.

quant-ph

Improved Reconciliation With Polar Codes In Quantum Key Distribution

Quantum key distribution (QKD) is a cryptographic system that generates an information-theoretically secure key shared by two legitimate parties. QKD consists of two parts: quantum and classical. The latter is referred to as classical post-processing (CPP). Information reconciliation is a part of CPP in which parties are given correlated variables and attempt to eliminate the discrepancies between them while disclosing a minimum amount of information. The elegant reconciliation protocol known as \emph{Cascade} was developed specifically for QKD in 1992 and has become the de-facto standard for all QKD implementations. However, the protocol is highly interactive. Thus, other protocols based on linear block codes such as Hamming codes, low-density parity-check (LDPC) codes, and polar codes have been researched. In particular, reconciliation using LDPC codes has been mainly studied because of its outstanding performance. Nevertheless, with small block size, the bit error rate performance of polar codes under successive-cancellation list (SCL) decoding with a cyclic redundancy check (CRC) is comparable to state-of-the-art turbo and LDPC codes. In this study, we demonstrate the use of polar codes to improve the performance of information reconciliation in a QKD system with small block size. The best decoder for polar codes, a CRC-aided SCL decoder, requires CRC-precoded messages. However, messages that are sifted keys in QKD are obtained arbitrarily as a result of a characteristic of the QKD protocol and cannot be CRC-precoded. We propose a method that allows arbitrarily obtained sifted keys to be CRC precoded by introducing a virtual string. Thus the best decoder can be used for reconciliation using polar codes and improves the efficiency of the protocol.

cs.IT

Entanglement-assisted codeword stabilized quantum codes with imperfect ebits

Quantum error correcting codes (QECCs) in quantum communi- cation systems has been known to exhibit improved performance with the use of error-free entanglement bits (ebits). In practical situations, ebits inevitably suffer from errors, and as a result, the error-correcting capability of the code is diminished. Prior studies have proposed two different schemes as a solu- tion. One uses only one QECC to correct errors on the receiver's side (i.e., Bob) and on the sender's side (i.e., Alice). The other uses different QECCs on each side. In this paper, we present a method to correct errors on both sides by using single nonadditive Entanglement-assisted codeword stabilized quantum error correcting code(EACWS QECC). We use the property that the number of effective error patterns decreases as much as the number of ebits. This property results in a greater number of logical codewords using the same number of physical qubits.

quant-ph

On the relation between a graph code and a graph state

A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a superposition of logical qubits of the related graph code. By using the relation, we first discuss that a local complementation which has been used for a graph state can be useful for searching locally equivalent stabilizer codes, and second provide a method to find a stabilizer group of a graph code.

quant-ph

Fault-tolerant conversion between stabilizer codes by Clifford operations

We propose a scheme that converts a stabilizer code into another stabilizer code in a fault tolerant manner. The scheme first puts both codes in specific forms, and proceeds the conversion from a source code to a target code by applying Clifford gates. The Clifford gates are chosen from the comparisons between both codes. The fault tolerance of the conversion is guaranteed by quantum error correction in every step during the entire conversion process. As examples, we show three conversions: the $[[5,1,3]]$ stabilizer code and Steane code, Steane code and $[[15,1,3]]$ Reed-Muller code, and Steane code and $(3,4)$-QPC code.

quant-ph

General quantum error-correcting code with entanglement based on codeword stabilized quantum code

In this paper, we introduce a unified framework to construct entanglement-assisted quantum error-correcting codes, including additive and nonadditive codes, based on the codeword stabilized framework on subsystems. The codeword stabilized (CWS) framework is a scheme to construct quantum error-correcting codes (QECCs) including both additive and nonadditive codes, and gives a method to construct a QECC from a classical error-correcting code in standard form. Entangled pairs of qubits (ebits) can be used to improve capacity of quantum error correction. In addition, it gives a method to overcome the dual-containing constraint. Operator quantum error correction (OQEC) gives a general framework to construct quantum error-correcting codes. We construct OQEC codes with ebits based on the CWS framework. This new scheme, entanglement-assisted operator codeword stabilized (EAOCWS) quantum codes, is the most general framework we know of to construct both additive and nonadditive codes from classical error-correcting codes. We describe the formalism of our scheme, demonstrate the construction with examples, and give several EAOCWS codes.

quant-ph