Searcharxiv⌕ Search

arXiv subjects

Aritra Das

Publications and source records attributed to Aritra Das.

At least 37 records · Page 2Linked to original sources

Oscillators Are All You Need: Irregular Time Series Modelling via Damped Harmonic Oscillators with Closed-Form Solutions

Transformers excel at time series modelling through attention mechanisms that capture long-term temporal patterns. However, they assume uniform time intervals and therefore struggle with irregular time series. Neural Ordinary Differential Equations (NODEs) effectively handle irregular time series by modelling hidden states as continuously evolving trajectories. ContiFormers arxiv:2402.10635 combine NODEs with Transformers, but inherit the computational bottleneck of the former by using heavy numerical solvers. This bottleneck can be removed by using a closed-form solution for the given dynamical system - but this is known to be intractable in general! We obviate this by replacing NODEs with a novel linear damped harmonic oscillator analogy - which has a known closed-form solution. We model keys and values as damped, driven oscillators and expand the query in a sinusoidal basis up to a suitable number of modes. This analogy naturally captures the query-key coupling that is fundamental to any transformer architecture by modelling attention as a resonance phenomenon. Our closed-form solution eliminates the computational overhead of numerical ODE solvers while preserving expressivity. We prove that this oscillator-based parameterisation maintains the universal approximation property of continuous-time attention; specifically, any discrete attention matrix realisable by ContiFormer's continuous keys can be approximated arbitrarily well by our fixed oscillator modes. Our approach delivers both theoretical guarantees and scalability, achieving state-of-the-art performance on irregular time series benchmarks while being orders of magnitude faster. Acknowledgement: This work was done in collaboration with Dirac Labs.

cs.LG↗

Physics Aware Neural Networks: Denoising for Magnetic Navigation

Magnetic-anomaly navigation, leveraging small-scale variations in the Earth's magnetic field, is a promising alternative when GPS is unavailable or compromised. Airborne systems face a key challenge in extracting geomagnetic field data: the aircraft itself induces magnetic noise. Although the classical Tolles-Lawson model addresses this, it inadequately handles stochastically corrupted magnetic data required for navigation. To handle stochastic noise, we propose using two physics-based constraints: divergence-free vector fields and E(3)-equivariance. These ensure the learned magnetic field obeys Maxwell's equation and that outputs transform correctly with sensor position and orientation. The divergence-free constraint is implemented by training a neural network to output a vector potential A, with the magnetic field defined as its curl. For E(3)-equivariance, we use tensor products of geometric tensors represented via spherical harmonics with known rotational transformations. Enforcing physical consistency and restricting the admissible function space acts as an implicit regularizer that improves spatiotemporal performance. We present ablation studies evaluating each constraint alone and jointly across CNNs, MLPs, LTCs, and Contiformers. Continuous-time dynamics and long-term memory are critical for modelling magnetic time series; the Contiformer, which provides both, outperforms existing methods. To mitigate data scarcity, we generate synthetic datasets using the World Magnetic Model (WMM) and time-series conditional GANs, producing realistic, temporally consistent magnetic sequences across varied trajectories and environments. Experiments show that embedding these constraints significantly improves predictive accuracy and physical plausibility, outperforming classical and unconstrained deep learning approaches. Acknowledgement: This work was done in collaboration with Dirac Labs.

cs.LG↗

Utility of noiseless linear amplification and attenuation in single-rail discrete-variable quantum communications

Quantum communication offers many applications, with teleportation and superdense coding being two of the most fundamental. In these protocols, pre-shared entanglement enables either the faithful transfer of quantum states or the transmission of more information than is possible classically. However, channel losses degrade the shared states, reducing teleportation fidelity and the information advantage in superdense coding. Here, we investigate how to mitigate these effects by optimising the measurements applied by the communicating parties. We formulate the problem as an optimisation over general positive operator-valued measurements (POVMs) and compare the results with physically realisable noiseless attenuation (NA) and noiseless linear amplification (NLA) circuits. For teleportation, NLA/NA and optimised POVMs improve the average fidelity by up to 78% while maintaining feasible success probabilities. For superdense coding, they enhance the quantum advantage over the classical channel capacity by more than 100% in some regimes and shift the break-even point, thereby extending the tolerable range of losses. Notably, the optimal POVMs effectively reduce to NA or NLA, showing that simple, experimentally accessible operations already capture the essential performance gains.

