Related papers: Quantum Pathways for Charged Track Finding in High…
Electron quantum path interferences in strongly laser-driven aligned molecules and their dependence on the molecular alignment is an essential open problem in strong-field molecular physics. Here, we demonstrate an approach which provides…
We propose to explore the potential advantages of a new class of tracking algorithms loosely inspired by the Hough transform concept and where we include the time of arrival of each hit as an additional coordinate to be treated in the same…
This study introduces a hybrid quantum-classical dispatching framework designed for power systems with high renewable penetration. The proposed method integrates a variational quantum algorithm with classical optimization to provide…
Track reconstruction in high track multiplicity environments at current and future high rate particle physics experiments is a big challenge and very time consuming. The search for track seeds and the fitting of track candidates are usually…
We propose a novel method for analysis of experimental data obtained at relativistic nucleus-nucleus collisions. The method, based on the ideas of Random Matrix Theory, is applied to detect systematic errors that occur at measurements of…
Identification of charged particles in a multilayer detector by the energy loss technique may also be achieved by the use of a neural network. The performance of the network becomes worse when a large fraction of information is missing, for…
We investigate the quantum algorithm of Babbush et al. (arXiv:2303.13012v3) for simulating coupled harmonic oscillators, which promises exponential speedups over classical methods. Focusing on linearly connected oscillator chains, we bridge…
The reconstruction of trajectories of charged particles is a key computational challenge for current and future collider experiments. Considering the rapid progress in quantum computing, it is crucial to explore its potential for this and…
Quantum computers can efficiently solve problems which are widely believed to lie beyond the reach of classical computers. In the near-term, hybrid quantum-classical algorithms, which efficiently embed quantum hardware in classical…
Precision, robustness, and efficiency are crucial aspects in the design of quantum technologies. Here, we show how genuine quantum features, together with non-Gaussianity, can be the key elements to achieve the best of these three aspects…
Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the…
Some of the most astonishing and prominent properties of Quantum Mechanics, such as entanglement and Bell nonlocality, have only been studied extensively in dedicated low-energy laboratory setups. The feasibility of these studies in the…
We introduce an adaptable and modular hybrid architecture designed for fault-tolerant quantum computing. It combines quantum emitters and linear-optical entangling gates to leverage the strength of both matter-based and photonic-based…
Entanglement detection is a fundamental task in quantum information science, serving as a cornerstone for quantum benchmarking and foundational studies. With an increasing qubit number that can be effectively controlled, there is a pressing…
Developing high-performance materials is critical for diverse energy applications to increase efficiency, improve sustainability and reduce costs. Classical computational methods have enabled important breakthroughs in energy materials…
Little is known about the physics frontier of strong acceleration; both classical and quantum physics need further development in order to be able to address this newly accessible area of physics. In this lecture we discuss what strong…
Multichannel Quantum Defect Theory (MQDT) is shown to be capable of producing quantitatively accurate results for low-energy atom-molecule scattering calculations. With a suitable choice of reference potential and short-range matching…
In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant quantum computers. We propose a quantum algorithm for studying these collisions by looking at a class of observables…
This paper presents a novel method for the reconstruction of interaction vertices in particle collision data. The algorithm is an agglomerative clustering technique designed for high-luminosity environments in current and future…
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to…