collaborators

7 papers

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

Impact of leakage on the dynamics of a ST qubit implemented in a Double Quantum Dot device

Javier Oliva del Moral, Olatz Sanz Larrarte, Reza Dastbasteh +2

Spin qubits in quantum dots are a promising technology for quantum computing due to their fast response time and long coherence times. An electromagnetic pulse is applied to the sy…

q-bio.MN2025

Tensor Network based Gene Regulatory Network Inference for Single-Cell Transcriptomic Data

Olatz Sanz Larrarte, Borja Aizpurua, Reza Dastbasteh +2

Deciphering complex gene-gene interactions remains challenging in transcriptomics as traditional methods often miss higher-order and nonlinear dependencies. This study introduces a…

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…

quant-ph2025

Asymptotically good CSS-T codes and a new construction of triorthogonal codes

Elena Berardini, Reza Dastbasteh, Josu Etxezarreta Martinez +2

We propose a new systematic construction of CSS-T codes from any given CSS code using a map . When is the identity map , we retrieve the construction of [1] and use it…