arXiv subjects

Conor Carty

Publications and source records attributed to Conor Carty.

3 recordsLinked to original sources

arXiv2026

Graph Neural Post-selection for Quantum Error Correction

Post-selection improves the logical reliability of quantum computation by rejecting shots which are likely to result in logical failure. We introduce graph neural networks that predict decoder failure without additional decoder executions, using only syndromes, and for high-rate quantum low-density parity-check (qLDPC) codes, existing belief-propagation posteriors. We evaluate rotated surface and bivariate bicycle (BB) code memories under uniform depolarising circuit-level noise. Retaining 90% of shots gives approximately 3700x and 740x reductions in logical error rates for [[72,12,6]] and [[144,12,12]] BB codes at realistic physical error rates. For the distance 5 surface code at physical noise p=0.003, our neural post-selector achieves logical error suppression comparable to the leading complementary gap method without running the decoder.

quant-ph↗

arXiv2026

Bayesian Optimization for Quantum Error-Correcting Code Discovery

Quantum error-correcting codes protect fragile quantum information by encoding it redundantly, but identifying codes that perform well in practice with minimal overhead remains difficult due to the combinatorial search space and the high cost of logical error rate evaluation. We propose a Bayesian optimization framework to discover quantum error-correcting codes that improves data efficiency and scalability with respect to previous machine learning approaches to this task. Our main contribution is a multi-view chain-complex neural embedding that allows us to predict the logical error rate of quantum LDPC codes without performing expensive simulations. Using bivariate bicycle codes and code capacity noise as a testbed, our algorithm discovers a high-rate code [[144,36]] that achieves competitive per-qubit error rate compared to the gross code, as well as a low-error code [[144,16]] that outperforms the gross code in terms of error rate per qubit. These results highlight the ability of our pipeline to automatically discover codes balancing rate and noise suppression, while the generality of the framework enables application across diverse code families, decoders, and noise models.

quant-ph↗

arXiv2024

Asymptotic synchronization of Kuramoto oscillators with time delay and non-universal interaction

We study the emergence of synchronization in the Kuramoto model on a digraph in the presence of time delays. Assuming the digraph is strongly connected, we first establish a uniform bound on the phase diameter and subsequently prove the asymptotic frequency synchronization of the oscillators under suitable assumptions on the initial configurations. In the case of an all-to-all connection, we obtain an exponential synchronization estimate. Additionally, we present numerical simulations, providing further insights into the synchronization and oscillatory behaviors of the oscillator frequencies depending on the network structure and the magnitude of the time delay.

math.OC↗