Sergio Bengoechea

Dr. Sergio Bengoechea

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
10 December 2024 in Computers & Fluids
Verified
Journal Article
Open access
POPaul Over
Paul Over
SBSergio Bengoechea
Sergio Bengoechea
TRThomas Rung
Thomas Rung
FCFrancesco Clerici
Francesco Clerici
LSLeonardo Scandurra
Leonardo Scandurra
DJDieter Jaksch
Dieter Jaksch

1 July 2025 in Physical Review A
Verified
Journal Article
Open access
POPaul Over
Paul Over
SBSergio Bengoechea
Sergio Bengoechea
PBPeter Brearley
Peter Brearley
SLSylvain Laizet
Sylvain Laizet
TRThomas Rung
Thomas Rung
A quantum algorithm for simulating multidimensional scalar transport problems using a time-marching strategy is presented. A direct unitary block encoding of the explicit time-marching operator is constructed, resulting in the intrinsic success probability of the squared solution norm without the need for amplitude amplification, thereby retaining a linear dependence on the simulation time. The algorithm separates the explicit time-marching operator into an advection-like component and a corrective shift operator. The advection-like component is mapped to a Hamiltonian simulation and combined with the shift operator through the linear combination of unitaries algorithm. State-vector simulations of a scalar transported in a steady two-dimensional Taylor-Green vortex support the theoretical findings.

1 February 2026 in AIAA Journal
Verified
Journal Article
Closed access
SBSergio Bengoechea
Sergio Bengoechea
POPaul Over
Paul Over
DJDieter Jaksch
Dieter Jaksch
TRThomas Rung
Thomas Rung
This article proposes a variational quantum algorithm to solve linear and nonlinear thermofluid dynamic transport equations. The hybrid classical-quantum framework is applied to problems governed by the heat, wave, and Burgers’ equations in combination with different engineering boundary conditions. Topics covered include the encoding of band matrices, as in the consideration of nonconstant material properties and upwind-biased first- and higher-order approximations, widely used in engineering computational fluid dynamics, by the use of a mask function. Verification examples demonstrate high predictive agreement with classical methods. Furthermore, the scalability analysis shows a polylog scaling of the number of quantum gates with the number of qubits. Remaining challenges refer to the implicit construction of upwind schemes and the identification of an appropriate parameterization strategy of the quantum ansatz.

9 April 2026 in International Journal for Numerical Methods in Engineering
Verified
Journal Article
Open access
SBSergio Bengoechea
Sergio Bengoechea
POPaul Over
Paul Over
TRThomas Rung
Thomas Rung
This article presents the first complete application of a quantum time‐marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The method adapts the linear combination of unitaries algorithm to block encode the diffusive dynamics, while arbitrary boundary conditions are enforced by the method of images only at the cost of one additional qubit per spatial dimension. As an alternative to the nonperiodic reflection, the direct encoding of Neumann conditions by the unitary decomposition of the discrete time‐marching operator is proposed. All presented algorithms indicate optimal success probabilities while maintaining linear time complexity, thereby securing the practical applicability of the quantum algorithm on fault‐tolerant quantum computers. The proposed time‐marching method is demonstrated through state‐vector simulations of the heat equation in combination with Neumann, Dirichlet, and mixed boundary conditions, showing excellent agreement with classical finite differences.

6 November 2025 in arXiv
Verified
Preprint
Open access
PDF file
SBSergio Bengoechea
Sergio Bengoechea
POPaul Over
Paul Over
TRThomas Rung
Thomas Rung
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The method adapts the linear combination of unitaries algorithm to block encode the diffusive dynamics, while arbitrary boundary conditions are enforced by the method of images only at the cost of one additional qubit per spatial dimension. As an alternative to the non-periodic reflection, the direct encoding of Neumann conditions by the unitary decomposition of the discrete time-marching operator is proposed. All presented algorithms indicate optimal success probabilities while maintaining linear time complexity, thereby securing the practical applicability of the quantum algorithm on fault-tolerant quantum computers. The proposed time-marching method is demonstrated through state-vector simulations of the heat equation in combination with Neumann, Dirichlet, and mixed boundary conditions.

27 October 2026 in Quantum Science and Technology
Verified
Journal Article
Open access
POPaul Over
Paul Over
SBSergio Bengoechea
Sergio Bengoechea
LBLeonardo Borello Busilacchi
Leonardo Borello Busilacchi
MKMartin Kiffner
Martin Kiffner
TRThomas Rung
Thomas Rung
AMAlexios A Michailidis
Alexios A Michailidis
An efficient implementation of quantum algorithms is often hindered by the lack of efficient primitives for operators and state preparation. This limits both the ability of near-term quantum hardware to simulate complex problems and the potential of fault-tolerant algorithms to achieve practical quantum advantage. To address this, we propose a framework that maps discrete operators onto compact, structured quantum circuits. The resulting variational circuits can be tailored to the connectivity and long-range interaction of the target hardware. The learning process employs backpropagation together with a cost function that efficiently optimizes unitary operators and non-unitary—dense or sparse—operators using only a single ancilla qubit for block encoding. Additionally, we introduce a regularization term that reduces the approximation error. The approach is validated for both quantum mechanical and engineering applications. In the former case, we learn propagators that arise in native quantum problems—such as quantum simulation and quantum chemistry—and achieve improved resource scaling in comparison to standard Suzuki–Trotter expansions. In the latter case, we demonstrate the approach’s ability to implement the second-order central finite difference approximation of the Laplace operator—relevant for solving partial differential equations—while improving upon current error metrics. The final example deals with learning a dense, non-unitary operator that arises in the analysis of inviscid potential flow around an airfoil. These results motivate the extension of the framework to a broader class of operator-synthesis problems beyond the prototypical engineering and quantum applications considered here.