SearcharxivSearch

arXiv subjects

Simon Williams

Publications and source records attributed to Simon Williams.

15 recordsLinked to original sources

Robust Quantum Machine Learning for Collider Event Selection under Detector Variability

Robust machine-learning methods are becoming increasingly important for high-energy physics data analysis as experiments enter the era of higher luminosity and future higher-energy colliders. Detector degradation, changing running conditions and calibration drift can shift data distributions, causing models trained on clean reference samples to degrade after deployment. We investigate whether parameterised quantum models provide a useful inductive bias for robust collider-event selection in two complementary settings. In the unsupervised study, quantum autoencoders trained on background events are compared with classical and variational autoencoders for anomaly detection. In the supervised study, quantum classifiers with data reuploading are trained to distinguish a supersymmetric signal from background and are compared with linear and multilayer-perceptron classifiers. All models are trained under reference conditions and subsequently evaluated under controlled feature-level smearing while their parameters and preprocessing transformations are held fixed. On clean inputs, the quantum autoencoders achieve competitive anomaly-detection performance, including in the low-false-positive-rate regime relevant for triggering, while the deeper data-reuploading classifier attains discrimination comparable to the non-linear classical baseline. Under smearing, the quantum models generally exhibit smaller shifts in their output scores and retain their discrimination more effectively than the expressive classical baselines. These results suggest that parameterised quantum models can provide a useful robustness inductive bias for collider-event selection and motivate further studies with realistic detector systematics, finite-shot statistics and quantum-device noise.

quant-ph

Berry's phase on photonic quantum computers

We formulate a continuous-variable quantum computing (CVQC) algorithm to study Berry's phase on photonic quantum computers. We demonstrate that CVQC allows the simulation of charged particles with orbital angular momentum under the influence of an adiabatically changing $\vec{B}$ field. Although formulated entirely in the CVQC setting, our construction uses only passive linear-optical operations (beam splitters and phase shifts), which act identically in single-photon photonic architectures. This enables experimental realisation on the Quandella Ascella platform, where we observe the Berry's phase phenomenon with interferometric measurement. We also generalise the framework to more rapid non-adiabatic evolution. By concatenating Aharonov-Anandan cycles for opposing magnetic fields we demonstrate that one can engineer a circuit in which dynamical phases and leading non-geometric errors cancel by symmetry, leaving the intrinsically robust geometric phase contribution.

quant-ph

Continuous-variable photonic quantum extreme learning machines for fast collider-data selection

We study continuous-variable photonic quantum extreme learning machines as fast, low-overhead front-ends for collider data processing. Data is encoded in photonic modes through quadrature displacements and propagated through a fixed-time Gaussian quantum substrate. The final readout occurs through Gaussian-compatible measurements to produce a high-dimensional random feature map. Only a linear classifier is trained, using a single logistic regression, so retraining is fast, and the optical path and detector response set the analytical and inference latency. We evaluate this architecture on two representative classification tasks, top-jet tagging and Higgs-boson identification, with parameter-matched multi-layer perceptron (MLP) baselines. Using standard public datasets and identical train, validation, and test splits, the photonic Quantum Extreme Learning Machine (QELM) outperforms an MLP with two hidden units for all considered training sizes, and matches or exceeds an MLP with ten hidden units at large sample sizes, while training only the linear readout. These results indicate that Gaussian photonic extreme-learning machines can provide compact and expressive random features at fixed latency. The combination of deterministic timing, rapid retraining, low optical power, and room temperature operation makes photonic QELMs a credible building block for online data selection and even first-stage trigger integration at future collider experiments.

quant-ph

Quantum simulation of scattering amplitudes and interferences in perturbative QCD

A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their interferences in Quantum Chromodynamics (QCD). We simulate the colour parts of the interactions directly on the quantum computer, while the kinematic parts are for now pre-computed classically. For processes where some of the external particles are identical, we find the first hints of a potential quantum advantage. We validate our techniques using simulated quantum computers. Furthermore, for toy examples we also demonstrate our algorithms on a 56-qubit trapped-ion quantum computer. The work constitutes a further key step towards a full quantum simulation of generic perturbative QCD processes.

hep-ph

Qumode Tensor Networks for False Vacuum Decay in Quantum Field Theory

False vacuum decay in scalar quantum field theory (QFT) is a cornerstone of early Universe cosmology and high energy physics, yet its real-time dynamics is essentially inaccessible to classical computation due to its non-perturbative, highly entangled dynamics. We introduce a general Hamiltonian framework for simulating full interacting QFTs, using a spatial lattice of continuos-variable ``qumodes'' -- bosonic local oscillators whose high-dimensional local Hilbert space faithfully captures interacting field dynamics. This construction is rooted in continuous-variable quantum computing (CVQC), and provides a unified platform spanning efficient classical tensor-network methods and emerging photonic quantum hardware. The first key advance of this work is a robust and scaleable method for preparing the QFT in its correct initial vacuum state. We develop an imaginary-time preparation algorithm tailored to qumode lattices, that efficiently projects onto the vacuum even in strongly coupled regimes. This provides a controllable starting point for studying nonperturbative dynamics such as tunnelling and real-time decay. Building on this, we use a time-evolving block decimation algorithm to capture the real-time dynamics of the scalar field. Our second key advance is the identification and excitation of the negative fluctuation mode of the bounce configuration on the qumode lattice. A small displacement along this mode produces the expected tachyonic growth, driving fully coherent bubble nucleation without requiring classically supercritical seeds. This demonstrates that the qumode lattice captures non-perturbative quantum dynamics that lie beyond the classical treatments. Our results establish the qumode network as a scalable framework for non-equilibrium scalar QFT phenomena and pave the way for higher-dimensional studies and continuous-variable quantum computing implementations.

