Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Time-series based quantum state discrimination

Samuel Jung, Neel Vora, Akel Hashim, Yilun Xu, Gang Huang

Published Apr 13, 2026• 0 citations
Publisher

Abstract

Abstract Measurement errors in quantum computers are very detrimental to quantum computations. The ability to efficiently and accurately readout quantum states is crucial for quantum error correction schemes and quantum algorithms. Readout fidelity is typically limited by a poor signal-to-noise (SNR) ratio between the quantum states we intend to classify, as well as energy relaxation (e.g., $T_1$ decay) from an excited state to a lower state during readout. Superconducting quantum bits (qubit), one of the leading candidates for scalable quantum computing hardware, are particularly limited by energy relaxation due to their relatively short coherence times. While most approaches for classifying the results of readout on superconducting qubits typically utilize clustering algorithms (e.g., a Gaussian mixture model) on integrated readout signals, these cannot distinguish between a quantum bit that was in the ground state prior to measurement from a qubit that decays to the ground state during measurement. For this reason, we instead propose using machine learning (ML) on the raw (non-integrated) analog signal and classification models on the full time series data (i.e., the \emph{trajectory}). We observe that time series classification methods, such as our chosen long short-term memory (LSTM) model, in combination with filtering and feature engineering techniques, consistently outperform clustering models. In particular, we find that the largest improvements come from reclassifying points in the boundary regions between neighboring clusters. These boundary points correspond to measurement records that deviate from the typical cluster, likely due to transient or noisy features in the signal that are not captured when the data is integrated. By retaining temporal information, sequence-aware models such as LSTMs can better discriminate these trajectories, whereas clustering methods based on integrated values are more prone to misclassifications.

DOI
10.21203/rs.3.rs-9228881/v1

Related papers

Time-series based quantum state discrimination

Samuel Jung, Neel Vora, Akel Hashim +2 more

Accurate quantum state readout is crucial for error correction and algorithms, but measurement errors are detrimental. Readout fidelity is typically limited by a poor signal-to-noise ratio (SNR) and energy relaxation ($T_1$ decay), a significant problem for superconducting qubits. While most approaches classify results using clustering algorithms on integrated readout signals, these methods cannot distinguish a qubit that was initially in the ground state from one that decayed to it during measurement. We instead propose using machine learning (ML) on the raw, non-integrated analog signal. We apply time-series classification models, such as a long short-term memory (LSTM) network, to the full data trajectory. We find that our LSTM model, combined with filtering and feature engineering, consistently outperforms clustering. The largest improvements come from reclassifying points in the boundary regions between clusters. These points correspond to atypical measurement records, likely due to transient or noisy features lost during data integration. By retaining temporal information, sequence-aware models like LSTMs can better discriminate these trajectories, whereas clustering methods based on integrated values are more prone to misclassification.

quant-pharXiv:2601.19057•Jan 28, 2026•0 citations

Machine Learning for Discriminating Quantum Measurement Trajectories and Improving Readout

Easwar Magesan, Jay Gambetta, Antonio D. Corcoles +1 more

Current methods for classifying measurement trajectories in superconducting qubit systems produce fidelities systematically lower than those predicted by experimental parameters. Here, we place current classification methods within the framework of machine learning (ML) algorithms and improve on them by investigating more sophisticated ML approaches. We find that nonlinear algorithms and clustering methods produce significantly higher assignment fidelities that help close the gap to the fidelity possible under ideal noise conditions. Clustering methods group trajectories into natural subsets within the data, which allows for the diagnosis of systematic errors. We find large clusters in the data associated with T1 processes and show these are the main source of discrepancy between our experimental and ideal fidelities. These error diagnosis techniques help provide a path forward to improve qubit measurements.

arXiv:1411.4994•Physical Review Letters•May 18, 2015•128 citations

Qubit Readout Discrimination through Fuzzy Clustering

Giovanni Acampora, Roberto Schiattarella, Autilia Vitiello

Accurate quantum state discrimination is critical for reliable qubit readout in current superconducting quantum processors, as it enables precise measurement outcomes, reduces readout-induced errors, and improves the overall reliability of quantum algorithm execution. Recently, machine learning (ML) techniques have been explored to enhance quantum state discrimination, outperforming traditional methods based on static thresholds. However, these approaches rely on hard-decision schemes that assign binary outcomes without accounting for readout uncertainty, thereby disregarding signal-level variations that can degrade measurement fidelity. This article introduces a measurement-aware classification approach based on Fuzzy C-means (FCM) clustering combined with data filtering, enabling soft-decision readout discrimination through confidence-based shot selection. Experimental validation was conducted on four different real IBM quantum devices, including single- and two-qubit readout scenarios, as well as multi-qubit circuits preparing GHZ and W-state with up to 10 qubits. Results show that the proposed method consistently outperforms state-of-the-art ML-based discriminators in terms of assignment fidelity and state reconstruction accuracy, demonstrating its effectiveness for enhancing readout quality in near-term quantum computing platforms. Quantitatively, the FCM-based discriminator yields 2–3% assignment fidelity improvements in single- and two-qubit readout and statistically significant gains in over 94% of GHZ and 97% of W multi-qubit experiments.

