SearcharxivSearch

arXiv subjects

Antoine Brillant

Publications and source records attributed to Antoine Brillant.

4 recordsLinked to original sources

Correlated Coherent Errors in Stabilizer Codes: A General Cumulant Framework and Interference-Based Error Suppression

Coherent errors in stabilizer codes are often correlated across qubits and QEC cycles. Having a general analytical treatment of such noise would thus be extremely valuable. We derive here the exact logical channel induced by repeated QEC cycles under correlated coherent $Z$ noise, and develop a broadly general cumulant-expansion framework that yields a tractable expression for the noise-averaged logical infidelity. Crucially, this expression is non-perturbative in the noise, and applies to arbitrary stabilizer codes and correlation structures. It reveals a feature with no analogue in standard stochastic Pauli error models: the induced channel depends on which stabilizer eigenspace is chosen as the codespace. Exploiting this, we introduce protected stabilizer eigenspace (PROSE) encoding, an error-suppression strategy that selects the optimal codespace. We show that this eigenspace can be efficiently identified in many relevant situations. Further, when combined with logical Pauli twirling, PROSE matches or outperforms standard error suppression techniques (dynamical decoupling, Pauli twirling of physical qubits). We also show that noise correlations, usually assumed to be harmful to QEC, can instead be a resource: with the right encoding, even positive correlations reduce the logical infidelity below the uncorrelated baseline. Our results offer a new, broadly applicable lens on correlated coherent noise in stabilizer codes.

quant-ph

Noise Correlations as a Resource in Pauli-Twirled Circuits

Randomized compiling (RC) is an established tool to tailor arbitrary quantum noise channels into Pauli errors. The effect of both spatial and temporal noise correlations in randomly compiled circuits, however, is not fully understood. Here, we show that for a broad class of correlated Gaussian noise, RC reduces both the strength and temporal range of correlations. For Clifford circuits, we derive a simple analytical expression for the circuit fidelity of randomly compiled circuits. Surprisingly, we show that this fidelity is always increased by the presence of correlations, suggesting that correlations are a resource in randomly compiled circuits. To leading order in system-bath coupling, we also show that RC suppresses the quantum component of bath correlations, implying that one can safely treat weak noise as being classical. Finally, through extensive numerical simulations, we show that our results remain valid for many relevant non-Clifford circuits. These results clarify how RC mitigates memory effects and enhances circuit robustness.

quant-ph

Randomized benchmarking with non-Markovian noise and realistic finite-time gates

We analyze the impact of non-Markovian classical noise on single-qubit randomized benchmarking experiments, in a manner that explicitly models the realization of each gate via realistic finite-duration pulses. Our new framework exploits the random nature of each gate sequence to derive expressions for the full survival probability decay curve which are non-perturbative in the noise strength. In the presence of non-Markovian noise, our approach shows that the decay curve can exhibit a strong dependence on the implementation method, with regimes of both exponential and power law decays. We discuss how these effects can complicate the interpretation of a randomized-benchmarking experiment, but also how to leverage them to probe non-Markovianty.

quant-ph

Orthogonal polynomials and the deformed Jordan plane

We consider the unital associative algebra $\mathcal{A}$ with two generators $\mathcal{X}$, $\mathcal{Z}$ obeying the defining relation $[\mathcal{Z},\mathcal{X}]=\mathcal{Z}^2+Δ$. We construct irreducible tridiagonal representations of $\mathcal{A}$. Depending on the value of the parameter $Δ$, these representations are associated to the Jacobi matrices of the para-Krawtchouk, continuous Hahn, Hahn or Jacobi polynomials.

math.RT