quant-ph↗

Beating three-parameter precision trade-offs with entangling collective measurements

Quantum-mechanical incompatibility, which precludes the simultaneous precise measurement of non-commuting observables, imposes fundamental limits on the rate at which classical information can be extracted. While the potential to surpass these limits using entangling collective measurements has been explored for two parameters, the regime of three or more parameters remains largely unexplored despite its fundamental and technological importance. Here, we investigate the three-parameter trade-off relations for estimating the Bloch vector components of a qubit, comparing conventional individual measurements with entangling collective measurements. We theoretically derive and experimentally implement optimal collective measurements on two identically prepared qubits using a programmable photonic circuit. Our experimental results demonstrate a clear violation of the entanglement-free trade-off relation -- by an average of 16 standard deviations -- achieving a tomography precision beyond the reach of any individual measurement scheme. This work directly confirms that optimal collective measurements can surpass the fundamental quantum limits of individual schemes in a three-parameter setting -- thereby deepening our understanding of quantum uncertainty relations beyond the two-parameter regime and providing a clear strategy to overcome the precision trade-offs imposed by quantum incompatibility.

quant-ph↗

Building Interpretable Models for Moral Decision-Making

We build a custom transformer model to study how neural networks make moral decisions on trolley-style dilemmas. The model processes structured scenarios using embeddings that encode who is affected, how many people, and which outcome they belong to. Our 2-layer architecture achieves 77% accuracy on Moral Machine data while remaining small enough for detailed analysis. We use different interpretability techniques to uncover how moral reasoning distributes across the network, demonstrating that biases localize to distinct computational stages among other findings.

cs.AI↗

Capacity-Achieving Entanglement Purification Protocol for Pauli Dephasing Channel

Quantum communication enables secure information transmission and entanglement distribution, but these tasks are fundamentally limited by the capacities of quantum channels. While quantum repeaters can mitigate losses and noise, entanglement swapping via a central node is ineffective against the Pauli dephasing channel due to degradation from Bell-state measurements. This suggests that purifying distributed Bell states before entanglement swapping is necessary. Although one-way hashing codes are known to saturate the dephasing channel capacity, no explicit two-way purification protocol has previously been shown to achieve this bound. In this work, we present a two-way entanglement purification protocol with an explicit, scalable circuit that asymptotically achieves the dephasing channel capacity. With each iteration, the fidelity of Bell states increases. At the final round, the residual dephasing error is suppressed doubly-exponentially, scaling as $\mathcal{O}(p^{2^{n}})$, enabling near-perfect Bell pairs for any fixed number of purification rounds $n$. The explicit circuit we propose is versatile and applicable to any number of Bell pairs, offering a practical solution for mitigating decoherence in quantum networks and distributed.

quant-ph↗

Precision Bounds for Characterising Quantum Measurements

Quantum measurements, alongside quantum states and processes, form a cornerstone of quantum information processing. However, unlike states and processes, their efficient characterisation remains relatively unexplored. We resolve this asymmetry by introducing a comprehensive framework for efficient detector estimation that reveals the fundamental limits to extractable parameter information and errors arising in detector analysis - the detector quantum Fisher information. Our development eliminates the need to optimise for the best probe state, while highlighting aspects of detector analysis that fundamentally differ from quantum state estimation. Through proofs, examples and experimental validation, we demonstrate the relevance and robustness of our proposal for current quantum detector technologies. By formalising a dual perspective to state estimation, our framework completes and connects the triad of efficient state, process, and detector tomography, advancing quantum information theory with broader implications for emerging technologies reliant on precisely calibrated measurements.

quant-ph↗

A unified optical platform for non-Gaussian and fault-tolerant Gottesman-Kitaev-Preskill states

