quant-phMay 6, 2025

Quantum Feature Space of a Qubit Coupled to a Classical Stochastic Environment

Authors: Chris Wise, Akram Youssry, Alberto Peruzzo, Jo Plested, Matt Woolley

Organizations: School of Systems and Computing, UNSW, Canberra, ACT, 2601, Australia. · Quantum Photonics Laboratory and Centre for Quantum Computation and Communication Technology, RMIT University, Melbourne, VIC, 3000, Australia. · Quandela, Massy, France. · School of Engineering and Technology and Centre for Engineered Quantum Systems, UNSW, Canberra, ACT, 2601, Australia.

Abstract

Qubit control protocols traditionally characterise qubit-environment coupling using resource-intensive pulse sweeps on quantum hardware. Although previous work attempted to reduce this quantum runtime by inferring noise operators, it relied on a complex grey-box approach combining deep neural networks with physics-encoded layers, posing challenges in training and scaling. Here, we introduce a quantum feature space (QFS, denoted F\mathcal{F}) constructed from a single pulse sequence. By engineering F\mathcal{F} to encode qubit-environment dynamics, we eliminate the need for expensive neural networks to learn these physical interactions. This allows us to offload extraction of spectral features to efficient classical machine learning algorithms. Bypassing both the extensive pulse sweeps of traditional quantum noise spectroscopy and the costly neural networks of prior methods, we demonstrate that a simple random forest algorithm on F\mathcal{F} classifies broad noise classes with ∼90%\sim 90\% accuracy under simulated realistic hardware constraints, including pulse jitter and readout errors. Furthermore, Euclidean distance searches over F\mathcal{F} can determine spectral resonances. Focusing on noise classification and identification rather than continuous power spectral density reconstruction makes F\mathcal{F} an efficient diagnostic tool for quantum hardware.

Figures & tables

Explore similar work

Mar 20, 2026

Quantifying Gate Contribution in Quantum Feature Maps for Scalable Circuit Optimization

Quantum machine learning offers promising advantages for classification tasks, but noise, decoherence, and connectivity constraints in current devices continue to limit the efficient execution of feature map-based circuits. Gate Assessment and Threshold Evaluation (GATE) is presented as a circuit optimization methodology that reduces quantum feature maps using a novel gate significance index. This index quantifies the relevance of each gate by combining fidelity, entanglement, and sensitivity. It is formulated for both simulator/emulator environments, where quantum states are accessible, and for real hardware, where these quantities are estimated from measurement results and auxiliary circuits. The approach iteratively scans a threshold range, eliminates low-contribution gates, generates optimized quantum machine learning models, and ranks them based on accuracy, runtime, and a balanced performance criterion before final testing. The methodology is evaluated on real-world classification datasets using two representative quantum machine learning models, PegasosQSVM and Quantum Neural Network, in three execution scenarios: noise-free simulation, noisy emulation derived from an IBM backend, and real IBM quantum hardware. The structural impact of gate removal in feature maps is examined, compatibility with noise-mitigation techniques is studied, and the scalability of index computation is evaluated using approaches based on density matrices, matrix product states, tensor networks, and real-world devices. The results show consistent reductions in circuit size and runtime and, in many cases, preserved or improved predictive accuracy, with the best trade-offs typically occurring at intermediate thresholds rather than in the baseline circuits or in those compressed more aggressively.
Aug 13, 2026

Exponential quantum advantage for learning signals with a single qubit

Quantum technology has the potential to transform scientific discovery, but quantum advantages often require processing capabilities well beyond the reach of experimental platforms. We show that coupling a single controllable qubit to an otherwise conventional sensor can exponentially reduce the number of measurements required to learn classical signals. These rigorous quantum advantages apply to fundamental sensing tasks, including learning Fourier coefficients, extracting temporal correlations from time-varying signals, and estimating transformations of physical observables. Using a superconducting cavity--qubit architecture, we experimentally demonstrate 10710^7-fold reductions in the number of measurements required for Fourier-amplitude and time-varying signal learning. Our quantum feature sensing\textit{quantum feature sensing} algorithms further enable orders-of-magnitude improvements in simulations of weak-signal dark matter detection and wireless communication applications. These quantum advantages are derived from Quantum Phase-Space Inference (QΨΨ), a unifying theory of quantum-enhanced experiments that simultaneously converts a set of experimental objectives and constraints into tight lower bounds and optimal quantum-enhanced learning algorithms while producing a certificate of quantum advantage. QΨΨ extends beyond the regimes captured by quantum Fisher information and provides a framework for systematically identifying rigorous quantum advantages in practical experimental tasks. Together, our results establish that near-term quantum technology can exponentially enhance our ability to learn from classical signals.
Feb 23, 2026

Spectral Phase Encoding for Quantum Kernel Methods

Quantum kernel methods are promising for near-term quantum ma- chine learning, yet their behavior under data corruption remains insuf- ficiently understood. We analyze how quantum feature constructions degrade under controlled additive noise. We introduce Spectral Phase Encoding (SPE), a hybrid construc- tion combining a discrete Fourier transform (DFT) front-end with a diagonal phase-only embedding aligned with the geometry of diagonal quantum maps. Within a unified framework, we compare QK-DFT against alternative quantum variants (QK-PCA, QK-RP) and classi- cal SVM baselines under identical clean-data hyperparameter selection, quantifying robustness via dataset fixed-effects regression with wild cluster bootstrap inference across heterogeneous real-world datasets. Across the quantum family, DFT-based preprocessing yields the smallest degradation rate as noise increases, with statistically sup- ported slope differences relative to PCA and RP. Compared to classical baselines, QK-DFT shows degradation comparable to linear SVM and more stable than RBF SVM under matched tuning. Hardware exper- iments confirm that SPE remains executable and numerically stable for overlap estimation. These results indicate that robustness in quan- tum kernels depends critically on structure-aligned preprocessing and its interaction with diagonal embeddings, supporting a robustness-first perspective for NISQ-era quantum machine learning.