JZJulien Zylberman

Julien Zylberman

*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


Julien Zylberman has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Quantum algorithms for partial differential equations : quantum circuits and physical applications

    by Julien Zylberman

    Algorithmes quantiques pour les équations aux dérivées partielles : circuits quantiques et applications physiques: Les simulations classiques actuelles des phénomènes physiques présentent de nombreuses limitations, en particulier lorsqu'il s'agit de systèmes complexes tels que les fluides turbulents, les plasmas ou les matériaux quantiques fortement corrélés. Ces simulations rencontrent souvent des difficultés liées à des coûts de calculs élevés, une mise à l'échelle limitée à travers plusieurs dimensions ou échelles temporelles, ainsi qu'à la complexité de capturer des dynamiques intrinsèquement non-linéaires ou chaotiques. Même avec l'accès à des ressources de calcul haute performance (HPC), la résolution précise des dynamiques à fine échelle ou des évolutions sur de longues périodes reste un défi majeur. Le développement de nouvelles méthodes numériques est donc essentiel, tant pour la recherche académique que pour les applications industrielles. Les ordinateurs quantiques émergent comme de nouveaux outils numériques pour l'étude de tels systèmes et la résolution des équations aux dérivées partielles qui les modélisent. Grâce aux propriétés de superposition et d'intrication des qubits, les calculs numériques peuvent être réalisés de manière inédite, offrant des avantages théoriques prometteurs pour certains problèmes. Dans ce contexte, cette thèse contribue au développement et à la compréhension des algorithmes quantiques, allant de la conception de circuits quantiques à la résolution numérique d'équations différentielles partielles et ordinaires. Dans une première partie, des circuits quantiques efficaces sont présentés pour l'implémentation de routines couramment utilisées dans les algorithmes quantiques (opérations multi-contrôlées, préparation d'états quantiques, opérations diagonales), ainsi que pour une nouvelle routine : la transformée de Laplace quantique. Ces routines limitaient l'efficacité des algorithmes quantiques en raison d'implémentations génériques dont la complexité croissait de manière exponentielle avec le nombre de qubits. Désormais, ces tâches peuvent être réalisées à l'aide de circuits quantiques adaptés qui exploitent la structure des problèmes physiques. Dans une seconde partie, des schémas numériques quantiques sont introduits pour résoudre des équations de transport anisotropes et des équations différentielles ordinaires hamiltoniennes non linéaires. Ces schémas se composent de trois étapes (initialisation, évolution et mesure) et reposent sur des approximations en différences finies d'ordre élevé et des formules de Trotterisation. Des protocoles efficaces pour mesurer des grandeurs d'intérêt sont présentés, et une nouvelle analyse numérique, basée sur la norme vectorielle plutôt que sur la norme d'opérateur générique, est introduite. Cette approche permet d'atteindre une précision donnée tout en réduisant le nombre de pas de temps par un facteur qui croît de manière exponentielle avec le nombre de qubits. De plus, une étude de différentes transformations de Madelung non linéaires est présentée afin de résoudre certaines équations fluides sur ordinateur quantique. Les différents résultats de cette thèse sont illustrés par des simulations classiques des algorithmes quantiques ainsi que par des simulations sur des processeurs quantiques actuels. Ce travail pose les bases de la simulation pratique de systèmes physiques classiques, aussi bien sur les dispositifs quantiques actuels de type NISQ (noisy intermediate-scale quantum) que sur les futurs ordinateurs quantiques tolérants aux erreurs.

  • Open Access

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

    by Julien Zylberman, Thibault Fredon, Nuno F Loureiro, Fabrice Debbasch

    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 a 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 with previously established operator-norm analysis. This new scaling significantly reduces the projected computational resources, independently of the circuit implementation of the trotterized evolution operator. We also present efficient quantum circuits based on (sparse) Walsh approximations along with 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.


  • Open Access

    Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy Trade-Offs

    by Julien Zylberman, Ugo Nzongani, Andrea Simonetto, Fabrice Debbasch

    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.


  • Open Access

    Polylogarithmic-depth controlled-NOT gates without ancilla qubits

    by Baptiste Claudon, Julien Zylberman, César Feniou, Fabrice Debbasch, Alberto Peruzzo, Jean-Philip Piquemal

    Controlled operations are fundamental building blocks of quantum algorithms. Decomposing n-control-NOT gates (Cn(X)) into arbitrary single-qubit and CNOT gates, is a crucial but non-trivial task. This study introduces Cn(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 (\log {(n)}^{3})$$ Θ ( log ( n ) 3 ) , an approximating one without ancilla qubits with a circuit depth $${{{{{{{\mathcal{O}}}}}}}}(\log {(n)}^{3}\log (1/\epsilon ))$$ O ( log ( n ) 3 log ( 1 / ϵ ) ) and an exact one with an adjustable-depth circuit which decreases with the number m≤n of ancilla qubits available as $${{{{{{{\mathcal{O}}}}}}}}(\log {(n/\lfloor m/2\rfloor )}^{3}+\log (\lfloor m/2\rfloor ))$$ O ( log ( n / ⌊ m / 2 ⌋ ) 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.


  • Efficient quantum state preparation with Walsh series

    by Julien Zylberman, Fabrice Debbasch

    An approximate quantum state preparation method is introduced, called the Walsh series loader (WSL). The WSL approximates quantum states defined by real-value 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 O(1/ε), where ε is the precision of the approximation in terms of infidelity. The circuit depth is also O(1/ε), the size is O(n+1/ε), and only one ancilla qubit is needed. The second method accurately represents 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 ε with a depth O(sk), a size O(n+sk), and one ancilla qubit. In both cases, the protocol is a repeat-until-success procedure with a probability of success P=Θ(ε), giving an averaged total time of O(1/ε3/2) for the WSL and O(sk/ε) for the sparse WSL. Amplitude amplification can be used to reach a probability of success P=Θ(1), modifying the quantum circuit size to Õ((n+1/ε)/ε) and Õ((n+sk)/ε) and the depth to O([log(n)3+1/ε]/ε) and O([log(n)3+sk]/ε), respectively. Amplitude amplification reduces by a factor O(1/ε) the total time dependence on ε 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-value, multivariate, almost-everywhere-differentiable function. The repeat-until-success Walsh series loader is so far the only method that prepares a quantum state with a circuit depth and an averaged total time independent of the number of qubits.


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

    by Ugo Nzongani, Julien Zylberman, Carlo-Elia Doncecchi, Armando Pérez, Fabrice Debbasch, Pablo Arnault


  • Open Access

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

    by Ugo Nzongani, Julien Zylberman, Carlo-Elia Doncecchi, Armando Pérez, Fabrice Debbasch, Pablo Arnault

    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).

  • Open Access

    Quantum Spatial Search with Electric Potential: Long-Time Dynamics and Robustness to Noise

    by Thibault Fredon, Julien Zylberman, Pablo Arnault, Fabrice Debbasch

    We present various results on the scheme introduced in a previous work, 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 the node to be found. 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 long time simulations of this electric Dirac DQW, and observe that there is a second localization peak around the node marked by the oracle, reached in a time O(N), where N is the number of nodes of the 2D grid, with a localization probability scaling as O(1/lnN). 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.


  • Quantum simulations of hydrodynamics via the Madelung transformation

    by Julien Zylberman, Giuseppe Di Molfetta, Marc Brachet, Nuno F. Loureiro, Fabrice Debbasch

    Developing numerical methods to simulate efficiently nonlinear fluid dynamics on universal quantum computers is a challenging problem. In this paper, a generalization of the Madelung transform is defined to solve quantum relativistic charged fluid equations interacting with external electromagnetic forces via the Dirac equation. The Dirac equation is discretized into discrete-time quantum walks which can be efficiently implemented on universal quantum computers. A variant of this algorithm is proposed to implement simulations using current noisy intermediate scale quantum (NISQ) devices in the case of homogeneous external forces. High resolution (up to N=217 grid points) numerical simulations of relativistic and nonrelativistic hydrodynamical shocks on current IBM NISQs are performed with this algorithm. This paper demonstrates that fluid dynamics can be simulated on NISQs, and opens the door to simulating other fluids, including plasmas, with more general quantum walks and quantum automata.


  • Open Access

    Dirac Spatial Search with Electric Fields

    by Julien Zylberman, Fabrice Debbasch

    Electric Dirac quantum walks, which are a discretisation of the Dirac equation for a spinor coupled to an electric field, are revisited in order to perform spatial searches. The Coulomb electric field of a point charge is used as a non local oracle to perform a spatial search on a 2D grid of N points. As other quantum walks proposed for spatial search, these walks localise partially on the charge after a finite period of time. However, contrary to other walks, this localisation time scales as N for small values of N and tends asymptotically to a constant for larger Ns, thus offering a speed-up over conventional methods.