Quantum technologies, encompassing communication, computation, and metrology, rely on the generation and control of non-Gaussian states of light. These states enable secure quantum communication, fault-tolerant quantum computation, and precision sensing beyond classical limits, yet their practical realisation remains a major challenge due to reliance on high-photon-number Fock states or strong non-linearities. Here we introduce a unified optical framework that removes this constraint, using only Gaussian inputs, optical parametric amplification, and heralded photon detection. Within a single architecture, we demonstrate the generation of photon-added squeezed states with near unit fidelity, cubic-phase-like states with strong non-linearities and fidelities above 98.5%, and squeezed-cat states exceeding 99% fidelity that can be iteratively bred into GKP grid states surpassing the 9.75 dB fault-tolerance threshold. Operating entirely below 3 dB of input squeezing, the approach provides a scalable, experimentally accessible platform that unites the state resources required for quantum communication, metrology, and computation within one coherent optical framework.

quant-ph↗

Saturating the Quantum Cramér--Rao Bound in Prioritised Parameter Estimation

Measurement incompatibility is a cornerstone of quantum mechanics. In the context of estimating multiple parameters of a quantum system, this manifests as a fundamental trade-off between the precisions with which different parameters can be estimated. Often, a parameter can be optimally measured, but at the cost of gaining no information about incompatible parameters. Here, we report that there are systems where one parameter's information can be maximised while not completely losing information about the other parameters. In doing so, we find attainable trade-off relations for quantum parameter estimation with a structure that is different to typical Heisenberg-type trade-offs. We demonstrate our findings by implementing an optimal entangling measurement on a Quantinuum trapped-ion quantum computer.

quant-ph↗

Generalized collective quantum tomography: algorithm design, optimization, and validation

Quantum tomography is a fundamental technique for characterizing, benchmarking, and verifying quantum states and devices. It plays a crucial role in advancing quantum technologies and deepening our understanding of quantum mechanics. Collective quantum state tomography, which estimates an unknown state \r{ho} through joint measurements on multiple copies $ρ\otimes\cdots\otimesρ$ of the unknown state, offers superior information extraction efficiency. Here we extend this framework to a generalized setting where the target becomes $S_1\otimes\cdots\otimes S_n$, with each $S_i$ representing identical or distinct quantum states, detectors, or processes from the same category. We formulate these tasks as optimization problems and develop three algorithms for collective quantum state, detector and process tomography, respectively, each accompanied by an analytical characterization of the computational complexity and mean squared error (MSE) scaling. Furthermore, we develop optimal solutions of these optimization problems using sum of squares (SOS) techniques with semi-algebraic constraints. The effectiveness of our proposed methods is demonstrated through numerical examples. Additionally, we experimentally demonstrate the algorithms using two-copy collective measurements, where entangled measurements directly provide information about the state purity. Compared to existing methods, our algorithms achieve lower MSEs and approach the collective MSE bound by effectively leveraging purity information.

quant-ph↗

Holevo Cramér-Rao bound: How close can we get without entangling measurements?

In multi-parameter quantum metrology, the resource of entanglement can lead to an increase in efficiency of the estimation process. Entanglement can be used in the state preparation stage, or the measurement stage, or both, to harness this advantage; here we focus on the role of entangling measurements. Specifically, entangling or collective measurements over multiple identical copies of a probe state are known to be superior to measuring each probe individually, but the extent of this improvement is an open problem. It is also known that such entangling measurements, though resource-intensive, are required to attain the ultimate limits in multi-parameter quantum metrology and quantum information processing tasks. In this work we investigate the maximum precision improvement that collective quantum measurements can offer over individual measurements for estimating parameters of qudit states, calling this the 'collective quantum enhancement'. We show that, whereas the maximum enhancement can, in principle, be a factor of $n$ for estimating $n$ parameters, this bound is not tight for large $n$. Instead, our results prove an enhancement linear in dimension of the qudit is possible using collective measurements and lead us to conjecture that this is the maximum collective quantum enhancement in any local estimation scenario.

quant-ph↗

Dilepton Spectra and Even Flow Harmonics in a Magnetized QGP: An Ideal Hydrodynamic Study