ACM Transactions on Quantum Computing•Oct 3, 2026•0 citations

Real-Time Recurrent Qubit-State Discrimination on a Heterogeneous AI-Engine-FPGA Accelerator

Vu Le, Yilun Xu, Neel Vora +3 more

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.

arXiv:2610.33843•Oct 24, 2026•0 citations

Scaling Qubit Readout with Hardware Efficient Machine Learning Architectures

Satvik Maurya, Chaithanya Naik Mude, William D. Oliver +2 more

Reading a qubit is a fundamental operation in quantum computing. It translates quantum information into classical information enabling subsequent classification to assign the qubit states '0' or '1'. Unfortunately, qubit readout is one of the most error-prone and slowest operations on a superconducting quantum processor. On state-of-the-art superconducting quantum processors, readout errors can range from 1--10%. These errors occur for various reasons - crosstalk, spontaneous state transitions, and excitation caused by the readout pulse. The error-prone nature of readout has resulted in significant research to design better discriminators to achieve higher qubit-readout accuracies. High readout accuracy is essential for enabling high fidelity for near-term noisy quantum computers and error-corrected quantum computers of the future.

arXiv:2212.03895•Proceedings - International Symposium on Computer Architecture/Proceedings•Jun 16, 2023•32 citations

Discriminating Quantum States with Quantum Machine Learning

David Quiroga, Prasanna Date, Raphael C. Pooser

