A hardware-aware LSTM accelerator is designed to improve qubit readout in superconducting quantum processors.
This paper presents a novel hardware-aware LSTM accelerator design that outperforms existing methods in qubit readout accuracy and latency.
Before reading this…
Applications
To understand this paper, make sure you know these concepts first:
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.
Evolving Hybrid Quantum-Classical Architectures for Image Classification
This paper uses an evolutionary framework to automate the discovery of quantum c…
Clifford synthesis is NP-complete
The paper proves that synthesizing a quantum circuit for a given Clifford operat…
Discovering state-of-the-art quantum circuits with large language models
This paper introduces an evolutionary framework for optimizing quantum algorithm…
Concrete Functions in Private Simultaneous Quantum Messages: Quantum Advantages and Structural Limit…
This paper investigates the communication complexity of private simultaneous qua…
Quantum Broker: QoS-Aware Distribution of Quantum Computations
The paper presents a framework for managing the execution of quantum circuits on…
STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization
This paper proposes a spatial-temporal post-training quantization framework for…
ConQUESTA: Topology-Aware Post-Training Structural Pruning of Quantum Neural Networks
ConQUESTA is a post-training pruning framework that reduces two-qubit gates, SWA…
Supervised Learning with Quantum Hamiltonian Embeddings
This paper introduces a new framework for quantum machine learning called quantu…