Searcharxiv⌕ Search

arXiv subjects

Ivan Basov

Publications and source records attributed to Ivan Basov.

2 recordsLinked to original sources

TCBP-JOBS: GPU-Accelerated Quantum Error Correction Decoding and Noise Learning with Near-Optimal Accuracy

Achieving near-optimal quantum error correction (QEC) decoding accuracy often requires computationally expensive searches that limit both large-scale simulation and real-time operation. We introduce trajectory-calibrated belief propagation (TCBP), which learns calibrated fault probabilities from BP trajectories, and jittered OSD beam search (JOBS), which uses these probabilities to guide parallel GPU searches. Across surface, color and bivariate-bicycle code memory and surgery circuits, TCBP-JOBS achieves logical error rates comparable to those of the Tesseract most-likely-error decoder at physical error rates of 0.1% to 0.4%, and up to 4.5$\times$ lower on the largest codes. Serial speedups over Tesseract's sparsified presets range from 10$\times$ to 7,400$\times$, and against unsparsified long-beam Tesseract they reach 13,000$\times$ on the bivariate-bicycle codes, at logical error rate ratios of 0.97 to 1.57. At lower physical error rates ($10^{-4}$ to $5\times10^{-4}$), rare-event splitting on the gross code shows that Tesseract is more accurate. Batched execution accelerates offline simulation for rapid, efficient exploration of large-scale QEC design spaces. For QPUs with longer logical clock cycles, our serial memory and logical-surgery experiments demonstrate accuracy comparable to Tesseract while meeting the millisecond-scale latency requirements of online feed-forward operation. Beyond memory and logic decoding, we demonstrate using TCBP-JOBS for confidence scores for postselection in memory and magic-state cultivation, enabling end-to-end color code cultivation. Together, these methods provide a GPU framework for accelerating QEC research via accurate decoding, noise estimation, and confidence assessment.

quant-ph↗

Fault-tolerant quantum computation with a neutral atom processor

Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, which can be detected by imaging. Full connectivity is enabled by atom movement. We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates. In both cases, "erasure conversion," changing errors into a form that can be detected independently from qubit state, improves circuit performance. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor.

quant-ph↗