quant-ph

Real-Time Scattering on Quantum Computers via Hamiltonian Truncation

We present a quantum computational framework using Hamiltonian Truncation (HT) for simulating real-time scattering processes in $(1+1)$-dimensional scalar $\phi^4$ theory. Unlike traditional lattice discretisation methods, HT approximates the quantum field theory Hilbert space by truncating the energy eigenbasis of a solvable reference Hamiltonian, significantly reducing the number of required qubits. Our approach involves preparing initial states as wavepackets through adiabatic evolution from the free-field theory to the interacting regime. We experimentally demonstrate this state preparation procedure on an IonQ trapped-ion quantum device and validate it through quantum simulations, capturing key phenomena such as wavepacket dynamics, interference effects, and particle production post-collision. Detailed resource comparisons highlight the advantages of HT over lattice approaches in terms of qubit efficiency, although we observe challenges associated with circuit depth scaling. Our findings suggest that Hamiltonian Truncation offers a promising strategy for quantum simulations of quantum field theories, particularly as quantum hardware and algorithms continue to improve.

quant-ph

Real-Time Scattering Processes with Continuous-Variable Quantum Computers

We propose a framework for simulating the real-time dynamics of quantum field theories (QFTs) using continuous-variable quantum computing (CVQC). Focusing on ($1+1$)-dimensional $\varphi^4$ scalar field theory, the approach employs the Hamiltonian formalism to map the theory onto a spatial lattice, with fields represented as quantum harmonic oscillators. Using measurement-based quantum computing, we implement non-Gaussian operations for CQVC platforms. The study introduces methods for preparing initial states with specific momenta and simulating their evolution under the $\varphi^4$ Hamiltonian. Key quantum objects, such as two-point correlation functions, validate the framework against analytical solutions. Scattering simulations further illustrate how mass and coupling strength influence field dynamics and energy redistribution. Thus, we demonstrate CVQC's scalability for larger lattice systems and its potential for simulating more complex field theories.

quant-ph

Enhancing Quantum Field Theory Simulations on NISQ Devices with Hamiltonian Truncation

Quantum computers can efficiently simulate highly entangled quantum systems, offering a solution to challenges facing classical simulation of Quantum Field Theories (QFTs). This paper presents an alternative to traditional methods for simulating the real-time evolution in QFTs by leveraging Hamiltonian Truncation (HT). As a use case, we study the Schwinger model, systematically reducing the complexity of the Hamiltonian via HT while preserving essential physical properties. For the observables studied in this paper, the HT approach converges quickly with the number of qubits, allowing for the interesting physics processes to be captured without needing many qubits. Identifying the truncated free Hamiltonian's eigenbasis with the quantum device's computational basis avoids the need for complicated and costly state preparation routines, reducing the algorithm's overall circuit depth and required coherence time. As a result, the HT approach to simulating QFTs on a quantum device is well suited to Noisy-Intermediate Scale Quantum (NISQ) devices, which have a limited number of qubits and short coherence times. We validate our approach by running simulations on a NISQ device, showcasing strong agreement with theoretical predictions. We highlight the potential of HT for simulating QFTs on quantum hardware.

quant-ph

Simulating quantum field theories on continuous-variable quantum computers

We delve into the use of photonic quantum computing to simulate quantum mechanics and extend its application towards quantum field theory. We develop and prove a method that leverages this form of Continuous-Variable Quantum Computing (CVQC) to reproduce the time evolution of quantum-mechanical states under arbitrary Hamiltonians, and we demonstrate the method's remarkable efficacy with various potentials. Our method centres on constructing an evolver-state, a specially prepared quantum state that induces the desired time-evolution on the target state. This is achieved by introducing a non-Gaussian operation using a measurement-based quantum computing approach, enhanced by machine learning. Furthermore, we propose a framework in which these methods can be extended to encode field theories in CVQC without discretising the field values, thus preserving the continuous nature of the fields. This opens new avenues for quantum computing applications in quantum field theory.

quant-ph

Quantum Pathways for Charged Track Finding in High-Energy Collisions

In high-energy particle collisions, charged track finding is a complex yet crucial endeavour. We propose a quantum algorithm, specifically quantum template matching, to enhance the accuracy and efficiency of track finding. Abstracting the Quantum Amplitude Amplification routine by introducing a data register, and utilising a novel oracle construction, allows data to be parsed to the circuit and matched with a hit-pattern template, without prior knowledge of the input data. Furthermore, we address the challenges posed by missing hit data, demonstrating the ability of the quantum template matching algorithm to successfully identify charged-particle tracks from hit patterns with missing hits. Our findings therefore propose quantum methodologies tailored for real-world applications and underline the potential of quantum computing in collider physics.

