arXiv subjects

Jean-François Van Huele

Publications and source records attributed to Jean-François Van Huele.

3 recordsLinked to original sources

arXiv2026

Threshold Behavior of ZX and ZY Surface Codes Under Circuit-Level Biased and Crosstalk Noise

Studying the threshold behavior of surface codes under biased noise models is an active area of research. Previous work Tuckett et al. (2018), using an optimal tensor-network decoder, demonstrated that replacing $Z$-type stabilizers with $Y$-type stabilizers significantly improves the surface code threshold under code-capacity level dephasing noise. In this work, we construct and study a $ZY$ surface code by replacing the $X$-type stabilizers with $Y$-type stabilizers. We compare it with the standard $ZX$ surface code under circuit-level Pauli-$X$ biased noise, with and without an additional gate-based $XX$ crosstalk noise. We find that for the $ZX$ surface code, the $X$-memory threshold increases monotonically with bias while the $Z$-memory threshold decreases and saturates. For the $ZY$ surface code, the $Y$-memory threshold is nearly constant across all bias values. The $Z$-memory thresholds of the $ZX$ and $ZY$ codes are consistent within the uncertainty. Adding $XX$ crosstalk reduces the $Z$-memory threshold beyond the fitting uncertainty while leaving the $X$ memory threshold largely unaffected. The choice of CNOT ordering redistributes threshold performance between the two logical memories. Our work extends prior observations from code-capacity level noise to circuit-level noise. It also indicates the need for decoders capable of jointly reasoning over correlated syndrome information so that tailored stabilizer structures could be fully utilized for quantum error correction.

quant-ph↗

arXiv2026

Characterizing Entanglement in Combinations of Bell States through Superposition and Mixing: An Increase in Entanglement on Introducing Depolarizing, Phase Damping, and Amplitude Damping Noise

We systematically characterize quantum entanglement in all sixteen combinations of two-qubit Bell states across three operational regimes: pure superposition, noiseless mixing, and asymmetric mixing of one noisy and one pure Bell state. For pure superpositions, we calculate the von Neumann entropy and show that entanglement depends critically on the relative phase phi between superposed states. For mixed states, we use concurrence C under three physically motivated decoherence channels. The Depolarizing (DP) and Phase Damping (PD) channels are modeled as global, collective operations on the two-qubit Hilbert space, while Amplitude Damping (AD) is treated as independent local decay on each qubit, reflecting the asymmetric, energy-dissipating nature of spontaneous emission. A central and counterintuitive result is that increasing noise can raise concurrence in specific parameter regimes across all three channels. We further map the boundary between mathematical entanglement (C > 0) and operational quantum non-locality using the Horodecki criterion, finding this boundary to be strongly channel-dependent. Under Phase Damping, the Bell-local entanglement regime vanishes entirely for identical and same-bases mixtures, meaning any surviving entanglement guarantees a CHSH violation. Under Depolarizing noise, a large Bell-local region requires mixing probability r > 1/sqrt(2) to recover non-locality at maximum noise. For Amplitude Damping, certain mixtures exhibit a non-monotonic Horodecki parameter M(T): concurrence decreases monotonically with noise, yet the capacity for CHSH violation is lost at intermediate noise levels and restored at high noise, as maximal damping repurifies the noisy branch. These results provide a unified analytical reference for entanglement and non-locality management across Bell-state combinations and decoherence channels relevant to NISQ architectures.

quant-ph↗

arXiv2021

Optimizing the Phase Estimation Algorithm Applied to the Quantum Simulation of Heisenberg-Type Hamiltonians

The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles under a Heisenberg Hamiltonian. The evolution is performed through both classical simulations of quantum computers and real quantum computers via IBM's Qiskit platform. We also introduce three optimizations to the algorithm: circular, iterative, and Bayesian. We apply these optimizations to our simulations and investigate how the performance improves. We also discuss the paradigms of iterative and update-based algorithms, which are attributes of these optimizations that can improve quantum algorithms generally.

quant-ph↗