We present the first comprehensive study of dilepton production from a hot, magnetized quark-gluon plasma in heavy-ion collisions (HIC), incorporating realistic, time-dependent, and spatially inhomogeneous magnetic field profiles within an analytically solvable Gubser flow background. This framework provides a significant improvement over previous static calculations with homogeneous fields and moves toward the long-term goal of full $3+1$D magnetohydrodynamic simulations. We explore the effects of impact parameter, electrical conductivity, and invariant mass on the dilepton spectra and anisotropic even flow coefficients. It is found that transverse momentum spectra increase with impact parameter, dominated by annihilation processes, while decay contributions remain sub-leading. Strikingly, the elliptic flow $v_2$ from decay channels is nonzero even in nearly central collisions, exhibiting a characteristic shape--positive at low $p_T$ and negative at high $p_T$--that is largely independent of impact parameter and conductivity. In contrast, $v_2$ from annihilation processes is smaller in magnitude but dominates the total flow in magnitude due to its larger yield. Higher harmonics, such as $v_4$, are an order of magnitude smaller as compared to $v_2$ along with distinctive zero-crossing patterns. Conductivity enhances both spectra and flow but leaves no unambiguous signature for its extraction. Varying the invariant mass reveals the strongest enhancements at low mass, with harmonic coefficients suppressed at higher masses. Overall, our results suggest that central and semi-central collisions can carry imprints of the background magnetic field, and that characteristic correlations in even flow harmonics may provide a robust probe of electromagnetic effects in HICs.

hep-ph↗

Enhanced continuous-variable quantum key distribution protocol via adaptive signal processing

Quantum key distribution (QKD) provides a promising approach to secure communications, with continuous-variable QKD (CV-QKD) offering compatibility with existing telecommunication infrastructure. Despite this advantage, CV-QKD is limited by challenges such as losses in terrestrial fibres and atmospheric scintillation in free-space channels. We introduce a QKD protocol that surpasses the optimal Gaussian modulated CV-QKD (GG02) protocol by utilising probabilistic filters without known physical representation. Our approach employs a Gaussian filter at Alice's station and a non-Gaussian notch-like filter at Bob's station. Alice's filter optimises modulation variance to achieve key rates near the optimal GG02 performance, while Bob's filter adapts the effective channel conditions, which can result in higher key rates than the optimal GG02 protocol. Our security analysis avoids Gaussian extremality, accurately bounding Eve's information. The protocol dynamically optimises the secret-key rate for rapidly changing channels, such as terrestrial links and satellite-to-ground communications, and can extract keys in regions deemed non-secure by parameter estimation. Implemented at software level, our protocol requires no hardware modifications and can be integrated into existing QKD systems. Experimental results show a threefold increase in key rates over the optimal GG02 protocol, while simulations for Low Earth Orbit satellite quantum communications indicate a 400-fold increase compared to the non-optimised counterpart.

quant-ph↗

Rotational stability of magnetic field in rotating quark-gluon plasma

Relaxation of the magnetic field in rigidly rotating quark-gluon plasma is studied. It is shown that the infrared modes satisfying $k < |m|Ω$ and $k< |m\pm 1|Ω$, where integer $m$ is the projection of the orbital angular momentum along the rotating axis and $Ω$ is the angular velocity, are unstable. The instability onset time and the magnetic field growth rate are computed for a standard initial profile of the magnetic field. Given the present phenomenological values of $Ω$ and electrical conductivity $σ$ the instability is not expected to be a significant factor in the field's time evolution.

hep-ph↗

Learning to grok: Emergence of in-context learning and skill composition in modular arithmetic tasks

Large language models can solve tasks that were not present in the training set. This capability is believed to be due to in-context learning and skill composition. In this work, we study the emergence of in-context learning and skill composition in a collection of modular arithmetic tasks. Specifically, we consider a finite collection of linear modular functions $z = a \, x + b \, y \;\mathrm{mod}\; p$ labeled by the vector $(a, b) \in \mathbb{Z}_p^2$. We use some of these tasks for pre-training and the rest for out-of-distribution testing. We empirically show that a GPT-style transformer exhibits a transition from in-distribution to out-of-distribution generalization as the number of pre-training tasks increases. We find that the smallest model capable of out-of-distribution generalization requires two transformer blocks, while for deeper models, the out-of-distribution generalization phase is \emph{transient}, necessitating early stopping. Finally, we perform an interpretability study of the pre-trained models, revealing highly structured representations in both attention heads and MLPs; and discuss the learned algorithms. Notably, we find an algorithmic shift in deeper models, as we go from few to many in-context examples.