hep-ph

Collider Events on a Quantum Computer

High-quality simulated data is crucial for particle physics discoveries. Therefore, parton shower algorithms are a major building block of the data synthesis in event generator programs. However, the core algorithms used to generate parton showers have barely changed since the 1980s. With quantum computers' rapid and continuous development, dedicated algorithms are required to exploit the potential that quantum computers provide to address problems in high-energy physics. This paper presents a novel approach to synthesising parton showers using the Discrete QCD method. The algorithm benefits from an elegant quantum walk implementation which can be embedded into the classical toolchain. We use the ibm_algiers device to sample parton shower configurations and generate data that we compare against measurements taken at the ALEPH, DELPHI and OPAL experiments. This is the first time a Noisy Intermediate-Scale Quantum (NISQ) device has been used to simulate realistic high-energy particle collision events.

hep-ph

Quantum walk approach to simulating parton showers

This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer. We demonstrate that the quantum walk paradigm offers a natural and more efficient approach to simulating parton showers on quantum devices, with the emission probabilities implemented as the coin flip for the walker, and the particle emissions to either gluons or quark pairs corresponding to the movement of the walker in two dimensions. A quantum algorithm is proposed for a simplified, toy model of a 31-step, collinear parton shower, hence significantly increasing the number of steps of the parton shower that can be simulated compared to previous quantum algorithms. Furthermore, it scales efficiently: the number of possible shower steps increases exponentially with the number of qubits, and the circuit depth grows linearly with the number of steps. Reframing the parton shower in the context of a quantum walk therefore brings dramatic improvements, and is a step towards extending the current quantum algorithms to simulate more realistic parton showers.

hep-ph

Enhancing Inertial Navigation Performance via Fusion of Classical and Quantum Accelerometers

While quantum accelerometers sense with extremely low drift and low bias, their practical sensing capabilities face two limitations compared with classical accelerometers: a lower sample rate due to cold atom interrogation time, and a reduced dynamic range due to signal phase wrapping. In this paper, we propose a maximum likelihood probabilistic data fusion method, under which the actual phase of the quantum accelerometer can be unwrapped by fusing it with the output of a classical accelerometer on the platform. Consequently, the proposed method enables quantum accelerometers to be applied in practical inertial navigation scenarios with enhanced performance. The recovered measurement from the quantum accelerometer is also used to re-calibrate the classical accelerometer. We demonstrate the enhanced error performance achieved by the proposed fusion method using a simulated 1D inertial navigation scenario. We conclude with a discussion on fusion error and potential solutions.

quant-ph

Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers

The interpretation of measurements of high-energy particle collisions relies heavily on the performance of full event generators. By far the largest amount of time to predict the kinematics of multi-particle final states is dedicated to the calculation of the hard process and the subsequent parton shower step. With the continuous improvement of quantum devices, dedicated algorithms are needed to exploit the potential quantum computers can provide. We propose general and extendable algorithms for quantum gate computers to facilitate calculations of helicity amplitudes and the parton shower process. The helicity amplitude calculation exploits the equivalence between spinors and qubits and the unique features of a quantum computer to compute the helicities of each particle involved simultaneously, thus fully utilising the quantum nature of the computation. This advantage over classical computers is further exploited by the simultaneous computation of s and t-channel amplitudes for a 2$\rightarrow$2 process. The parton shower algorithm simulates collinear emission for a two-step, discrete parton shower. In contrast to classical implementations, the quantum algorithm constructs a wavefunction with a superposition of all shower histories for the whole parton shower process, thus removing the need to explicitly keep track of individual shower histories. Both algorithms utilise the quantum computer's ability to remain in a quantum state throughout the computation and represent a first step towards a quantum computing algorithm to describe the full collision event at the LHC.

hep-ph

Information Geometry of Sensor Configuration

In problems of parameter estimation from sensor data, the Fisher Information provides a measure of the performance of the sensor; effectively, in an infinitesimal sense, how much information about the parameters can be obtained from the measurements. From the geometric viewpoint, it is a Riemannian metric on the manifold of parameters of the observed system. In this paper we consider the case of parameterized sensors and answer the question, "How best to reconfigure a sensor (vary the parameters of the sensor) to optimize the information collected?" A change in the sensor parameters results in a corresponding change to the metric. We show that the change in information due to reconfiguration exactly corresponds to the natural metric on the infinite dimensional space of Riemannian metrics on the parameter manifold, restricted to finite-dimensional sub-manifold determined by the sensor parameters. The distance measure on this configuration manifold is shown to provide optimal, dynamic sensor reconfiguration based on an information criterion. Geodesics on the configuration manifold are shown to optimize the information gain but only if the change is made at a certain rate. An example of configuring two bearings-only sensors to optimally locate a target is developed in detail to illustrate the mathematical machinery, with Fast-Marching methods employed to efficiently calculate the geodesics and illustrate the practicality of using this approach.

cs.IT