Jorge J. Martinez De Lejarza
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jorge J. Martinez De Lejarza has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Germán Rodrigo
Instituto de Fisica Corpuscular
7 shared publications - Leandro Cieri
Instituto de Fisica Corpuscular
3 shared publications - Michele Grossi
European Organization for Nuclear Research (CERN)
3 shared publications - David Francisco Rentería Estrada
Instituto de Física Corpuscular, Universitat de València—Consejo Superior de Investigaciones Científicas, Parc Científic, E-46980 Paterna, Valencia, Spain
2 shared publications - Andrés Ernesto Rentería-Olivo
Instituto de Fisica Corpuscular
1 shared publication David F. Renteria-Estrada
1 shared publication
Latest Publications
- Open Access
- 22 May 2026
- Published by Springer Nature in Communications Physics
Unlocking multidimensional integration with quantum adaptive importance sampling
- 22 May 2026
- Published by Springer Nature in Communications Physics
Open AccessUnlocking multidimensional integration with quantum adaptive importance sampling
- Open Access
- 19 November 2025
- Published by Springer Nature in Communications Physics
- Vol. 8 (1)
Quantum Chebyshev probabilistic models for fragmentation functions
- 19 November 2025
- Published by Springer Nature in Communications Physics
- Vol. 8 (1)
Open AccessQuantum Chebyshev probabilistic models for fragmentation functions
- Open Access
- 12 February 2025
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (2) , 025026
Quantum integration of decay rates at second order in perturbation theory
We present the first quantum computation of a total decay rate in high-energy physics at second order in perturbative quantum field theory. This work underscores the confluence of two recent cutting-edge advances. On the one hand, the quantum integration algorithm quantum Fourier iterative amplitude estimation, which efficiently decomposes the target function into its Fourier series through a quantum neural network before quantumly integrating the corresponding Fourier components. On the other hand, causal unitary in the loop-tree duality (LTD), which exploits the causal properties of vacuum amplitudes in LTD to coherently generate all contributions with different numbers of final-state particles to a scattering or decay process, leading to singularity-free integrands that are well suited for Fourier decomposition. We test the performance of the quantum algorithm with benchmark decay rates in a quantum simulator and in quantum hardware, and find accurate theoretical predictions in both settings.
- 12 February 2025
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (2) , 025026
Open AccessQuantum integration of decay rates at second order in perturbation theory
We present the first quantum computation of a total decay rate in high-energy physics at second order in perturbative quantum field theory. This work underscores the confluence of two recent cutting-edge advances. On the one hand, the quantum integration algorithm quantum Fourier iterative amplitude estimation, which efficiently decomposes the target function into its Fourier series through a quantum neural network before quantumly integrating the corresponding Fourier components. On the other hand, causal unitary in the loop-tree duality (LTD), which exploits the causal properties of vacuum amplitudes in LTD to coherently generate all contributions with different numbers of final-state particles to a scattering or decay process, leading to singularity-free integrands that are well suited for Fourier decomposition. We test the performance of the quantum algorithm with benchmark decay rates in a quantum simulator and in quantum hardware, and find accurate theoretical predictions in both settings.
- Open Access
- 21 January 2025
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2025 (1) , 1-24
Vacuum amplitudes and time-like causal unitary in the loop-tree duality
A bstract: We present the first proof-of-concept application to decay processes at higher perturbative orders of loop-tree duality (LTD) causal unitary, a novel methodology that exploits the causal properties of vacuum amplitudes in the LTD and is directly well-defined in the four physical dimensions of the space-time. The generation of loop- and tree-level contributions to the differential decay rates from a kernel multiloop vacuum amplitude is shown in detail, and explicit expressions are presented for selected processes that are suitable for a lightweight understanding of the method. Specifically, we provide a clear physical interpretation of the local cancellation of soft, collinear and threshold singularities, and of the local renormalisation of ultraviolet singularities. The presentation is illustrated with numerical results that showcase the advantages of the method.
- 21 January 2025
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2025 (1) , 1-24
Open AccessVacuum amplitudes and time-like causal unitary in the loop-tree duality
A bstract: We present the first proof-of-concept application to decay processes at higher perturbative orders of loop-tree duality (LTD) causal unitary, a novel methodology that exploits the causal properties of vacuum amplitudes in the LTD and is directly well-defined in the four physical dimensions of the space-time. The generation of loop- and tree-level contributions to the differential decay rates from a kernel multiloop vacuum amplitude is shown in detail, and explicit expressions are presented for selected processes that are suitable for a lightweight understanding of the method. Specifically, we provide a clear physical interpretation of the local cancellation of soft, collinear and threshold singularities, and of the local renormalisation of ultraviolet singularities. The presentation is illustrated with numerical results that showcase the advantages of the method.
- Open Access
- 13 January 2025
- Published by IOP Publishing in Quantum Science and Technology
Quantum integration of decay rates at second order in perturbation theory
We present the first quantum computation of a total decay rate in high-energy physics at second order in perturbative quantum field theory. This work underscores the confluence of two recent cutting-edge advances. On the one hand, the quantum integration algorithm Quantum Fourier Iterative Amplitude Estimation (QFIAE), which efficiently decomposes the target function into its Fourier series through a quantum neural network before quantumly integrating the corresponding Fourier components. On the other hand, causal unitary in the loop-tree duality (LTD), which exploits the causal properties of vacuum amplitudes in LTD to coherently generate all contributions with different numbers of final-state particles to a scattering or decay process, leading to singularity-free integrands that are well suited for Fourier decomposition. We test the performance of the quantum algorithm with benchmark decay rates in a quantum simulator and in quantum hardware, and find accurate theoretical predictions in both settings.
- 13 January 2025
- Published by IOP Publishing in Quantum Science and Technology
Open AccessQuantum integration of decay rates at second order in perturbation theory
We present the first quantum computation of a total decay rate in high-energy physics at second order in perturbative quantum field theory. This work underscores the confluence of two recent cutting-edge advances. On the one hand, the quantum integration algorithm Quantum Fourier Iterative Amplitude Estimation (QFIAE), which efficiently decomposes the target function into its Fourier series through a quantum neural network before quantumly integrating the corresponding Fourier components. On the other hand, causal unitary in the loop-tree duality (LTD), which exploits the causal properties of vacuum amplitudes in LTD to coherently generate all contributions with different numbers of final-state particles to a scattering or decay process, leading to singularity-free integrands that are well suited for Fourier decomposition. We test the performance of the quantum algorithm with benchmark decay rates in a quantum simulator and in quantum hardware, and find accurate theoretical predictions in both settings.
- Open Access
- 25 October 2024
- Published by American Physical Society (APS) in Physical Review D
- Vol. 110 (7)
Loop Feynman integration on a quantum computer
This work investigates in detail the performance and advantages of a new quantum Monte Carlo integrator, dubbed quantum Fourier iterative amplitude estimation (QFIAE), to numerically evaluate for the first time loop Feynman integrals in a near-term quantum computer and a quantum simulator. In order to achieve a quadratic speedup, QFIAE introduces a quantum neural network (QNN) that efficiently decomposes the multidimensional integrand into its Fourier series. For a one-loop tadpole Feynman diagram, we have successfully implemented the quantum algorithm on a real quantum computer and obtained a reasonable agreement with the analytical values. One-loop Feynman diagrams with more external legs have been analyzed in a quantum simulator. These results thoroughly illustrate how our quantum algorithm effectively estimates loop Feynman integrals and the method employed could also find applications in other fields such as finance, artificial intelligence, or other physical sciences. Published by the American Physical Society 2024
- 25 October 2024
- Published by American Physical Society (APS) in Physical Review D
- Vol. 110 (7)
Open AccessLoop Feynman integration on a quantum computer
This work investigates in detail the performance and advantages of a new quantum Monte Carlo integrator, dubbed quantum Fourier iterative amplitude estimation (QFIAE), to numerically evaluate for the first time loop Feynman integrals in a near-term quantum computer and a quantum simulator. In order to achieve a quadratic speedup, QFIAE introduces a quantum neural network (QNN) that efficiently decomposes the multidimensional integrand into its Fourier series. For a one-loop tadpole Feynman diagram, we have successfully implemented the quantum algorithm on a real quantum computer and obtained a reasonable agreement with the analytical values. One-loop Feynman diagrams with more external legs have been analyzed in a quantum simulator. These results thoroughly illustrate how our quantum algorithm effectively estimates loop Feynman integrals and the method employed could also find applications in other fields such as finance, artificial intelligence, or other physical sciences. Published by the American Physical Society 2024
- Open Access
Quantum jet clustering with LHC simulated data
We study the case where quantum computing could improve jet clustering by considering two new quantum algorithms that might speed up classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based distance between two data points, while the second one consists of a quantum circuit to track the rough maximum into a list of unsorted data. When one or both algorithms are implemented in classical versions of well-known clustering algorithms (K-means, Affinity Propagation and $k_T$-jet) we obtain efficiencies comparable to those of their classical counterparts. Furthermore, in the first two algorithms, an exponential speed up in dimensionality and data length can be achieved when applying the distance or the maximum search algorithm. In the $k_T$ algorithm, a quantum version of the same order as FastJet is achieved.Open AccessQuantum jet clustering with LHC simulated data
We study the case where quantum computing could improve jet clustering by considering two new quantum algorithms that might speed up classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based distance between two data points, while the second one consists of a quantum circuit to track the rough maximum into a list of unsorted data. When one or both algorithms are implemented in classical versions of well-known clustering algorithms (K-means, Affinity Propagation and $k_T$-jet) we obtain efficiencies comparable to those of their classical counterparts. Furthermore, in the first two algorithms, an exponential speed up in dimensionality and data length can be achieved when applying the distance or the maximum search algorithm. In the $k_T$ algorithm, a quantum version of the same order as FastJet is achieved. - Open Access
- 23 August 2022
- Published by American Physical Society (APS) in Physical Review D
- Vol. 106 (3) , 036021
Quantum clustering and jet reconstruction at the LHC
Clustering is one of the most frequent problems in many domains, in particular, in particle physics where jet reconstruction is central in experimental analyses. Jet clustering at the CERN’s Large Hadron Collider (LHC) is computationally expensive and the difficulty of this task will increase with the upcoming High-Luminosity LHC (HL-LHC). In this paper, we study the case in which quantum computing algorithms might improve jet clustering by considering two novel quantum algorithms which may speed up the classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based distance between two data points, whereas the second one consists of a quantum circuit to track the maximum into a list of unsorted data. The latter algorithm could be of value beyond particle physics, for instance in statistics. When one or both of these algorithms are implemented into the classical versions of well-known clustering algorithms (K-means, affinity propagation, and -jet) we obtain efficiencies comparable to those of their classical counterparts. Even more, exponential speed-up could be achieved, in the first two algorithms, in data dimensionality and data length when the distance algorithm or the maximum searching algorithm are applied.- 23 August 2022
- Published by American Physical Society (APS) in Physical Review D
- Vol. 106 (3) , 036021
Open AccessQuantum clustering and jet reconstruction at the LHC
Clustering is one of the most frequent problems in many domains, in particular, in particle physics where jet reconstruction is central in experimental analyses. Jet clustering at the CERN’s Large Hadron Collider (LHC) is computationally expensive and the difficulty of this task will increase with the upcoming High-Luminosity LHC (HL-LHC). In this paper, we study the case in which quantum computing algorithms might improve jet clustering by considering two novel quantum algorithms which may speed up the classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based distance between two data points, whereas the second one consists of a quantum circuit to track the maximum into a list of unsorted data. The latter algorithm could be of value beyond particle physics, for instance in statistics. When one or both of these algorithms are implemented into the classical versions of well-known clustering algorithms (K-means, affinity propagation, and -jet) we obtain efficiencies comparable to those of their classical counterparts. Even more, exponential speed-up could be achieved, in the first two algorithms, in data dimensionality and data length when the distance algorithm or the maximum searching algorithm are applied.