SearcharxivSearch

arXiv subjects

Smit Chaudhary

Publications and source records attributed to Smit Chaudhary.

3 recordsLinked to original sources

Weak forms offer strong regularisations: how to make physics-informed (quantum) machine learning more robust

Physics-informed (PI) methodologies have surged to become a pillar route to solve Differential Equations (DEs), sustained by the growth of machine learning methods in scientific contexts. The main proposition of PI is to minimise variationally a loss function, formally ensuring that a neural surrogate of the solution has the DE locally satisfied. The nature of such formulation encouraged the exploration of equivalent quantum algorithms, where the surrogate solution is expressed by variational quantum architectures. The locality of typical loss functions emphasises the DE to hold at an ensemble of points sampled in the domain, but encounters issues when generalising beyond such points, or when propagating boundary conditions. Issues which affect classical and quantum PI algorithms alike. The quest to fill this gap in robustness and accuracy against mainstream DE solvers has led to a plethora of proposals in various directions. In particular, classical DE solvers have long employed the weak form - an integral based approach aiming at imposing a global condition on the solution - prioritising a good average behaviour instead of ``overfitting'' select points. Here, we propose and explore to combine contributions from both local and global loss functions in PI routines, to exploit the advantages and mitigate the weaknesses of both. We showcase this intuition in a variety of problems focusing on differentiable quantum architectures, and demonstrating in particular how orchestrating such hybrid loss formulation with domain decomposition can offer a strong advantage over local-only strategies.

quant-ph

Quantum Circuit Training with Growth-Based Architectures

This study introduces growth-based training strategies that incrementally increase parameterized quantum circuit (PQC) depth during training, mitigating overfitting and managing model complexity dynamically. We develop three distinct methods: Block Growth, Sequential Feature Map Growth, and Interleave Feature Map Growth, which add reuploader blocks to PQCs adaptively, expanding the accessible frequency spectrum of the model in response to training needs. This approach enables PQCs to achieve more stable convergence and generalization, even in noisy settings. We evaluate our methods on regression tasks and the 2D Laplace equation, demonstrating that dynamic growth methods outperform traditional, fixed-depth approaches, achieving lower final losses and reduced variance between runs. These findings underscore the potential of growth-based PQCs for quantum scientific machine learning (QSciML) applications, where balancing expressivity and stability is essential.

quant-ph

Towards a scalable discrete quantum generative adversarial neural network

We introduce a fully quantum generative adversarial network intended for use with binary data. The architecture incorporates several features found in other classical and quantum machine learning models, which up to this point had not been used in conjunction. In particular, we incorporate noise reuploading in the generator, auxiliary qubits in the discriminator to enhance expressivity, and a direct connection between the generator and discriminator circuits, obviating the need to access the generator's probability distribution. We show that, as separate components, the generator and discriminator perform as desired. We empirically demonstrate the expressive power of our model on both synthetic data as well as low energy states of an Ising model. Our demonstrations suggest that the model is not only capable of reproducing discrete training data, but also of potentially generalizing from it.

quant-ph