Metraipolis › archive › dc_dbbe841bd7b8

Real-Time Recurrent Qubit-State Discrimination on a Heterogeneous AI-Engine-FPGA Accelerator — arXiv:2610.33843

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.33843
License (as archived)
CC0-1.0
Archived
2026-10-27T08:15:30.612Z
SHA-256 of the archived text
9b5bef63083c7e9c6b015aecc428f509d4eb0fd80d691452d4567dd2d069fdf2
Stable URL of this page
https://metraipolis.com/documento/dc_dbbe841bd7b8

How to cite

Real-Time Recurrent Qubit-State Discrimination on a Heterogeneous AI-Engine-FPGA Accelerator — arXiv:2610.33843 — arXiv (en), https://arxiv.org/abs/2610.33843 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dbbe841bd7b8 (Metraipolis archive dc_dbbe841bd7b8, sha256 9b5bef63083c7e9c6b015aecc428f509d4eb0fd80d691452d4567dd2d069fdf2)
BibTeX
@misc{dcdbbe841bd7b8,
  title = {Real-Time Recurrent Qubit-State Discrimination on a Heterogeneous AI-Engine-FPGA Accelerator — arXiv:2610.33843},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.33843},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dbbe841bd7b8; sha256 9b5bef63083c7e9c6b015aecc428f509d4eb0fd80d691452d4567dd2d069fdf2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.33843. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Qubit readout, or qubit state discrimination, remains one of the slowest and most error-prone operations in superconducting quantum processors, making fast, accurate, and hardware-efficient classification essential for scalable quantum computing. Conventional discriminators integrate the I/Q record into a single point, discarding evidence a relaxing qubit leaves behind; full-resolution feed-forward classifiers recover it but are too costly to deploy under this constraint. Recurrent classifiers retain full resolution far more cheaply, but their loop-carried hidden state cannot fit a single AI Engine (AIE) tile's register capacity and spills to data memory, adding latency that grows with sequence length. We present a hardware-aware LSTM accelerator for an AMD Versal device that resolves this by partitioning at the dependency boundary - independent input projections on the AIE array, the loop-carried update in programmable logic (PL) - keeping pace with a 64 ns input cadence under a 1,000 ns budget. On the qubit affected by mid-readout state transitions, our design matches a full-resolution feed-forward network's accuracy (96.59% vs. 96.37%) using 403x fewer parameters and roughly 103x fewer DSPs while cutting relative error by 68.2% over GMM, 43.6% over QubiCML, and 16.82% over MF-NN. Using 4 out of 400 AIE tiles and 17 DSP58, it needs 2.2-8.2x fewer DSP58 blocks than QubiCML and MF-NN, and the AIE-PL partition cuts exposed tail latency by 60.3% versus a pure-AIE mapping and DSP58 usage 31.1x versus an all-PL implementation. Across eight qubits, a compact variant reaches 96.78% mean accuracy, the strongest hardware-deployed operating point. Temporal resolution and recurrent-state placement must then be treated jointly when designing low-latency quantum readout accelerators.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.AR, nuovi lavori del giorno).
Categorie arXiv: Hardware Architecture (cs.AR).
Pagina del lavoro: https://arxiv.org/abs/2610.33843 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-27T07:56:30.121Z dalla pagina https://arxiv.org/list/cs.AR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).