arXiv subjects

Fabrice Debbasch

Publications and source records attributed to Fabrice Debbasch.

At least 19 recordsLinked to original sources

arXiv2026

Quantum algorithm for anisotropic diffusion and convection equations with vector norm scaling

In this work, we tackle the resolution of partial differential equations (PDEs) on digital quantum computers. Two fundamental PDEs are addressed: the anisotropic diffusion equation and the anisotropic convection equation. We present a quantum numerical scheme consisting of three steps: quantum state preparation, evolution with diagonal operators, and measurement of observables of interest. The evolution step relies on a high-order centered finite difference and a product formula approximation, also known as Trotterization. We provide novel vector-norm analysis to bound the different sources of error. We prove that the number of time-steps required in the evolution can be reduced by a factor $\Theta (16^n)$ for the diffusion equation, and $\Theta (4^n)$ for the convection equation, where $n$ is the number of qubits per dimension, an exponential reduction compared to the previously established operator-norm analysis.

quant-ph↗

arXiv2025

Trotter-based quantum algorithm for solving transport equations with exponentially fewer time-steps

The extent to which quantum computers can simulate physical phenomena and solve the partial differential equations (PDEs) that govern them remains a central open question. In this work, one of the most fundamental PDEs is addressed: the multidimensional transport equation with space- and time-dependent coefficients. We present a quantum numerical scheme based on three steps: quantum state preparation, evolution, and measurement of relevant observables. The evolution step combines a high-order centered finite difference with a time-splitting scheme based on product formula approximations, also known as Trotterization. We introduce novel vector-norm analysis and prove that the number of time-steps can be reduced by a factor exponential in the number of qubits compared to previously established operator-norm analysis, thereby significantly lowering the projected computational resources. We also present efficient quantum circuits and numerical simulations that confirm the predicted vector-norm scaling. We report results on real quantum hardware for the one-dimensional convection equation, and solve a non-linear ordinary differential equation via its associated Liouville equation, a particular case of transport equations. This work provides a practical framework for efficiently simulating transport phenomena on quantum computers, with potential applications in plasma physics, molecular gas dynamics and non-linear dynamical systems, including chaotic systems.

quant-ph↗

arXiv2024

Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy trade-offs

Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms with applications in the resolution of partial differential equations, Hamiltonian simulations, the loading of classical data on quantum computers (quantum state preparation) and many others. In this paper, we introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits. The depth, i.e., the number of layers of quantum gates of the quantum circuit, is reducible with respect either to the width, i.e, the number of ancilla qubits, or to the accuracy between the implemented operator and the target one. While exact methods have an optimal exponential scaling either in terms of size, i.e., the total number of primitive quantum gates, or width, approximate methods prove to be efficient for the class of diagonal operators depending on smooth, at least differentiable, functions. Our approach is general enough to allow any method for diagonal operators to become adjustable-depth or approximate, decreasing the depth of the circuit by increasing its width or its approximation level. This feature offers flexibility and can match with the hardware limitations in coherence time or cumulative gate error. We illustrate these methods by performing quantum state preparation and non-unitary-real-space simulation of the diffusion equation. This simulation paves the way to efficient implementations of stochastic models useful in physics, chemistry, biology, image processing and finance.

quant-ph↗

arXiv2023

Polylogarithmic-depth controlled-NOT gates without ancilla qubits

Controlled operations are fundamental building blocks of quantum algorithms. Decomposing $n$-control-NOT gates ($C^n(X)$) into arbitrary single-qubit and CNOT gates, is a crucial but non-trivial task. This study introduces $C^n(X)$ circuits outperforming previous methods in the asymptotic and non-asymptotic regimes. Three distinct decompositions are presented: an exact one using one borrowed ancilla with a circuit depth $\Theta\left(\log(n)^{3}\right)$, an approximating one without ancilla qubits with a circuit depth $\mathcal O \left(\log(n)^{3}\log(1/\epsilon)\right)$ and an exact one with an adjustable-depth circuit which decreases with the number $m\leq n$ of ancilla qubits available as $O(log(2n/m)^3+log(m/2))$. The resulting exponential speedup is likely to have a substantial impact on fault-tolerant quantum computing by improving the complexities of countless quantum algorithms with applications ranging from quantum chemistry to physics, finance and quantum machine learning.

