collaborators

7 papers

quant-ph2026

Unconditionally successful quantum Time-Marching algorithm via LCU for nonlinear Burgers equation

Niccolo Fonio, Giuseppe Di Molfetta, Pierre Sagaut

Most recently proposed quantum algorithms for solving linear and nonlinear partial differential equations rely on non-unitary operations. These operations are typically implemented…

quant-ph2026

Qubit-Boson Hybrid Beam-Splitter Gate with Kerr Nonlinearity in Circuit QED for Many-Body Dynamics

Andrea Mammola, Giuseppe Di Molfetta, Quentin Schaeverbeke

We introduce a hybrid qubit-boson beam-splitter gate in which a microwave cavity mode couples to an exchange-dressed two-level subsystem of an interacting two-qubit system in the p…

quant-ph2026

Two-dimensional quantum lattice gas algorithm for anisotropic Burger-like equations

Niccoló Fonio, Pierre Sagaut, Giuseppe Di Molfetta

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 analyt…

quant-ph2025

Noisy simulations of Quantum Walk and Quantum Walk search via Quantum Cellular Automata on a semiconducting spin processor emulator

Andrea Mammola, Quentin Schaeverbeke, Giuseppe Di Molfetta

In this work we map NISQ-friendly implementations of the non-interacting QCA to a circuit Quantum Electrodynamics (cQED) hardware. We perform both noiseless and noisy simulations o…

quant-ph2025

Non-unitary enhanced transfer efficiency in quantum walk search on complex networks

Ugo Nzongani, Andrea Simonetto, Giuseppe Di Molfetta

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 us…

quant-ph2025

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization

Ugo Nzongani, Dylan Laplace Mermoud, Giuseppe Di Molfetta +1

We introduce SamBa-GQW, a novel quantum algorithm for solving binary combinatorial optimization problems of arbitrary degree with no use of any classical optimizer. The algorithm i…