cs.LG↗

Grokking Modular Polynomials

Neural networks readily learn a subset of the modular arithmetic tasks, while failing to generalize on the rest. This limitation remains unmoved by the choice of architecture and training strategies. On the other hand, an analytical solution for the weights of Multi-layer Perceptron (MLP) networks that generalize on the modular addition task is known in the literature. In this work, we (i) extend the class of analytical solutions to include modular multiplication as well as modular addition with many terms. Additionally, we show that real networks trained on these datasets learn similar solutions upon generalization (grokking). (ii) We combine these "expert" solutions to construct networks that generalize on arbitrary modular polynomials. (iii) We hypothesize a classification of modular polynomials into learnable and non-learnable via neural networks training; and provide experimental evidence supporting our claims.

cs.LG↗

To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasets

Robust generalization is a major challenge in deep learning, particularly when the number of trainable parameters is very large. In general, it is very difficult to know if the network has memorized a particular set of examples or understood the underlying rule (or both). Motivated by this challenge, we study an interpretable model where generalizing representations are understood analytically, and are easily distinguishable from the memorizing ones. Namely, we consider multi-layer perceptron (MLP) and Transformer architectures trained on modular arithmetic tasks, where ($ξ\cdot 100\%$) of labels are corrupted (\emph{i.e.} some results of the modular operations in the training set are incorrect). We show that (i) it is possible for the network to memorize the corrupted labels \emph{and} achieve $100\%$ generalization at the same time; (ii) the memorizing neurons can be identified and pruned, lowering the accuracy on corrupted data and improving the accuracy on uncorrupted data; (iii) regularization methods such as weight decay, dropout and BatchNorm force the network to ignore the corrupted data during optimization, and achieve $100\%$ accuracy on the uncorrupted dataset; and (iv) the effect of these regularization methods is (``mechanistically'') interpretable: weight decay and dropout force all the neurons to learn generalizing representations, while BatchNorm de-amplifies the output of memorizing neurons and amplifies the output of the generalizing ones. Finally, we show that in the presence of regularization, the training dynamics involves two consecutive stages: first, the network undergoes \emph{grokking} dynamics reaching high train \emph{and} test accuracy; second, it unlearns the memorizing representations, where the train accuracy suddenly jumps from $100\%$ to $100 (1-ξ)\%$.

cs.LG↗

An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation

The quantum approximate optimisation algorithm (QAOA) is a hybrid quantum-classical algorithm used to approximately solve combinatorial optimisation problems. It involves multiple iterations of a parameterised ansatz comprising a problem and mixer Hamiltonian, with the parameters being classically optimised. While QAOA can be implemented on NISQ devices, physical limitations can limit circuit depth and decrease performance. To address these limitations, this work introduces the eXpressive QAOA (XQAOA), an overparameterised variant of QAOA that assigns more classical parameters to the ansatz to improve its performance at low depths. XQAOA also introduces an additional Pauli-Y component in the mixer Hamiltonian, allowing the mixer to implement arbitrary unitary transformations on each qubit. To benchmark the performance of XQAOA at unit depth, we derive its closed-form expression for the MaxCut problem and compare it to QAOA, Multi-Angle QAOA (MA-QAOA), a classical-relaxed algorithm, and the state-of-the-art Goemans-Williamson algorithm on a set of unweighted regular graphs with 128 and 256 nodes for degrees ranging from 3 to 10. Our results indicate that at unit depth, XQAOA has benign loss landscapes, allowing it to consistently outperform QAOA, MA-QAOA, and the classical-relaxed algorithm on all graph instances and the Goemans-Williamson algorithm on graph instances with degrees greater than 4. Small-scale simulations also reveal that unit-depth XQAOA surpasses both QAOA and MA-QAOA on all tested depths up to five. Additionally, we find an infinite family of graphs for which XQAOA solves MaxCut exactly and analytically show that for some graphs in this family, XQAOA achieves a much larger approximation ratio than QAOA. Overall, XQAOA is a more viable choice for variational quantum optimisation on NISQ devices, offering competitive performance at low depths.

quant-ph↗