quant-ph↗

arXiv2023

Space-Time from quantum Physics

A construction of the real 4D Minkowski space-time starting from quantum harmonic oscillators is proposed. First, a 2D spinor space and its dual are derived from the standard commutation relations obeyed by the ladder operators of two independent 1D harmonic oscillators. The complex 4D Minkowvski vector space V is then constructed from these spinor space. The flat, real 4D Minkowski manifold is finally built as an approximate description of a manifold of unitary operators constructed from V. Lorentz invariance is recovered and several possible extensions are discussed, which connections to quantum optics and condensed matter physics.

gr-qc↗

arXiv2023

Efficient Quantum State Preparation with Walsh Series

A new approximate Quantum State Preparation (QSP) method is introduced, called the Walsh Series Loader (WSL). The WSL approximates quantum states defined by real-valued functions of single real variables with a depth independent of the number $n$ of qubits. Two approaches are presented: the first one approximates the target quantum state by a Walsh Series truncated at order $O(1/\sqrt{\epsilon})$, where $\epsilon$ is the precision of the approximation in terms of infidelity. The circuit depth is also $O(1/\sqrt{\epsilon})$, the size is $O(n+1/\sqrt{\epsilon})$ and only one ancilla qubit is needed. The second method represents accurately quantum states with sparse Walsh series. The WSL loads $s$-sparse Walsh Series into $n$-qubits with a depth doubly-sparse in $s$ and $k$, the maximum number of bits with value $1$ in the binary decomposition of the Walsh function indices. The associated quantum circuit approximates the sparse Walsh Series up to an error $\epsilon$ with a depth $O(sk)$, a size $O(n+sk)$ and one ancilla qubit. In both cases, the protocol is a Repeat-Until-Success (RUS) procedure with a probability of success $P=\Theta(\epsilon)$, giving an averaged total time of $O(1/\epsilon^{3/2})$ for the WSL (resp. $O(sk/\epsilon)$ for the sparse WSL). Amplitude amplification can be used to reduce by a factor $O(1/\sqrt{\epsilon})$ the total time dependency with $\epsilon$ but increases the size and depth of the associated quantum circuits, making them linearly dependent on $n$. These protocols give overall efficient algorithms with no exponential scaling in any parameter. They can be generalized to any complex-valued, multi-variate, almost-everywhere-differentiable function. The Repeat-Until-Success Walsh Series Loader is so far the only method which prepares a quantum state with a circuit depth and an averaged total time independent of the number of qubits.

quant-ph↗

arXiv2022

Quantum circuits for discrete-time quantum walks with position-dependent coin operator

The aim of this paper is to build quantum circuits that implement discrete-time quantum walks having an arbitrary position-dependent coin operator. The position of the walker is encoded in base 2: with $n$ wires, each corresponding to one qubit, we encode $2^n$ position states. The data necessary to define an arbitrary position-dependent coin operator is therefore exponential in $n$. We first propose a circuit implementing the position-dependent coin operator, that is naive, in the sense that it has exponential depth and implements sequentially all appropriate position-dependent coin operators. We then propose a circuit that "transfers" all the depth into ancillae, yielding a final depth that is linear in $n$ at the cost of an exponential number of ancillae. The main idea of this linear-depth circuit is to implement in parallel all coin operators at the different positions. Finally, we extend the result of Ref. [2] from position-dependent unitaries which are diagonal in the position basis to position-dependent $2 \times 2$-block-diagonal unitaries: indeed, we show that for a position dependence of the coin operator (the block-diagonal unitary) which is smooth enough, one can find an efficient quantum-circuit implementation approximating the coin operator up to an error $\epsilon$ (in terms of the spectral norm), the depth and size of which scale as $O(1/\epsilon)$. A typical application of the efficient implementation would be the quantum simulation of a relativistic spin-1/2 particle on a lattice, coupled to a smooth external gauge field; notice that recently, quantum spatial-search schemes have been developed which use gauge fields as the oracle, to mark the vertex to be found [3, 4]. A typical application of the linear-depth circuit would be when there is spatial noise on the coin operator (and hence a non-smooth dependence in the position).

quant-ph↗

arXiv2022

Quantum spatial search with electric potential : long-time dynamics and robustness to noise

