Giuseppe Di Molfetta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Giuseppe Di Molfetta has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Pablo Arrighi
Aix-Marseille University
10 shared publications - Armando Perez
Departamento de Física Teórica and IFIC Universidad de Valencia and CSIC Dr. Moliner 50 46100 Burjassot Spain
7 shared publications - Nathanaël Eon
Aix-Marseille Universite
6 shared publications Pablo Arrighi
Université Paris-Saclay, Inria, CNRS, LMF, 91190 Gif-sur-Yvette, France
6 shared publications- Iván Márquez-Martín
Aix-Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France and Departamento de Física Teórica and IFIC, Universidad de Valencia-CSIC, Dr. Moliner 50, 46100, Burjassot, Spain.
5 shared publications - Mathieu Roget
Université Aix-Marseille, Marseille, France
5 shared publications
Latest Publications
- 10 September 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (3) , 032426
Two-dimensional quantum-lattice-gas algorithm for anisotropic Burger-like equations
Building on hybrid quantum lattice gas algorithm, we revisit the possibilities of this quantum lattice model. By deriving a correction to the predicted viscosity, we provide analytical and numerical results that refine original formulation. We introduce a minimal two-dimensional generalization of the algorithm, which allows us to simulate anisotropic Burger-like equations while retaining only two lattice velocities. This approach opens a promising route toward embedding momentum conservation and advancing toward Navier-Stokestwo dynamics in two dimensions, going beyond Frisch, Hasslacher, and Pomeau and lattice Boltzmann method with a quantum native model. We highlight how the presented algorithm is more efficient for full state evolution than other quantum nonlinear solvers, nonetheless we clarify its advantages compared to classical lattice gas methods. Being that this model is between classical and quantum computation, it gives a unique perspective on simulating nonlinearities with quantum computers, confirming quantum lattice gas models as a crucial playground for quantum simulations of nonlinearities.
- 10 September 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (3) , 032426
Two-dimensional quantum-lattice-gas algorithm for anisotropic Burger-like equations
Building on hybrid quantum lattice gas algorithm, we revisit the possibilities of this quantum lattice model. By deriving a correction to the predicted viscosity, we provide analytical and numerical results that refine original formulation. We introduce a minimal two-dimensional generalization of the algorithm, which allows us to simulate anisotropic Burger-like equations while retaining only two lattice velocities. This approach opens a promising route toward embedding momentum conservation and advancing toward Navier-Stokestwo dynamics in two dimensions, going beyond Frisch, Hasslacher, and Pomeau and lattice Boltzmann method with a quantum native model. We highlight how the presented algorithm is more efficient for full state evolution than other quantum nonlinear solvers, nonetheless we clarify its advantages compared to classical lattice gas methods. Being that this model is between classical and quantum computation, it gives a unique perspective on simulating nonlinearities with quantum computers, confirming quantum lattice gas models as a crucial playground for quantum simulations of nonlinearities.
- 14 July 2026
- Published by Springer Nature in Natural Computing
- Vol. 25 (2) , 24
A quantum walk inspired model for distributed computing on arbitrary graphs
- 14 July 2026
- Published by Springer Nature in Natural Computing
- Vol. 25 (2) , 24
A quantum walk inspired model for distributed computing on arbitrary graphs
- Open Access
- 19 June 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (2)
On quantum perceptron learning via quantum search
With the growing interest in quantum machine learning, the perceptron, a fundamental building block in traditional machine learning, has emerged as a valuable model for exploring the potential of quantum algorithms. In this work, we make two principal contributions. First, we revisit the quantum version space perceptron algorithm proposed by Kapoor et al. (2016), by identifying and correcting a flawed complexity assumption. We show that the query complexity of the algorithm is dimension-dependent, which has significant implications for its behaviour in high-dimensional regimes under worst-case scenarios. Second, we propose and analyse two quantum-enhanced cutting-plane algorithms for perceptron learning. Specifically, we leverage established quantum subroutines such as Grover’s search and quantum walk search , and provide detailed algorithmic constructions together with query and arithmetic complexity analyses. Our results establish improved complexity bounds under an idealised implementation framework and noise-free quantum computational models, offering insights into the trade-offs between margin dependence, dimensional dependence, and quantum resources. These findings provide a refined understanding of quantum perceptron models and their theoretical computational complexity properties.
- 19 June 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (2)
Open AccessOn quantum perceptron learning via quantum search
With the growing interest in quantum machine learning, the perceptron, a fundamental building block in traditional machine learning, has emerged as a valuable model for exploring the potential of quantum algorithms. In this work, we make two principal contributions. First, we revisit the quantum version space perceptron algorithm proposed by Kapoor et al. (2016), by identifying and correcting a flawed complexity assumption. We show that the query complexity of the algorithm is dimension-dependent, which has significant implications for its behaviour in high-dimensional regimes under worst-case scenarios. Second, we propose and analyse two quantum-enhanced cutting-plane algorithms for perceptron learning. Specifically, we leverage established quantum subroutines such as Grover’s search and quantum walk search , and provide detailed algorithmic constructions together with query and arithmetic complexity analyses. Our results establish improved complexity bounds under an idealised implementation framework and noise-free quantum computational models, offering insights into the trade-offs between margin dependence, dimensional dependence, and quantum resources. These findings provide a refined understanding of quantum perceptron models and their theoretical computational complexity properties.
- 1 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Discrete time quantum walks : from synthetic gauge fields to spontaneous equilibration
Marches quantiques à temps discret : des champs de jauge à l'équilibration spontanée: Les simulateurs quantiques, qui utilisent un système quantique contrôlable pour étudier le comportement et les propriétés d'un autre système quantique, moins accessible, sont une ressource prometteuse. Dans les dernières années, des progrès significatifs ont été faits dans de nombreux domaines expérimentaux et théoriques. Les marches quantiques à temps discret sont des systèmes simples et sophistiqués. En particulier, il a été montré qu'à la limite continue, ces marches peuvent simuler certaines théories de champs. Dans ce travail de thèse, lesdites marches sont utilisées pour explorer certains sujets d'intérêt physique, qui s'articulent autour de trois axes : (i) la connexion entre les propriétés géométriques de la marche et celles de divers champs de jauge ; (ii) la limite classique et la limite quasi-quantique, en relation surtout avec les théories de champs ; (iii) l'équilibration spontanée pour certains modèles non linéaires de marches quantiques. Chaque résultat est appuyé par une étude numérique et analytique.
- 1 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Discrete time quantum walks : from synthetic gauge fields to spontaneous equilibration
Marches quantiques à temps discret : des champs de jauge à l'équilibration spontanée: Les simulateurs quantiques, qui utilisent un système quantique contrôlable pour étudier le comportement et les propriétés d'un autre système quantique, moins accessible, sont une ressource prometteuse. Dans les dernières années, des progrès significatifs ont été faits dans de nombreux domaines expérimentaux et théoriques. Les marches quantiques à temps discret sont des systèmes simples et sophistiqués. En particulier, il a été montré qu'à la limite continue, ces marches peuvent simuler certaines théories de champs. Dans ce travail de thèse, lesdites marches sont utilisées pour explorer certains sujets d'intérêt physique, qui s'articulent autour de trois axes : (i) la connexion entre les propriétés géométriques de la marche et celles de divers champs de jauge ; (ii) la limite classique et la limite quasi-quantique, en relation surtout avec les théories de champs ; (iii) l'équilibration spontanée pour certains modèles non linéaires de marches quantiques. Chaque résultat est appuyé par une étude numérique et analytique.
- Open Access
- 2 February 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Noisy simulations of quantum walk and quantum walk search via quantum cellular automata on a semiconducting spin processor emulator
In this work, we map noisy intermediate-scale quantum (NISQ)-friendly implementations of the noninteracting quantum cellular automata (QCA) to a circuit quantum electrodynamics (cQED) hardware. We perform both noiseless and noisy simulations of the QCA one-particle sector, namely, the quantum walk, on N -cycles and N × N torus graphs. Moreover, within this framework, we also investigate the search problem and present a circuit for preparing the state (i.e., the Dicke state with Hamming weight 1) using only 1 iSWAP gates and no ancilla qubits. The noiseless simulations are conducted with the Qiskit Aer simulator, while the noisy simulations with C12 Quantum Electronics’ in-house noisy emulator, . We benchmark the performance of our implementations by analyzing the simulations via relevant metrics and quantities such as the state count distributions, the Hellinger fidelity, the ℓ 1 distance, the hitting time, and the success probability. Our results demonstrate that the QCA framework, in combination with cQED processors, holds promise as an effective platform for early NISQ implementations of quantum walk and quantum walk search algorithms.
- 2 February 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Open AccessNoisy simulations of quantum walk and quantum walk search via quantum cellular automata on a semiconducting spin processor emulator
In this work, we map noisy intermediate-scale quantum (NISQ)-friendly implementations of the noninteracting quantum cellular automata (QCA) to a circuit quantum electrodynamics (cQED) hardware. We perform both noiseless and noisy simulations of the QCA one-particle sector, namely, the quantum walk, on N -cycles and N × N torus graphs. Moreover, within this framework, we also investigate the search problem and present a circuit for preparing the state (i.e., the Dicke state with Hamming weight 1) using only 1 iSWAP gates and no ancilla qubits. The noiseless simulations are conducted with the Qiskit Aer simulator, while the noisy simulations with C12 Quantum Electronics’ in-house noisy emulator, . We benchmark the performance of our implementations by analyzing the simulations via relevant metrics and quantities such as the state count distributions, the Hellinger fidelity, the ℓ 1 distance, the hitting time, and the success probability. Our results demonstrate that the QCA framework, in combination with cQED processors, holds promise as an effective platform for early NISQ implementations of quantum walk and quantum walk search algorithms.
- Open Access
Noisy-enhanced quantum search on complex networks
The task of finding an element in an unstructured database is known as spatial search and can be expressed as a quantum walk evolution on a graph. In this article, we modify the usual search problem by adding an extra trapping vertex to the graph, which is only connected to the target element. The walker evolution is a mix between classical and quantum walk search dynamics. The balance between unitary and non-unitary dynamics is tuned with a parameter, and we numerically show that depending on the graph topology and the connectivity of the target element, this hybrid approach can outperform a purely classical or quantum evolution for reaching the trapping site. We show that this behavior is only observed in the presence of an extra trapping site, and that depending on the topology, the increase of non-unitary operations can be compensated by increasing the strength of the quantum walk exploration. This compensation comes at the cost of reducing the searching feature of the evolution induced by the Hamiltonian. We also relate the optimal hybrid regime to the entropy's decay rate. As the introduction of non-unitary operations may be considered as noise, we interpret this phenomena as a noisy-assisted quantum evolution.
Open AccessNoisy-enhanced quantum search on complex networks
The task of finding an element in an unstructured database is known as spatial search and can be expressed as a quantum walk evolution on a graph. In this article, we modify the usual search problem by adding an extra trapping vertex to the graph, which is only connected to the target element. The walker evolution is a mix between classical and quantum walk search dynamics. The balance between unitary and non-unitary dynamics is tuned with a parameter, and we numerically show that depending on the graph topology and the connectivity of the target element, this hybrid approach can outperform a purely classical or quantum evolution for reaching the trapping site. We show that this behavior is only observed in the presence of an extra trapping site, and that depending on the topology, the increase of non-unitary operations can be compensated by increasing the strength of the quantum walk exploration. This compensation comes at the cost of reducing the searching feature of the evolution induced by the Hamiltonian. We also relate the optimal hybrid regime to the entropy's decay rate. As the introduction of non-unitary operations may be considered as noise, we interpret this phenomena as a noisy-assisted quantum evolution.
- Open Access
A quantum walk inspired model for distributed computing on arbitrary graphs
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This work introduces a model of distributed computation for arbitrary graphs inspired by quantum cellular automata. As a by-product, we show how this model can reproduce the dynamic of a quantum walk on graphs. In this context, we investigate the communication cost for two interaction schemes. Finally, we explain how this particular quantum walk can be applied to solve the search problem and present numerical results on different types of topologies.
Open AccessA quantum walk inspired model for distributed computing on arbitrary graphs
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This work introduces a model of distributed computation for arbitrary graphs inspired by quantum cellular automata. As a by-product, we show how this model can reproduce the dynamic of a quantum walk on graphs. In this context, we investigate the communication cost for two interaction schemes. Finally, we explain how this particular quantum walk can be applied to solve the search problem and present numerical results on different types of topologies.
- 16 October 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (4)
Dirac quantum walk on tetrahedra
- 16 October 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (4)
Dirac quantum walk on tetrahedra
- 19 April 2024
- Published by Springer Nature
- p. 72-83
A Quantum Walk-Based Scheme for Distributed Searching on Arbitrary Graphs
- 19 April 2024
- Published by Springer Nature
- p. 72-83
A Quantum Walk-Based Scheme for Distributed Searching on Arbitrary Graphs
- Open Access
Dirac quantum walk on tetrahedra
Discrete-time Quantum Walks (QWs) are transportation models of single quantum particles over a lattice. Their evolution is driven through causal and local unitary operators. QWs are a powerful tool for quantum simulation of fundamental physics as some of them have a continuum limit converging to well-known physics partial differential equations, such as the Dirac or the Schrödinger equation. In this work, we show how to recover the Dirac equation in (3+1)-dimensions with a QW evolving in a tetrahedral space. This paves the way to simulate the Dirac equation on a curved spacetime. This also suggests an ordered scheme for propagating matter over a spin network, of interest in Loop Quantum Gravity where matter propagation has remained an open problem.
Open AccessDirac quantum walk on tetrahedra
Discrete-time Quantum Walks (QWs) are transportation models of single quantum particles over a lattice. Their evolution is driven through causal and local unitary operators. QWs are a powerful tool for quantum simulation of fundamental physics as some of them have a continuum limit converging to well-known physics partial differential equations, such as the Dirac or the Schrödinger equation. In this work, we show how to recover the Dirac equation in (3+1)-dimensions with a QW evolving in a tetrahedral space. This paves the way to simulate the Dirac equation on a curved spacetime. This also suggests an ordered scheme for propagating matter over a spin network, of interest in Loop Quantum Gravity where matter propagation has remained an open problem.