Julian Schuhmacher

Mr. Julian Schuhmacher

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 August 2024 in PRX Quantum
Verified
Journal Article
Open access
PDF file
AMAlberto Di Meglio
Alberto Di Meglio
KJKarl Jansen
Karl Jansen
ITIvano Tavernelli
Ivano Tavernelli
CAConstantia Alexandrou
Constantia Alexandrou
SASrinivasan Arunachalam
Srinivasan Arunachalam
JZJinglei Zhang
Jinglei Zhang
Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage—namely, a significant (in some cases exponential) speedup of numerical simulations. The rapid development of hardware devices with various realizations of qubits enables the execution of small-scale but representative applications on quantum computers. In particular, the high-energy physics community plays a pivotal role in accessing the power of quantum computing, since the field is a driving source for challenging computational problems. This concerns, on the theoretical side, the exploration of models that are very hard or even impossible to address with classical techniques and, on the experimental side, the enormous data challenge of newly emerging experiments, such as the upgrade of the Large Hadron Collider. In this Roadmap paper, led by CERN, DESY, and IBM, we provide the status of high-energy physics quantum computations and give examples of theoretical and experimental target benchmark applications, which can be addressed in the near future. Having in mind hardware with about 100 qubits capable of executing several thousand two-qubit gates, where possible, we also provide resource estimates for the examples given using error-mitigated quantum computing. The ultimate declared goal of this task force is therefore to trigger further research in the high-energy physics community to develop interesting use cases for demonstrations on near-term quantum computers. Published by the American Physical Society 2024

16 November 2023 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
JSJulian Schuhmacher
Julian Schuhmacher
LBLaura Boggia
Laura Boggia
VBVasilis Belis
Vasilis Belis
EPEma Puljak
Ema Puljak
MGMichele Grossi
Michele Grossi
ITIvano Tavernelli
Ivano Tavernelli
Much hope for finding new physics phenomena at microscopic scale relies on the observations obtained from High Energy Physics experiments, like the ones performed at the Large Hadron Collider (LHC). However, current experiments do not indicate clear signs of new physics that could guide the development of additional Beyond Standard Model (BSM) theories. Identifying signatures of new physics out of the enormous amount of data produced at the LHC falls into the class of anomaly detection and constitutes one of the greatest computational challenges. In this article, we propose a novel strategy to perform anomaly detection in a supervised learning setting, based on the artificial creation of anomalies through a random process. For the resulting supervised learning problem, we successfully apply classical and quantum support vector classifiers (CSVC and QSVC respectively) to identify the artificial anomalies among the SM events. Even more promising, we find that employing an SVC trained to identify the artificial anomalies, it is possible to identify realistic BSM events with high accuracy. In parallel, we also explore the potential of quantum algorithms for improving the classification accuracy and provide plausible conditions for the best exploitation of this novel computational paradigm.

29 January 2025 in PRX Quantum
Verified
Journal Article
Open access
JSJulian Schuhmacher
Julian Schuhmacher
MBMarco Ballarin
Marco Ballarin
ABAlberto Baiardi
Alberto Baiardi
GMGiuseppe Magnifico
Giuseppe Magnifico
FTFrancesco Tacchino
Francesco Tacchino
ITIvano Tavernelli
Ivano Tavernelli
Hybrid tensor networks (hTNs) offer a promising solution for encoding variational quantum states beyond the capabilities of efficient classical methods or noisy quantum computers alone. However, their practical usefulness and many operational aspects of hTN-based algorithms, like the optimization of hTNs, the generalization of standard contraction rules to an hybrid setting, and the design of application-oriented architectures have not been thoroughly investigated yet. In this work, we introduce a novel algorithm to perform ground-state optimizations with hybrid tree tensor networks (hTTNs), discussing its advantages and roadblocks, and identifying a set of promising applications. We benchmark our approach on two paradigmatic models, namely the Ising model at the critical point and the Toric-code Hamiltonian. In both cases, we successfully demonstrate that hTTNs can improve upon classical equivalents with equal bond dimension in the classical part.

