arXiv subjects

Marcin Jastrzebski

Publications and source records attributed to Marcin Jastrzebski.

7 recordsLinked to original sources

arXiv2026

Adaptive Relational Learning on Multi-instance Quantum Data with Photonic Processors

Loading multiple quantum states in parallel into a quantum machine learning (QML) model can unlock learning tasks where key information resides in the \emph{relations} between states rather than in individual states. We introduce an adaptive relational learning framework for such multi-instance quantum data that accesses pairwise and higher-order relations. Our model combines global measurements via SWAP or CYCLE tests for evaluating an $n$-state Bargmann invariant with shallow trainable transformations applied locally to each input state. We demonstrate the approach for continuous-variable (CV) photonic systems, which naturally provide access to quantum data and necessary computing operations. We solve tasks involving hidden relationship detection, geometric phase classification, and sensing in the presence of an unknown shared nuisance interaction. We benchmark the adaptive model against a non-adaptive ``measure-first'' approach based on continuous-variable classical shadows, and show that the cost of shadow estimation grows rapidly with $n$, while our model avoids this dependence. Already for $n=2$, we achieve perfect test accuracy $A=1.0$ with $500$ inference shots, improving average test accuracy over the shadow-based method by $ΔA=0.15$ while using $100$ times fewer shots per data point. Our work opens routes to sensing and quantum-data applications where adaptive photonic QML can access relational features that are costly to recover with non-adaptive, measure-first models.

quant-ph↗

arXiv2026

Spectral Bias in Variational Quantum Machine Learning

In this work, we investigate the phenomenon of spectral bias in quantum machine learning, where, in classical settings, models tend to fit low-frequency components of a target function earlier during training than high-frequency ones, demonstrating a frequency-dependent rate of convergence. We study this effect specifically in parameterised quantum circuits (PQCs). Leveraging the established formulation of PQCs as Fourier series, we prove that spectral bias in this setting arises from the ``redundancy'' of the Fourier coefficients, which denotes the number of terms in the analytical form of the model contributing to the same frequency component. The choice of data encoding scheme dictates the degree of redundancy for a Fourier coefficient. We find that the magnitude of the Fourier coefficients' gradients during training strongly correlates with the coefficients' redundancy. We then further demonstrate this empirically with three different encoding schemes. Additionally, we demonstrate that PQCs with greater redundancy exhibit increased robustness to random perturbations in their parameters at the corresponding frequencies. We investigate how design choices affect the ability of PQCs to learn Fourier sums, focusing on parameter initialization scale and entanglement structure, finding large initializations and low-entanglement schemes tend to slow convergence.

quant-ph↗

arXiv2025

LArTPC hit-based topology classification with quantum machine learning and symmetry

We present a new approach to separate track-like and shower-like topologies in liquid argon time projection chamber (LArTPC) experiments for neutrino physics using quantum machine learning. Effective reconstruction of neutrino events in LArTPCs requires accurate and granular information about the energy deposited in the detector. These energy deposits can be viewed as 2-D images. Simulated data from the MicroBooNE experiment and a simple custom dataset are used to perform pixel-level classification of the underlying particle topology. Images of the events have been studied by creating small patches around each pixel to characterise its topology based on its immediate neighbourhood. This classification is achieved using convolution-based learning models, including quantum-enhanced architectures known as quanvolutional neural networks. The quanvolutional networks are extended to symmetries beyond translation. Rotational symmetry has been incorporated into a subset of the models. Quantum-enhanced models perform better than their classical counterparts with a comparable number of parameters but are outperformed by classical models, which contain an order of magnitude more parameters. The inclusion of rotation symmetry appears to benefit only large models and remains to be explored further.

physics.ins-det↗

arXiv2025

To reset, or not to reset -- that is the question