We present various results on the scheme introduced , which is a quantum spatial-search algorithm on a two-dimensional (2D) square spatial grid, realized with a 2D Dirac discrete-time quantum walk (DQW) coupled to a Coulomb electric field centered on the marked node. In such a walk, the electric term acts as the oracle of the algorithm, and the free walk (i.e., without electric term) acts as the "diffusion" part, as it is called in Grover's algorithm. The results are the following. First, we run simulations of this electric Dirac DQW during longer times than explored in Ref.\ \cite{ZD21}, and observe that there is a second localization peak around the node marked by the oracle, reached in a time $O(\sqrt{N})$, where $N$ is the number of nodes of the 2D grid, with a localization probability scaling as $O(1/\ln N)$. This matches the state-of-the-art 2D DQW search algorithms before amplitude amplification. We then study the effect of adding noise on the Coulomb potential, and observe that the walk, especially the second localization peak, is highly robust to spatial noise, more modestly robust to spatiotemporal noise, and that the first localization peak is even highly robust to spatiotemporal noise.

quant-ph↗

arXiv2022

Minimal quantum walk simulation of Dirac fermions in curved space-times

The problem of simulating through quantum walks Dirac fermions in arbitrary curved space-times and coordinates is revisited, taking (1 + 1)D space-times as an example. A new shift or translation operator on the grid is introduced, to take into account arbitrary geometries. The new, generalised quantum walks built with this operator can simulate Dirac fermions in arbitrary curved space-times and coordinates, and their wave functions have exactly the same number of components as standard Dirac spinors, and not twice that number, as previously believed. In particular, in $(1 + 1)$D space-times, only one qubit is needed at each lattice point, which makes it easier to perform quantum simulations of the Dirac dynamics on current NISQs quantum devices. Numerical simulations of the Dirac dynamics in the post Newtonian, so-called Gravitoelectromagnetism regime are presented as an illustration.

quant-ph↗

arXiv2022

Hybrid Quantum-Classical Algorithm for Hydrodynamics

A new model of nonlinear charged quantum relativistic fluids is presented. This model can be discretized into Discrete Time Quantum Walks (DTQWs), and a new hybrid (quantum-classical) algorithm for implementing these walks on NISQ devices is proposed. High resolution (up to $N=2^{17}$ grid points) hybrid numerical simulations of relativistic and non-relativistic hydrodynamical shocks on current IBM NISQs are performed with this algorithm and shown to reproduce equivalent simulations on classical computers. This work demonstrates that nonlinear fluid dynamics can be simulated on NISQs, and opens the door to simulating other, quantum and non-quantum fluids, including plasmas, with more general quantum walks and quantum automata.

quant-ph↗

arXiv2020

Simulating Non Commutative Geometry with Quantum Walks

Non Commutative Geometry (NCG) is considered in the context of a charged particle moving in a uniform magnetic field. The classical and quantum mechanical treatments are revisited and a new marker of NCG is introduced. This marker is then used to investigate NCG in magnetic Quantum Walks. It is proven that these walks exhibit NCG at and near the continuum limit. For the purely discrete regime, two illustrative walks of different complexities are studied in full detail. The most complex walk does exhibit NCG but the simplest, most degenerate one does not. Thus, NCG can be simulated by QWs, not only in the continuum limit, but also in the purely discrete regime.

quant-ph↗

arXiv2020

Dirac quantum walks with conserved angular momentum

A Quantum Walk (QW) simulating the flat $(1 + 2)$D Dirac Eq.\ on a spatial polar grid is constructed. Because fermions are represented by spinors, which do not constitute a representation of the rotation group, but rather of its double cover, the QW can only be defined globally on an extended spacetime where the polar angle extends from $0$ to $4 \pi$. The coupling of the QW with arbitrary electromagnetic fields is also presented. Finally, the cylindrical relativistic Landau levels of the Dirac Eq.\ are computed explicitly and simulated by the QW.

quant-ph↗

arXiv2020

The Gambler's Ruin Problem and Quantum Measurement

The dynamics of a single microscopic or mesoscopic non quantum system interacting with a macroscopic environment is generally stochastic. In the same way, the reduced density operator of a single quantum system interacting with a macroscopic environment is a priori a stochastic variable, and decoherence describes only the average dynamics of this variable, not its fluctuations. It is shown that a general unbiased quantum measurement can be reformulated as a gambler's ruin problem where the game is a martingale. Born's rule then appears as a direct consequence of the optional stopping theorem for martingales. Explicit computations are worked out in detail on a specific simple example.