1 February 2025 in New Journal of Physics
Verified
Journal Article
Open access
ILIsabel Nha Minh Le
Isabel Nha Minh Le
OKOriel Kiss
Oriel Kiss
JSJulian Schuhmacher
Julian Schuhmacher
ITIvano Tavernelli
Ivano Tavernelli
FTFrancesco Tacchino
Francesco Tacchino
Machine learning techniques are essential tools to compute efficient, yet accurate, force fields for atomistic simulations. This approach has recently been extended to incorporate quantum computational methods, making use of variational quantum learning models to predict potential energy surfaces and atomic forces from ab initio training data. However, the trainability and scalability of such models are still limited, due to both theoretical and practical barriers. Inspired by recent developments in geometric classical and quantum machine learning, here we design quantum neural networks that explicitly incorporate, as a data-inspired prior, an extensive set of physically relevant symmetries. We find that our invariant quantum learning models outperform their more generic counterparts on individual molecules of growing complexity. Furthermore, we study a water dimer as a minimal example of a system with multiple components, showcasing the versatility of our proposed approach and opening the way towards larger simulations. Finally, we perform a barren plateau analysis and numerically observe that our model does not exhibit a barren plateau in the shallow depth regime. Our results suggest that molecular force fields generation can significantly profit from leveraging the framework of geometric quantum machine learning, and that chemical systems represent, in fact, an interesting and rich playground for the development and application of advanced quantum machine learning tools.

1 November 2022 in AIP Advances
Verified
Journal Article
Open access
PDF file
JSJulian Schuhmacher
Julian Schuhmacher
GMGuglielmo Mazzola
Guglielmo Mazzola
FTFrancesco Tacchino
Francesco Tacchino
ODOlga Dmitriyeva
Olga Dmitriyeva
TBTai Bui
Tai Bui
ITIvano Tavernelli
Ivano Tavernelli
Solving electronic structure problems represents a promising field of applications for quantum computers. Currently, much effort is spent in devising and optimizing quantum algorithms for near-term quantum processors, with the aim of outperforming classical counterparts on selected problem instances using limited quantum resources. These methods are still expected to feature a runtime preventing quantum simulations of large scale and bulk systems. In this work, we propose a strategy to extend the scope of quantum computational methods to large scale simulations using a machine learning potential trained on quantum simulation data. The challenge of applying machine learning potentials in today’s quantum setting arises from the several sources of noise affecting the quantum computations of electronic energies and forces. We investigate the trainability of a machine learning potential selecting various sources of noise: statistical, optimization, and hardware noise. Finally, we construct the first machine learning potential from data computed on actual IBM Quantum processors for a hydrogen molecule. This already would allow us to perform arbitrarily long and stable molecular dynamics simulations, outperforming all current quantum approaches to molecular dynamics and structure optimization.

27 May 2023 in Entropy
Verified
Journal Article
Open access
PDF file
MJManuel John
Manuel John
JSJulian Schuhmacher
Julian Schuhmacher
PBPanagiotis Barkoutsos
Panagiotis Barkoutsos
ITIvano Tavernelli
Ivano Tavernelli
FTFrancesco Tacchino
Francesco Tacchino
The discovery of quantum algorithms offering provable advantages over the best known classical alternatives, together with the parallel ongoing revolution brought about by classical artificial intelligence, motivates a search for applications of quantum information processing methods to machine learning. Among several proposals in this domain, quantum kernel methods have emerged as particularly promising candidates. However, while some rigorous speedups on certain highly specific problems have been formally proven, only empirical proof-of-principle results have been reported so far for real-world datasets. Moreover, no systematic procedure is known, in general, to fine tune and optimize the performances of kernel-based quantum classification algorithms. At the same time, certain limitations such as kernel concentration effects—hindering the trainability of quantum classifiers—have also been recently pointed out. In this work, we propose several general-purpose optimization methods and best practices designed to enhance the practical usefulness of fidelity-based quantum classification algorithms. Specifically, we first describe a data pre-processing strategy that, by preserving the relevant relationships between data points when processed through quantum feature maps, substantially alleviates the effect of kernel concentration on structured datasets. We also introduce a classical post-processing method that, based on standard fidelity measures estimated on a quantum processor, yields non-linear decision boundaries in the feature Hilbert space, thus achieving the quantum counterpart of the radial basis functions technique that is widely employed in classical kernel methods. Finally, we apply the so-called quantum metric learning protocol to engineer and adjust trainable quantum embeddings, demonstrating substantial performance improvements on several paradigmatic real-world classification tasks.