Whether to reset qubits, or not, during quantum error correction experiments is a question of both foundational and practical importance for quantum computing. Text-book quantum error correction demands that qubits are reset after measurement. However, fast qubit reset has proven challenging to execute at high fidelity. Consequently, many cutting-edge quantum error correction experiments are opting for the no-reset approach, where physical reset is not performed. It has recently been postulated that no-reset is functionally equivalent to reset procedures, as well as being faster and easier. For memory experiments, we confirm numerically that resetting provides no benefit. On the other hand, we identify a remarkable difference during logical operations. We find that unconditionally resetting qubits can reduce the duration of fault-tolerant logical operation by up to a factor of two as the number of measurement errors that can be tolerated is doubled. We support this with numerical simulations. However, our simulations also reveal that the no-reset performance is superior if the reset duration and infidelity exceed given thresholds. For example, with the noise model we considered, we find the no-reset performance to be superior when the reset duration is greater than approximately $100$ ns and the physical error probability is greater than approximately $10^{-2.5} \approx 0.003$. Lastly, we introduce two novel syndrome extraction circuits that can reduce the time overhead of no-reset approaches. Our findings provide guidance on how experimentalists should design future experiments.

quant-ph↗

arXiv2024

Unsupervised Beyond-Standard-Model Event Discovery at the LHC with a Novel Quantum Autoencoder

This study explores the potential of unsupervised anomaly detection for identifying physics beyond the Standard Model that may appear at proton collisions at the Large Hadron Collider. We introduce a novel quantum autoencoder circuit ansatz that is specifically designed for this task and demonstrates superior performance compared to previous approaches. To assess its robustness, we evaluate the quantum autoencoder on various types of new physics 'signal' events and varying problem sizes. Additionally, we develop classical autoencoders that outperform previously proposed quantum autoencoders but remain outpaced by the new quantum ansatz, despite its significantly reduced number of trainable parameters. Finally, we investigate the properties of quantum autoencoder circuits, focusing on entanglement and magic. We introduce a novel metric in the context of parameterised quantum circuits, stabilizer 2-Rényi entropy to quantify magic, along with the previously studied Meyer-Wallach measure for entanglement. Intriguingly, both metrics decreased throughout the training process along with the decrease in the loss function. This appears to suggest that models preferentially learn parameters that reduce these metrics. This study highlights the potential utility of quantum autoencoders in searching for physics beyond the Standard Model at the Large Hadron Collider and opens exciting avenues for further research into the role of entanglement and magic in quantum machine learning more generally.

quant-ph↗

arXiv2023

A quantum-enhanced support vector machine for galaxy classification

Galaxy morphology, a key tracer of the evolution of a galaxy's physical structure, has motivated extensive research on machine learning techniques for efficient and accurate galaxy classification. The emergence of quantum computers has generated optimism about the potential for significantly improving the accuracy of such classifications by leveraging the large dimensionality of quantum Hilbert space. This paper presents a quantum-enhanced support vector machine algorithm for classifying galaxies based on their morphology. The algorithm requires the computation of a kernel matrix, a task that is performed on a simulated quantum computer using a quantum circuit conjectured to be intractable on classical computers. The result shows similar performance between classical and quantum-enhanced support vector machine algorithms. For a training size of $40$k, the receiver operating characteristic curve for differentiating ellipticals and spirals has an under-curve area (ROC AUC) of $0.946\pm 0.005$ for both classical and quantum-enhanced algorithms. Additionally, we demonstrate for a small dataset that the performance of a noise-mitigated quantum SVM algorithm on a quantum device is in agreement with simulation. Finally, a necessary condition for achieving a potential quantum advantage is presented. This investigation is among the very first applications of quantum machine learning in astronomy and highlights their potential for further application in this field.

astro-ph.GA↗

arXiv2022

Reconstructing charged particle track segments with a quantum-enhanced support vector machine

Reconstructing the trajectories of charged particles from the collection of hits they leave in the detectors of collider experiments like those at the Large Hadron Collider (LHC) is a challenging combinatorics problem and computationally intensive. The ten-fold increase in the delivered luminosity at the upgraded High Luminosity LHC will result in a very densely populated detector environment. The time taken by conventional techniques for reconstructing particle tracks scales worse than quadratically with track density. Accurately and efficiently assigning the collection of hits left in the tracking detector to the correct particle will be a computational bottleneck and has motivated studying possible alternative approaches. This paper presents a quantum-enhanced machine learning algorithm that uses a support vector machine (SVM) with a quantum-estimated kernel to classify a set of three hits (triplets) as either belonging to or not belonging to the same particle track. The performance of the algorithm is then compared to a fully classical SVM. The quantum algorithm shows an improvement in accuracy versus the classical algorithm for the innermost layers of the detector that are expected to be important for the initial seeding step of track reconstruction.

hep-ex↗