quant-ph↗

arXiv2019

Quantum simulation of quantum relativistic diffusion via quantum walks

Two models are first presented, of one-dimensional discrete-time quantum walk (DTQW) with temporal noise on the internal degree of freedom (i.e., the coin): (i) a model with both a coin-flip and a phase-flip channel, and (ii) a model with random coin unitaries. It is then shown that both these models admit a common limit in the spacetime continuum, namely, a Lindblad equation with Dirac-fermion Hamiltonian part and, as Lindblad jumps, a chirality flip and a chirality-dependent phase flip, which are two of the three standard error channels for a two-level quantum system. This, as one may call it, Dirac Lindblad equation, provides a model of quantum relativistic spatial diffusion, which is evidenced both analytically and numerically. This model of spatial diffusion has the intriguing specificity of making sense only with original unitary models which are relativistic in the sense that they have chirality, on which the noise is introduced: The diffusion arises via the by-construction (quantum) coupling of chirality to the position. For a particle with vanishing mass, the model of quantum relativistic diffusion introduced in the present work, reduces to the well-known telegraph equation, which yields propagation at short times, diffusion at long times, and exhibits no quantumness. Finally, the results are extended to temporal noises which depend smoothly on position.

quant-ph↗

arXiv2019

Relativistic Wigner Function for Quantum Walks

A relativistic Wigner function for free Discrete Time Quantum Walks (DTQWs) on the square $2D$ space-time lattice is defined. Useful concepts such as discrete derivatives and discrete distributions are also introduced. The transport equation obeyed by the relativistic Wigner function is obtained and degenerates at the continuous limit into the transport equation obeyed by the Wigner function of $2D$ Dirac fermions. The first corrections to the continuous equation induced by the discreteness of the lattice are also computed.

quant-ph↗

arXiv2019

Discrete Geometry from Quantum Walks

A particular family of Discrete Time Quantum Walks (DTQWs) simulating fermion propagation in $2$D curved space-time is revisited. Usual continuous covariant derivatives and spin-connections are generalized into discrete covariant derivatives along the lattice coordinates and discrete connections. The concepts of metrics and $2$-beins are also extended to the discrete realm. Two slightly different Riemann curvatures are then defined on the space-time lattice as the curvatures of the discrete spin connection. These two curvatures are closely related and one of them tends at the continuous limit towards the usual, continuous Riemann curvature. A simple example is also worked out in full.

quant-ph↗

arXiv2018

A new method to building Dirac quantum walks coupled to electromagnetic fields

A quantum walk whose continuous limit coincides with Dirac equation is usually called a Dirac Quantum Walk (DQW). A new systematic method to build DQWs coupled to electromagnetic (EM) fields is introduced and put to test on several examples of increasing difficulty. It is first used to derive the EM coupling of a well-known $3D$ walk on the cubic lattice. Recently introduced DQWs on the triangular and honeycomb lattice are then re-derived, showing for the first time that these are the only DQWs that can be defined with spinors living on the vertices of these lattices. As a third example of the method's effectiveness, a new $3D$ walk on a parallelepiped lattice is derived. As a fourth, negative example, it is shown that certain lattices like the rhombohedral lattice cannot be used to build DQWs. The effect of changing representation in the Dirac equation is also discussed.

quant-ph↗

arXiv2018

Action Principles for Quantum Automata and Lorentz Invariance of Discrete Time Quantum Walks

A discrete action principle for general quantum automata is proposed. This action principle is particularized to Discrete Time Quantum Walks (DTQWs) and then extended into an energy and momentum preserving, manifestly covariant formulation. Space-time coordinates are introduced as new variables of the action and their equations of motion enforce energy and momentum conservation. This guarantees that the proposed action can be used to build future, DTQW-based self-consistent models of spinors interacting with gauge fields. A discrete stress-energy tensor for the DTQW is also obtained by functional differentiation of the action with respect to the gradients of the coordinates viewed as functions of the discrete grid points. The manifest covariance of the formulation highlights the special role played by the grid reference frame in the DTQW dynamics. The main discussion is complemented by three appendices.

quant-ph↗