POPaul Over

Paul Over

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Paul Over has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Operator learning for efficient quantum computation

    by Paul Over, Sergio Bengoechea, Leonardo Borello Busilacchi, Martin Kiffner, Thomas Rung, 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.

  • Open Access

    Quantum Time‐Marching Algorithms for Solving Linear Transport Problems Including Boundary Conditions

    by Sergio Bengoechea, Paul Over, 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.


  • Top Cited Papers

    Toward Variational Quantum Algorithms for Generalized Linear and Nonlinear Transport Phenomena

    by Sergio Bengoechea, Paul Over, Dieter Jaksch, 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.


  • Open Access

    Quantum time-marching algorithms for solving linear transport problems including boundary conditions

    by Sergio Bengoechea, Paul Over, 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.

  • Open Access

    Quantum-Inspired Tensor-Network Fractional-Step Method for Incompressible Flow in Curvilinear Coordinates

    by Nis-Luca van Hülst, Pia Siegl, Paul Over, Sergio Bengoechea, Tomohiro Hashizume, Mario Guillaume Cecile, Thomas Rung, Dieter Jaksch

    We introduce an algorithmic framework based on tensor networks for computing fluid flows around immersed objects in curvilinear coordinates. We show that the tensor network simulations can be carried out solely using highly compressed tensor representations of the flow fields and the differential operators and discuss the numerical implementation of the tensor operations required for computing fluid flows in detail. The applicability of our method is demonstrated by applying it to the paradigm example of steady and transient flows around stationary and rotating cylinders. We find excellent quantitative agreement in comparison to finite difference simulations for Strouhal numbers, forces and velocity fields. The properties of our approach are discussed in terms of reduced order models. We estimate the memory saving and potential runtime advantages in comparison to standard finite difference simulations. We find accurate results with errors of less than 0.3% for flow-field compressions by a factor of up to 20 and differential operators compressed by factors of up to 1000 compared to sparse matrix representations. We provide strong numerical evidence that the runtime scaling advantages of the tensor network approach with system size will provide substantial resource savings when simulating larger systems. Finally, we note that, like other tensor network-based fluid flow simulations, our algorithmic framework is directly portable to a quantum computer leading to further scaling advantages.

  • Open Access

    Quantum algorithm for the advection-diffusion equation by direct block encoding of the time-marching operator

    by Paul Over, Sergio Bengoechea, Peter Brearley, Sylvain Laizet, 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.


  • Open Access

    Boundary treatment for variational quantum simulations of partial differential equations on quantum computers

    by Paul Over, Sergio Bengoechea, Thomas Rung, Francesco Clerici, Leonardo Scandurra, Eugene de Villiers, Dieter Jaksch


  • Open Access

    Creating a web-scale video collection for research

    by Paul Over, George Awad, Alan F. Smeaton, Colum Foley, James Lanagan

    This paper begins by considering a number of important design questions for a large-scale, widely available, multimedia test collection intended to support long-term scientific evaluation and comparison of content-based video analysis and exploitation systems. While the collection presented here is not quite web-scale, it is to our knowledge the largest video collection created to date. It is therefore of use in expanding the scale of any evaluation of multimedia collections and systems. Such exploitation systems would include the kinds of functionality already explored within the annual TREC Video Retrieval Evaluation (TRECVid) benchmarking activity such as search, semantic concept detection, and automatic summarization. We then report on our progress in creating such a multimedia collection from publicly available Internet Archive videos with Creative Commons licenses (IACC.1), which we hope will be a useful approximation of a web-scale collection and will support a next generation of benchmarking activities for content-based video operations. We also report on some possibilities for putting this collection to use in multimedia system evaluation. It is the intended that this collection be partitioned and used within the TRECVid 2010 evaluations, and in subsequent years to that.