Optimal-recovery ambiguity under truncated amplitude-damping models investigates a structural limitation of noise-adapted quantum error correction: a recovery optimized for a truncated noise model need not be uniquely determined with respect to its performance under the full physical channel.The work develops a geometric identifiability criterion for optimal quantum recoveries formulated as completely positive trace-preserving optimization problems in Choi form. It characterizes when the full-channel objective is constant across an optimal face of the truncated-design problem and when different equally optimal recoveries can instead produce different full-channel fidelities.The main application is the nine-qubit Shor code under canonical product amplitude-damping noise, with recovery models truncated by Kraus weight. For syndrome-structured recoveries, the study certifies nonzero full-channel fidelity intervals for truncation weights 1 through 5 and establishes their leading scaling with damping strength.For truncation weights 1 and 2, pairwise orthogonality of the retained encoded error ranges yields an exact syndrome-sufficiency result. The structured and unrestricted truncated-design optima coincide for all damping strengths between 0 and 1, showing that the observed recovery ambiguity is not caused by imposing the syndrome-block architecture in these cases.For truncation weight 3, the retained error ranges are no longer pairwise orthogonal. The exact unrestricted optimal-face diameter remains open, but dense unrestricted Choi witnesses at damping strength 0.05 reproduce 99.4202 percent of the corresponding structured full-channel separation while remaining close to the truncated-design optimum.The accompanying QER-FaceScan v2.7 reproducibility archive contains the manuscript source, numerical results, verification scripts, solver audits, structured-width certificates, unrestricted recovery witnesses, dual data, Petz and exact-support checks, and SHA-256 integrity manifests. Large Hermitian Choi matrices are stored using an exact lossless packed representation and are reconstructed by the supplied verification tools without reduced precision or lossy approximation.Related four-qubit calibration results and supporting code are available in the companion ALM-QEC archive: DOI 10.6084/m9.figshare.32080845.
Optimal-recovery ambiguity under truncated amplitude-damping models investigates a structural limitation of noise-adapted quantum error correction: a recovery optimized for a truncated noise model need not be uniquely determined with respect to its performance under the full physical channel.The work develops a geometric identifiability criterion for optimal quantum recoveries formulated as completely positive trace-preserving optimization problems in Choi form. It characterizes when the full-channel objective is constant across an optimal face of the truncated-design problem and when different equally optimal recoveries can instead produce different full-channel fidelities.The main application is the nine-qubit Shor code under canonical product amplitude-damping noise, with recovery models truncated by Kraus weight. For syndrome-structured recoveries, the study certifies nonzero full-channel fidelity intervals for truncation weights 1 through 5 and establishes their leading scaling with damping strength.For truncation weights 1 and 2, pairwise orthogonality of the retained encoded error ranges yields an exact syndrome-sufficiency result. The structured and unrestricted truncated-design optima coincide for all damping strengths between 0 and 1, showing that the observed recovery ambiguity is not caused by imposing the syndrome-block architecture in these cases.For truncation weight 3, the retained error ranges are no longer pairwise orthogonal. The exact unrestricted optimal-face diameter remains open, but dense unrestricted Choi witnesses at damping strength 0.05 reproduce 99.4202 percent of the corresponding structured full-channel separation while remaining close to the truncated-design optimum.The accompanying QER-FaceScan v2.7 reproducibility archive contains the manuscript source, numerical results, verification scripts, solver audits, structured-width certificates, unrestricted recovery witnesses, dual data, Petz and exact-support checks, and SHA-256 integrity manifests. Large Hermitian Choi matrices are stored using an exact lossless packed representation and are reconstructed by the supplied verification tools without reduced precision or lossy approximation.Related four-qubit calibration results and supporting code are available in the companion ALM-QEC archive: DOI 10.6084/m9.figshare.32080845.
How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.
Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.
Quantum error correction (QEC) is an essential concept for any quantum information processing device. Typically, QEC is designed with minimal assumptions about the noise process; this generic assumption exacts a high cost in efficiency and performance. In physical systems, errors are not likely to be arbitrary; rather we will have reasonable models for the structure of quantum decoherence. We may choose quantum error correcting codes and recovery operations that specifically target the most likely errors. We present a convex optimization method to determine the optimal (in terms of average entanglement fidelity) recovery operation for a given channel, encoding, and information source. This is solvable via a semidefinite program (SDP). We present computational algorithms to generate near-optimal recovery operations structured to begin with a projective syndrome measurement. These structured operations are more computationally scalable than the SDP required for computing the optimal; we can thus numerically analyze longer codes. Using Lagrange duality, we bound the performance of the structured recovery operations and show that they are nearly optimal in many relevant cases. We present two classes of channel-adapted quantum error correcting codes specifically designed for the amplitude damping channel. These have significantly higher rates with shorter block lengths than corresponding generic quantum error correcting codes. Both classes are stabilizer codes, and have good fidelity performance with stabilizer recovery operations. The encoding, syndrome measurement, and syndrome recovery operations can all be implemented with Clifford group operations.
Quantum error correction (QEC) plays a critical role in preventing information loss in quantum systems and provides a framework for reliable quantum computation. Identifying quantum codes with nice code parameters for physically motivated noise models remains an interesting challenge. While past work has primarily focused on qubit codes, here we identify a [4,1] qudit error correcting code tailored to protect against amplitude-damping noise. We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors up to the leading order in the damping parameter $\ensuremath{\gamma}$. We devise a protocol to extract syndromes that unambiguously identify this set of errors, leading to a noise-adapted recovery scheme that achieves a fidelity loss of $O({\ensuremath{\gamma}}^{2})$. For the d=2 case, our QEC scheme is identical to the known example of the four-qubit code and the associated syndrome-based recovery. We also assess the performance of this code using the Petz recovery map and note some interesting deviations from the qubit case. Finally, we generalize this construction to a family of [2M+2,M] qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.
Quantum error correction (QEC) is essential for reliable quantum information processing. Targeting a particular error channel, both the encoding and the recovery channel can be optimized through a biconvex optimization to give a high-performance, noise-adapted QEC scheme. We solve the biconvex optimization by the technique of alternating semi-definite programming and identify a new four-qubit code for amplitude damping channel, one major noise in superconducting circuits and a good model for spontaneous emission and energy dissipation. We also construct analytical encoding and recovery channels that are close to the numerically optimized ones. We show that the new code notably outperforms the Leung-Nielsen-Chuang-Yamamoto four-qubit code in terms of the entanglement fidelity over an amplitude damping channel.
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent X rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching 1/2 relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below 1/2, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's X distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.