Michele Pacenti

Michele Pacenti

Auto-generated profile, based on publicly available information

Michele Pacenti

Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA, 85721

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 January 2024 in IEEE Communications Letters
Verified
Journal Article
Closed access
DCDimitris Chytas
Dimitris Chytas
MPMichele Pacenti
Michele Pacenti
NRNithin Raveendran
Nithin Raveendran
MFMark F. Flanagan
Mark F. Flanagan
BVBane Vasic
Bane Vasic
In this letter, we propose a novel iterative decoding algorithm that exploits the degenerate nature of three different families of quantum low-density parity-check codes, i.e., surface, toric, and row-degree-4 bicycle codes. Such families of codes share harmful trapping sets that constitute symmetric stabilizers, making it impossible for any parallel-scheduled iterative message-passing decoder to converge even for error patterns of weight as low as two. By biasing subsets of nodes in the symmetric stabilizers, the decoder is able to converge to a valid error pattern. Furthermore, the proposed decoder has low decoding complexity - linear in the code’s blocklength - and a fully parallel schedule, making it suitable for low-latency efficient implementation.

3 September 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MPMichele Pacenti
Michele Pacenti
MFMark F. Flanagan
Mark F. Flanagan
DCDimitris Chytas
Dimitris Chytas
BVBane Vasic
Bane Vasic
Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation due to their robustness against errors and their local interactions between qubits. However, decoding these codes efficiently remains a challenge: existing decoders often fall short of meeting requirements such as having low computational complexity (ideally linear in the code’s blocklength), low decoding latency, and low power consumption. In this paper we propose a novel bit-flipping (BF) decoder tailored for toric and surface codes. We introduce the proximity vector as a heuristic metric for flipping bits, and we develop a new subroutine for correcting degenerate multiple errors on adjacent qubits. Our algorithm has quadratic complexity growth and it can be efficiently implemented as it does not require operations on dynamic memories, as do state-of-art decoding algorithms such as minimum weight perfect matching or union find. The proposed decoder shows a decoding threshold of 7.5% for the 2D toric code and 7% for the rotated planar code over the binary symmetric channel.

12 May 2026 in Quantum
Verified
Journal Article
Open access
MPMichele Pacenti
Michele Pacenti
DCDimitris Chytas
Dimitris Chytas
BVBane Vasic
Bane Vasic
Quantum low-density parity-check codes are a promising approach to fault-tolerant quantum computation, offering potential advantages in rate and decoding efficiency. In this work, we introduce quantum Margulis codes, a new class of QLDPC codes derived from Margulis' classical LDPC construction via the two-block group algebra framework. We show that quantum Margulis codes, unlike bivariate bicycle codes which require ordered statistics decoding for effective error correction, can be efficiently decoded using a standard min-sum decoder with linear complexity, when decoded under the code capacity noise model. This is attributed to their Tanner graph structure, which does not exhibit group symmetry, thereby mitigating the well-known problem of error degeneracy in QLDPC decoding. To further enhance performance, we propose an algorithm for constructing 2BGA codes with controlled girth, ensuring a minimum girth of 6 or 8, and use it to generate several quantum Margulis codes of length 240 and 642. We validate our approach through numerical simulations, demonstrating that quantum Margulis codes behave significantly better than BB codes in the error floor region, under min-sum decoding.

1 December 2025 in IEEE BITS the Information Theory Magazine
Verified
Journal Article
Closed access
BVBane Vasic
Bane Vasic
VSValentin Savin
Valentin Savin
MPMichele Pacenti
Michele Pacenti
SBShantom Borah
Shantom Borah
NRNithin Raveendran
Nithin Raveendran

22 January 2026 in IEEE Internet Computing
Verified
Journal Article
Closed access
APAshlesha Patil
Ashlesha Patil
MPMichele Pacenti
Michele Pacenti
BVBane Vasic
Bane Vasic
SGSaikat Guha
Saikat Guha
NRNarayanan Rengaswamy
Narayanan Rengaswamy
Bell-state measurement (BSM) on entangled states shared between quantum repeaters is the fundamental operation used to route entanglement in quantum networks. Performing BSMs on Werner states shared between repeaters leads to exponential decay in the fidelity of the end-to-end Werner state with the number of repeaters, necessitating entanglement distillation. In this work, we use quantum error correcting codes for deterministic entanglement distillation to route Werner states on a chain of repeaters. To maximize the end-to-end distillable entanglement, we utilize global link-state knowledge to determine the optimal policy for scheduling distillation and BSMs at the repeaters. We observe that low-rate codes produce high-fidelity end-to-end states owing to their excellent error-correcting capability, whereas high-rate codes yield a larger number of end-to-end states but of lower fidelity. The number of quantum memories used at repeaters increases with the code rate as well as the classical computation time of the decoder.