activity
20212026
most citedDecoding algorithms for surface codes

54 citations · 137 across the 25 of their papers we have counts for

collaborators

25 papers

quant-ph2026

A quantum generative model for in silico clinical trials using scarce training datasets

Olatz Sanz Larrarte, Reza Dastbasteh, Roberto Sanchez-Navarro +7

In silico methods have emerged as a strategy to complement clinical trials. These are particularly relevant for rare or heterogeneous diseases for which traditional methods are cos…

quant-ph2026

Quantum Codes with Arbitrary Z-Rotation logical Gates and Applications to Fault-Tolerant Code Switching

Reza Dastbasteh, Ruben M. Otxoa, Pedro M. Crespo +1

A technique for realizing a universal set of fault-tolerant quantum operations is the code switching method, which leverages two quantum codes with complementary sets of transversa…

quant-ph2026

Surface-Code Thresholds and Qubit Footprints in Shuttling-Based Spin-Qubit Railways

Arun John Moncy, Reza Dastbasteh, Josu Etxezarreta Martinez +5

We present a fault-tolerant mapping of rotated surface codes onto a silicon spin-qubit railway architecture, utilizing electron shuttling to resolve the wiring fan-out…

quant-ph2026

Noise mitigation of quantum observables via learning from Hamiltonian symmetry decays

Javier Oliva del Moral, Olatz Sanz Larrarte, Joana Fraxanet +2

We present a new quantum error mitigation technique (QEM), called GUiding Extrapolations from Symmetry decayS (GUESS), which exploits Hamiltonian symmetries to improve accuracy of…

quant-ph2025

Forecasting Quantum Observables: A Compressed Sensing Approach with Performance Guarantees

Víctor Valls, Albert Akhriev, Olatz Sanz Larrarte +5

Data-driven extrapolation methods aim to extend the dynamics of quantum observables from measurements, but they often lack guarantees on prediction accuracy. We introduce a framewo…

cs.IT2025

Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors

Reza Dastbasteh, Olatz Sanz Larrarte, Arun John Moncy +3

We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing…