Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Pedro M. Crespo has a total of 128 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Leveraging biased noise for more efficient quantum error correction at the circuit level with two-level qubits

    by Josu Etxezarreta Martinez, Paul Schnabl, Javier Oliva del Moral, Reza Dastbasteh, Pedro M. Crespo, Ruben M. Otxoa

    Tailoring quantum-error-correction codes (QECCs) to biased noise has demonstrated significant benefits. However, most of the prior research on this topic has focused on code-capacity noise models. Furthermore, a no-go theorem prevents the construction of controlled- () gates for two-level qubits in a bias-preserving manner which may, in principle, imply that noise bias cannot be leveraged in such systems. In this work, we show that a residual bias up to η ∼ 5 can be maintained in gates under certain conditions. Moreover, we employ controlled- () gates in syndrome-extraction circuits and show how to natively implement these in a bias-preserving manner for a broad class of qubit platforms. This motivates the introduction of what we call a (HBD) circuit-level noise model that captures these features. We numerically study the performance of the X Z Z X surface code and observe that bias-preserving gates are critical for leveraging biased noise. Accounting for the residual bias present in the gates, we observe an increase in the code threshold up to a 1.27 % physical error rate, representing a 90 % improvement. Additionally, we find that the required qubit footprint can be reduced by up to 75 % at relevant physical error rates.


  • An infinite class of quantum codes derived from duadic constacyclic codes

    by Reza Dastbasteh, Josu Etxezarreta Martinez, Andrew Nemec, Antonio Demarti Iolius, Pedro Crespo Bofill


  • Quantum CSS Duadic and Triadic Codes: New Insights and Properties

    by Reza Dastbasteh, Olatz Sanz Larrarte, Josu Etxezarreta Martinez, Antonio Demarti Iolius, Javier Oliva del Moral, Pedro Crespo Bofill


  • Equivalence of constacyclic codes with shift constants of different orders

    by Reza Dastbasteh, Farzad Padashnick, Pedro M. Crespo, Markus Grassl, Javad Sharafi


  • Top Cited Papers
    Open Access

    Decoding algorithms for surface codes

    by Antonio Demarti Iolius, Patricio Fuentes, Román Orús, Pedro M. Crespo, Josu Etxezarreta Martinez

    Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone to errors. For this reason, quantum error correction is an invaluable tool to make quantum information reliable and enable the ultimate goal of fault-tolerant quantum computing. Surface codes currently stand as the most promising candidates to build near term error corrected qubits given their two-dimensional architecture, the requirement of only local operations, and high tolerance to quantum noise. Decoding algorithms are an integral component of any error correction scheme, as they are tasked with producing accurate estimates of the errors that affect quantum information, so that they can subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. This poses a connundrum, where decoding performance is improved at the expense of complexity and viceversa. In this review, a thorough discussion of state-of-the-art decoding algorithms for surface codes is provided. The target audience of this work are both readers with an introductory understanding of the field as well as those seeking to further their knowledge of the decoding paradigm of surface codes. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results. In addition, both the decoding performance, in terms of error correction capability, and decoding complexity, are compared. A review of the existing software tools regarding surface codes decoding is also provided.


  • Open Access

    Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective

    by Javier Oliva del Moral, Antonio Demarti Iolius, Gerard Vidal, Pedro M. Crespo, Josu Etxezarreta Martinez

    The machinery of industrial environments was connected to the Internet years ago with the scope of increasing their performance. However, this change made such environments vulnerable against cyber-attacks that can compromise their correct functioning resulting in economic or social problems. Moreover, implementing cryptosystems in the communications between operational technology (OT) devices is a more challenging task than for information technology (IT) environments since the OT networks are generally composed of legacy elements, characterized by low-computational capabilities. Consequently, implementing cryptosystems in industrial communication networks faces a tradeoff between the security of the communications and the amortization of the industrial infrastructure. Critical infrastructure (CI) refers to the industries which provide key resources for the daily social and economical development, e.g., electricity. Furthermore, a new threat to cybersecurity has arisen with the theoretical proposal of quantum computers, due to their potential ability of breaking state-of-the-art cryptography protocols, such as RSA or elliptic curve cryptography. Many global agents have become aware that transitioning their secure communications to a quantum secure paradigm is a priority that should be established before the arrival of fault-tolerance. In this article, we aim to describe the problematic of implementing post-quantum cryptography (PQC) to CI environments. For doing so, we describe the requirements for these scenarios and how they differ against IT. We also introduce classical cryptography and how quantum computers pose a threat to such security protocols. Furthermore, we introduce state-of-the-art proposals of PQC protocols and present their characteristics. We conclude by discussing the problematic of integrating PQC in industrial environments.


  • Open Access

    Equivalence of constacyclic codes with shift constants of different orders

    by Reza Dastbasteh, Farzad Padashnick, Pedro M. Crespo, Markus Grassl, Javad Sharafi

    Let $a$ and $b$ be two non-zero elements of a finite field $\mathbb{F}_q$, where $q>2$. It has been shown that if $a$ and $b$ have the same multiplicative order in $\mathbb{F}_q$, then the families of $a$-constacyclic and $b$-constacyclic codes over $\mathbb{F}_q$ are monomially equivalent. In this paper, we investigate the monomial equivalence of $a$-constacyclic and $b$-constacyclic codes when $a$ and $b$ have distinct multiplicative orders. We present novel conditions for establishing monomial equivalence in such constacyclic codes, surpassing previous methods of determining monomially equivalent constacyclic and cyclic codes. As an application, we use these results to search for new linear codes more systematically. In particular, we present more than $70$ new record-breaking linear codes over various finite fields, as well as new binary quantum codes.

  • Open Access

    Multiqubit time-varying quantum channels for NISQ-era superconducting quantum processors

    by Josu Etxezarreta Martinez, Patricio Fuentes, Antonio Demarti Iolius, Javier Garcia-Frias, Javier Rodríguez Fonollosa, Pedro M. Crespo

    Time-varying quantum channels (TVQCs) have been proposed as a model to include fluctuations of the relaxation (T1) and dephasing times (T2). In previous works, realizations of multiqubit TVQCs have been assumed to be equal for all the qubits of an error correction block, implying that the random variables that describe the fluctuations of T1 and T2 are block-to-block uncorrelated but qubit-wise perfectly correlated for the same block. In this article, we perform a correlation analysis of the fluctuations of the relaxation times of five multiqubit quantum processors. Our results show that it is reasonable to assume that the fluctuations of the relaxation and dephasing times of superconducting qubits are local to each of the qubits of the system. Based on these results, we discuss the multiqubit TVQCs when the fluctuations of the decoherence parameters for an error correction block are qubit-wise uncorrelated (as well as from block-to-block), a scenario we have named the fast time-varying quantum channel (FTVQC). Furthermore, we lower-bound the quantum capacity of general FTVQCs based on a quantity we refer to as the ergodic quantum capacity. Finally, we use numerical simulations to study the performance of quantum error correction codes when they operate over FTVQCs.


  • Open Access

    Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors

    by Josu Etxezarreta Martinez, Patricio Fuentes, Antonio Demarti Iolius, Javier Garcia-Frías, Javier Rodríguez Fonollosa, Pedro M. Crespo

    Recent experimental studies have shown that the relaxation time ($T_1$) and the dephasing time ($T_2$) of superconducting qubits fluctuate considerably over time. To appropriately consider this time-varying nature of the $T_1$ and $T_2$ parameters, a new class of quantum channels, known as Time-Varying Quantum Channels (TVQCs), has been proposed. In previous works, realizations of multi-qubit TVQCs have been assumed to be equal for all the qubits of an error correction block, implying that the random variables that describe the fluctuations of $T_1$ and $T_2$ are block-to-block uncorrelated, but qubit-wise perfectly correlated for the same block. Physically, the fluctuations of these decoherence parameters are explained by the incoherent coupling of the qubits with unstable near-resonant two-level-systems (TLS), which indicates that such variations may be local to each of the qubits of the system. In this article, we perform a correlation analysis of the fluctuations of the relaxation times of multi-qubit quantum processors ibmq\_quito, ibmq\_belem, ibmq\_lima, ibmq\_santiago and ibmq\_bogota. Our results show that it is reasonable to assume that the fluctuations of the relaxation and dephasing times of superconducting qubits are local to each of the qubits of the system. Based on these results, we discuss the multi-qubit TVQCs when the fluctuations of the decoherence parameters for an error correction block are qubit-wise uncorrelated (as well as from block-to-block), a scenario we have named the Fast Time-Varying Quantum Channel (FTVQC). Furthermore, we lower bound the quantum capacity of general FTVQCs based on a quantity we refer to as the ergodic quantum capacity. Finally, we use numerical simulations to study the performance of quantum error correction codes (QECC) when they operate over FTVQCs.


  • Open Access

    On the Logical Error Rate of Sparse Quantum Codes

    by Patricio Fuentes, Josu Etxezarreta Martinez, Pedro M. Crespo, Javier Garcia-Frias

    The quantum paradigm presents a phenomenon known as degeneracy that can potentially improve the performance of quantum error correcting codes. However, the effects of this mechanism are sometimes ignored when evaluating the performance of sparse quantum codes and the logical error rate is not always correctly reported. In this article, we discuss previously existing methods to compute the logical error rate and we present an efficient coset-based method inspired by classical coding strategies to estimate degenerate errors and distinguish them from logical errors. Additionally, we show that the proposed method presents a computational advantage for the family of Calderbank–Shor–Steane codes. We use this method to prove that degenerate errors are frequent in a specific family of sparse quantum codes, which stresses the importance of accurately reporting their performance. Our results also reveal that the modified decoding strategies proposed in the literature are an important tool to improve the performance of sparse quantum codes.