An important use-case for machine learning (ML) is that of determining readout results in quantum computers. In quantum computing (QC), classical ML models are currently being used to discriminate in-phase and quadrature (IQ) signal data to discriminate between quantum states, which is a fundamental QC operation. In our research we propose a Quantum K-Means (QK-Means) clustering technique to discriminate quantum states on the IBM Bogota quantum device, and compare its performance to the K-Means technique (its classical counterpart). We used both algorithms to perform a correlation analysis and probe cross-talk between couples of qubits on the device. We observed that QK-Means obtained test and training scores at par with the classical K-Means, and testing scores that were marginally lower than K-Means when the clusters weren’t visually separable. The training times for QK-Means were observed to be at par with an implementation of the K-Means that was not optimized. In this case, we concluded a weak correlation with a Pearson correlation coefficient of 0.2 on the (1, 2) and (2, 3) qubit couples. After analyzing the training scores, we also conclude that the 1 qubit has the worst performance at readout evidenced by the signal data not being visually separable and the low scores obtained on both clustering algorithms compared to the other qubits. Its poor performance is further verified by the calibration data showing a high readout error of 8,4%. This technique can be used to find correlations present in readout of quantum circuits and to determine cross-talk.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•8 citations
Abstract Measurement errors in quantum computers are very detrimental to quantum computations. The ability to efficiently and accurately readout quantum states is crucial for quantum error correction schemes and quantum algorithms. Readout fidelity is typically limited by a poor signal-to-noise (SNR) ratio between the quantum states we intend to classify, as well as energy relaxation (e.g., T1T_1T1​ decay) from an excited state to a lower state during readout. Superconducting quantum bits (qubit), one of the leading candidates for scalable quantum computing hardware, are particularly limited by energy relaxation due to their relatively short coherence times. While most approaches for classifying the results of readout on superconducting qubits typically utilize clustering algorithms (e.g., a Gaussian mixture model) on integrated readout signals, these cannot distinguish between a quantum bit that was in the ground state prior to measurement from a qubit that decays to the ground state during measurement. For this reason, we instead propose using machine learning (ML) on the raw (non-integrated) analog signal and classification models on the full time series data (i.e., the \emph{trajectory}). We observe that time series classification methods, such as our chosen long short-term memory (LSTM) model, in combination with filtering and feature engineering techniques, consistently outperform clustering models. In particular, we find that the largest improvements come from reclassifying points in the boundary regions between neighboring clusters. These boundary points correspond to measurement records that deviate from the typical cluster, likely due to transient or noisy features in the signal that are not captured when the data is integrated. By retaining temporal information, sequence-aware models such as LSTMs can better discriminate these trajectories, whereas clustering methods based on integrated values are more prone to misclassifications.
Accurate quantum state readout is crucial for error correction and algorithms, but measurement errors are detrimental. Readout fidelity is typically limited by a poor signal-to-noise ratio (SNR) and energy relaxation (T1T_1T1​ decay), a significant problem for superconducting qubits. While most approaches classify results using clustering algorithms on integrated readout signals, these methods cannot distinguish a qubit that was initially in the ground state from one that decayed to it during measurement. We instead propose using machine learning (ML) on the raw, non-integrated analog signal. We apply time-series classification models, such as a long short-term memory (LSTM) network, to the full data trajectory. We find that our LSTM model, combined with filtering and feature engineering, consistently outperforms clustering. The largest improvements come from reclassifying points in the boundary regions between clusters. These points correspond to atypical measurement records, likely due to transient or noisy features lost during data integration. By retaining temporal information, sequence-aware models like LSTMs can better discriminate these trajectories, whereas clustering methods based on integrated values are more prone to misclassification.
Current methods for classifying measurement trajectories in superconducting qubit systems produce fidelities systematically lower than those predicted by experimental parameters. Here, we place current classification methods within the framework of machine learning (ML) algorithms and improve on them by investigating more sophisticated ML approaches. We find that nonlinear algorithms and clustering methods produce significantly higher assignment fidelities that help close the gap to the fidelity possible under ideal noise conditions. Clustering methods group trajectories into natural subsets within the data, which allows for the diagnosis of systematic errors. We find large clusters in the data associated with T1 processes and show these are the main source of discrepancy between our experimental and ideal fidelities. These error diagnosis techniques help provide a path forward to improve qubit measurements.
Accurate quantum state discrimination is critical for reliable qubit readout in current superconducting quantum processors, as it enables precise measurement outcomes, reduces readout-induced errors, and improves the overall reliability of quantum algorithm execution. Recently, machine learning (ML) techniques have been explored to enhance quantum state discrimination, outperforming traditional methods based on static thresholds. However, these approaches rely on hard-decision schemes that assign binary outcomes without accounting for readout uncertainty, thereby disregarding signal-level variations that can degrade measurement fidelity. This article introduces a measurement-aware classification approach based on Fuzzy C-means (FCM) clustering combined with data filtering, enabling soft-decision readout discrimination through confidence-based shot selection. Experimental validation was conducted on four different real IBM quantum devices, including single- and two-qubit readout scenarios, as well as multi-qubit circuits preparing GHZ and W-state with up to 10 qubits. Results show that the proposed method consistently outperforms state-of-the-art ML-based discriminators in terms of assignment fidelity and state reconstruction accuracy, demonstrating its effectiveness for enhancing readout quality in near-term quantum computing platforms. Quantitatively, the FCM-based discriminator yields 2–3% assignment fidelity improvements in single- and two-qubit readout and statistically significant gains in over 94% of GHZ and 97% of W multi-qubit experiments.
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.
Reading a qubit is a fundamental operation in quantum computing. It translates quantum information into classical information enabling subsequent classification to assign the qubit states '0' or '1'. Unfortunately, qubit readout is one of the most error-prone and slowest operations on a superconducting quantum processor. On state-of-the-art superconducting quantum processors, readout errors can range from 1--10%. These errors occur for various reasons - crosstalk, spontaneous state transitions, and excitation caused by the readout pulse. The error-prone nature of readout has resulted in significant research to design better discriminators to achieve higher qubit-readout accuracies. High readout accuracy is essential for enabling high fidelity for near-term noisy quantum computers and error-corrected quantum computers of the future.
An important use-case for machine learning (ML) is that of determining readout results in quantum computers. In quantum computing (QC), classical ML models are currently being used to discriminate in-phase and quadrature (IQ) signal data to discriminate between quantum states, which is a fundamental QC operation. In our research we propose a Quantum K-Means (QK-Means) clustering technique to discriminate quantum states on the IBM Bogota quantum device, and compare its performance to the K-Means technique (its classical counterpart). We used both algorithms to perform a correlation analysis and probe cross-talk between couples of qubits on the device. We observed that QK-Means obtained test and training scores at par with the classical K-Means, and testing scores that were marginally lower than K-Means when the clusters weren’t visually separable. The training times for QK-Means were observed to be at par with an implementation of the K-Means that was not optimized. In this case, we concluded a weak correlation with a Pearson correlation coefficient of 0.2 on the (1, 2) and (2, 3) qubit couples. After analyzing the training scores, we also conclude that the 1 qubit has the worst performance at readout evidenced by the signal data not being visually separable and the low scores obtained on both clustering algorithms compared to the other qubits. Its poor performance is further verified by the calibration data showing a high readout error of 8,4%. This technique can be used to find correlations present in readout of quantum circuits and to determine cross-talk.