Dylan Lewis
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
Research Subjects
Dylan Lewis has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
Sougato Bose
Department of Physics and Astronomy University College London WC1E 6BT London United Kingdom
6 shared publicationsJoão P. Moutinho
Instituto Superior Técnico, Universidade de Lisboa, 1049-001 Lisbon, Portugal
2 shared publicationsLeonardo Banchi
Department of Physics and Astronomy University of Florence via G. Sansone 1 I-50019 Sesto Fiorentino (FI Italy
2 shared publications- Leonardo Banchi
University of Florence
2 shared publications - Sougato Bose
University College London
2 shared publications Alan Rio
King’s College Hospital
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 12 June 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Quantum Carleman linearization efficiency in nonlinear fluid dynamics
Computational fluid dynamics (CFD) is a specialized branch of fluid mechanics that utilizes numerical methods and algorithms to solve and analyze fluid-flow problems. One promising avenue to enhance CFD is the use of quantum computing, which has the potential to resolve nonlinear differential equations more efficiently than classical computers. Here, we try to answer the question of which regimes of nonlinear partial differential equations for fluid dynamics can have an efficient quantum algorithm. We propose a connection between the numerical parameter R , which guarantees efficiency in the truncation of the Carleman linearization, and the physical parameters that describe the fluid flow. This link can be made thanks to the Kolmogorov scale, which determines the minimum size of the grid needed to properly resolve the energy cascade induced by the nonlinear term. Additionally, we introduce the formalism for vector field simulation in different spatial dimensions, providing the discretization of the operators and the boundary conditions. Published by the American Physical Society 2025
- 12 June 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Top Cited PapersOpen AccessQuantum Carleman linearization efficiency in nonlinear fluid dynamics
Computational fluid dynamics (CFD) is a specialized branch of fluid mechanics that utilizes numerical methods and algorithms to solve and analyze fluid-flow problems. One promising avenue to enhance CFD is the use of quantum computing, which has the potential to resolve nonlinear differential equations more efficiently than classical computers. Here, we try to answer the question of which regimes of nonlinear partial differential equations for fluid dynamics can have an efficient quantum algorithm. We propose a connection between the numerical parameter R , which guarantees efficiency in the truncation of the Carleman linearization, and the physical parameters that describe the fluid flow. This link can be made thanks to the Kolmogorov scale, which determines the minimum size of the grid needed to properly resolve the energy cascade induced by the nonlinear term. Additionally, we introduce the formalism for vector field simulation in different spatial dimensions, providing the discretization of the operators and the boundary conditions. Published by the American Physical Society 2025
- Open Access
- 21 May 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (5)
Geodesic algorithm for unitary gate design with time-independent Hamiltonians
Larger multiqubit quantum gates allow shallower, more efficient quantum circuits, which could decrease the prohibitive effect of noise on algorithms for noisy intermediate-scale quantum (NISQ) devices and fault-tolerant error correction schemes. Such multiqubit gates can potentially be generated by time-independent Hamiltonians comprising only physical (one- and two-local) interaction terms. Here, we present an algorithm that finds the time-independent Hamiltonian for a target quantum gate on n qubits by using the geodesic on the Riemannian manifold of SU ( 2 n ) . Differential programming is used to determine how the Hamiltonian should be updated to follow the geodesic to the target unitary as closely as possible. We show that our geodesic algorithm outperforms gradient descent methods for standard multiqubit gates such as Toffoli and Fredkin. The geodesic algorithm is then used to find previously unavailable multiqubit gates implementing high-fidelity parity checks, which could be used in a wide array of quantum codes and increase the clock speed of fault-tolerant quantum computers. The geodesic algorithm is demonstrated on an example relevant to current experimental hardware, illustrating a circuit speed up.
- 21 May 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (5)
Open AccessGeodesic algorithm for unitary gate design with time-independent Hamiltonians
Larger multiqubit quantum gates allow shallower, more efficient quantum circuits, which could decrease the prohibitive effect of noise on algorithms for noisy intermediate-scale quantum (NISQ) devices and fault-tolerant error correction schemes. Such multiqubit gates can potentially be generated by time-independent Hamiltonians comprising only physical (one- and two-local) interaction terms. Here, we present an algorithm that finds the time-independent Hamiltonian for a target quantum gate on n qubits by using the geodesic on the Riemannian manifold of SU ( 2 n ) . Differential programming is used to determine how the Hamiltonian should be updated to follow the geodesic to the target unitary as closely as possible. We show that our geodesic algorithm outperforms gradient descent methods for standard multiqubit gates such as Toffoli and Fredkin. The geodesic algorithm is then used to find previously unavailable multiqubit gates implementing high-fidelity parity checks, which could be used in a wide array of quantum codes and increase the clock speed of fault-tolerant quantum computers. The geodesic algorithm is demonstrated on an example relevant to current experimental hardware, illustrating a circuit speed up.
- Open Access
Quantum spatial search with multiple excitations
Spatial search is the problem of finding a marked vertex in a graph. A continuous-time quantum walk in the single-excitation subspace of an $n$ spin system solves the problem of spatial search by finding the marked vertex in $O(\sqrt{n})$ time. Here, we investigate a natural extension of the spatial search problem, marking multiple vertices of a graph, which are still marked with local fields. We prove that a continuous-time quantum walk in the $k$-excitation subspace of $n$ spins can determine the binary string of $k$ marked vertices with an asymptotic fidelity in time $O(\sqrt{n})$, despite the size of the state space growing as $O(n^k)$. Numerically, we show that this algorithm can be implemented with interactions that decay as $1/r^α$, where $r$ is the distance between spins, and an $α$ that is readily available in current ion trap systems.Open AccessQuantum spatial search with multiple excitations
Spatial search is the problem of finding a marked vertex in a graph. A continuous-time quantum walk in the single-excitation subspace of an $n$ spin system solves the problem of spatial search by finding the marked vertex in $O(\sqrt{n})$ time. Here, we investigate a natural extension of the spatial search problem, marking multiple vertices of a graph, which are still marked with local fields. We prove that a continuous-time quantum walk in the $k$-excitation subspace of $n$ spins can determine the binary string of $k$ marked vertices with an asymptotic fidelity in time $O(\sqrt{n})$, despite the size of the state space growing as $O(n^k)$. Numerically, we show that this algorithm can be implemented with interactions that decay as $1/r^α$, where $r$ is the distance between spins, and an $α$ that is readily available in current ion trap systems. - Open Access
- 9 August 2023
- Published by American Physical Society (APS) in Physical Review B
- Vol. 108 (7) , 075405
Low-dissipation data bus via coherent quantum dynamics
The transfer of information between two physical locations is an essential component of both classical and quantum computing. In quantum computing the transfer of information must be coherent to preserve quantum states and hence the quantum information. We establish a simple protocol for transferring one- and two-electron encoded logical qubits in quantum dot arrays. The theoretical energetic cost of this protocol is calculated—in particular, the cost of freezing and unfreezing tunneling between quantum dots. Our results are compared with the energetic cost of shuttling qubits in quantum dot arrays and transferring classical information using classical information buses. Only our protocol can manage constant dissipation for any chain length. This protocol could reduce the cooling requirements and constraints on scalable architectures for quantum dot quantum computers.
- 9 August 2023
- Published by American Physical Society (APS) in Physical Review B
- Vol. 108 (7) , 075405
Open AccessLow-dissipation data bus via coherent quantum dynamics
The transfer of information between two physical locations is an essential component of both classical and quantum computing. In quantum computing the transfer of information must be coherent to preserve quantum states and hence the quantum information. We establish a simple protocol for transferring one- and two-electron encoded logical qubits in quantum dot arrays. The theoretical energetic cost of this protocol is calculated—in particular, the cost of freezing and unfreezing tunneling between quantum dots. Our results are compared with the energetic cost of shuttling qubits in quantum dot arrays and transferring classical information using classical information buses. Only our protocol can manage constant dissipation for any chain length. This protocol could reduce the cooling requirements and constraints on scalable architectures for quantum dot quantum computers.
- Open Access
- 12 June 2023
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 8 (3) , 035025
Ion trap long-range XY model for quantum state transfer and optimal spatial search
Linear ion trap chains are a promising platform for quantum computation and simulation. The XY model with long-range interactions can be implemented with a single side-band Mølmer–Sørensen scheme, giving interactions that decay as 1 / r α , where α parameterises the interaction range. Lower α leads to longer range interactions, allowing faster long-range gate operations for quantum computing. However, decreasing α causes an increased generation of coherent phonons and appears to dephase the effective XY interaction model. We characterise and show how to correct for this effect completely, allowing lower α interactions to be coherently implemented. Ion trap chains are thus shown to be a viable platform for spatial quantum search in optimal O ( N ) time, for N ions. Finally, we introduce a O ( N ) quantum state transfer protocol, with a qubit encoding that maintains a high fidelity.
- 12 June 2023
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 8 (3) , 035025
Open AccessIon trap long-range XY model for quantum state transfer and optimal spatial search
Linear ion trap chains are a promising platform for quantum computation and simulation. The XY model with long-range interactions can be implemented with a single side-band Mølmer–Sørensen scheme, giving interactions that decay as 1 / r α , where α parameterises the interaction range. Lower α leads to longer range interactions, allowing faster long-range gate operations for quantum computing. However, decreasing α causes an increased generation of coherent phonons and appears to dephase the effective XY interaction model. We characterise and show how to correct for this effect completely, allowing lower α interactions to be coherently implemented. Ion trap chains are thus shown to be a viable platform for spatial quantum search in optimal O ( N ) time, for N ions. Finally, we introduce a O ( N ) quantum state transfer protocol, with a qubit encoding that maintains a high fidelity.
- Open Access
Low-Dissipation Data Bus via Coherent Quantum Dynamics
The transfer of information between two physical locations is an essential component of both classical and quantum computing. In quantum computing the transfer of information must be coherent to preserve quantum states and hence the quantum information. We establish a simple protocol for transferring one- and two-electron encoded logical qubits in quantum dot arrays. The theoretical energetic cost of this protocol is calculated - in particular, the cost of freezing and unfreezing tunnelling between quantum dots. Our results are compared with the energetic cost of shuttling qubits in quantum dot arrays and transferring classical information using classical information buses. Only our protocol can manage constant dissipation for any chain length. This protocol could reduce the cooling requirements and constraints on scalable architectures for quantum dot quantum computers.
Open AccessLow-Dissipation Data Bus via Coherent Quantum Dynamics
The transfer of information between two physical locations is an essential component of both classical and quantum computing. In quantum computing the transfer of information must be coherent to preserve quantum states and hence the quantum information. We establish a simple protocol for transferring one- and two-electron encoded logical qubits in quantum dot arrays. The theoretical energetic cost of this protocol is calculated - in particular, the cost of freezing and unfreezing tunnelling between quantum dots. Our results are compared with the energetic cost of shuttling qubits in quantum dot arrays and transferring classical information using classical information buses. Only our protocol can manage constant dissipation for any chain length. This protocol could reduce the cooling requirements and constraints on scalable architectures for quantum dot quantum computers.
- Open Access
Variational Quantum Circuits for Multi-Qubit Gate Automata
Variational quantum algorithms (VQAs) may have the capacity to provide a quantum advantage in the Noisy Intermediate-scale Quantum (NISQ) era. Here, we present a quantum machine learning (QML) framework, inspired by VQAs, to tackle the problem of finding time-independent Hamiltonians that generate desired unitary evolutions, i.e. multi-qubit quantum gates. The Hamiltonians are designed by tuning local fields and two-body interaction terms only. We find that our approach achieves high fidelity quantum gates, such as the Toffoli gate, with a significantly lower computational complexity than is possible classically. This method can also be extended to realize higher-order multi-controlled quantum gates, which could be directly applied to quantum error correction (QEC) schemes.
Open AccessVariational Quantum Circuits for Multi-Qubit Gate Automata
Variational quantum algorithms (VQAs) may have the capacity to provide a quantum advantage in the Noisy Intermediate-scale Quantum (NISQ) era. Here, we present a quantum machine learning (QML) framework, inspired by VQAs, to tackle the problem of finding time-independent Hamiltonians that generate desired unitary evolutions, i.e. multi-qubit quantum gates. The Hamiltonians are designed by tuning local fields and two-body interaction terms only. We find that our approach achieves high fidelity quantum gates, such as the Toffoli gate, with a significantly lower computational complexity than is possible classically. This method can also be extended to realize higher-order multi-controlled quantum gates, which could be directly applied to quantum error correction (QEC) schemes.
- 1 January 2022
- Published by Project MUSE in Restoration: Studies in English Literary Culture, 1660-1700
- Vol. 46 (1) , 127-129
Ghosts, Holes, Rips and Scrapes: Shakespeare in 1619, Bibliography in the Longue Durée by Zachary Lesser
Zachary Lesser's wonderful Ghosts, Holes, Rips and Scrapes: Shakespeare in 1619, Bibliography in the Longue Durée is a revisionist deep-dive into a narrow corner of Shakespeare bibliography—namely, the case of the so-called Pavier Quartos—but one that yields major implications for the field of bibliography itself. While previous scholarship on the Pavier Quartos has typically classified them as a strategic attempt by seventeenth-century publisher Thomas Pavier at collecting several plays by William Shakespeare together for the first time in a nonce volume, anticipating the upcoming First Folio, Lesser offers compelling bibliographic evidence that refutes this foundational thesis. Through both interpretive and empirical evidence, Lesser asserts that the Pavier Quartos were instead a sort of anthology of several Shakespeare plays and a stray play by Thomas Heywood put together by the printers William and Isaac Jaggard for no particular reason other than creating a profitable anthology of popular texts that many buyers could choose to buy as a bound collection. Using a variety of investigative bibliographical methodologies applied to over 300 different copies of the various Pavier Quartos currently scattered across multiple institutions and bound mostly as individual plays, Lesser's meticulous study reveals that most of what we know about their bibliographic history is at best somewhat flawed and at worst completely false.
- 1 January 2022
- Published by Project MUSE in Restoration: Studies in English Literary Culture, 1660-1700
- Vol. 46 (1) , 127-129
Ghosts, Holes, Rips and Scrapes: Shakespeare in 1619, Bibliography in the Longue Durée by Zachary Lesser
Zachary Lesser's wonderful Ghosts, Holes, Rips and Scrapes: Shakespeare in 1619, Bibliography in the Longue Durée is a revisionist deep-dive into a narrow corner of Shakespeare bibliography—namely, the case of the so-called Pavier Quartos—but one that yields major implications for the field of bibliography itself. While previous scholarship on the Pavier Quartos has typically classified them as a strategic attempt by seventeenth-century publisher Thomas Pavier at collecting several plays by William Shakespeare together for the first time in a nonce volume, anticipating the upcoming First Folio, Lesser offers compelling bibliographic evidence that refutes this foundational thesis. Through both interpretive and empirical evidence, Lesser asserts that the Pavier Quartos were instead a sort of anthology of several Shakespeare plays and a stray play by Thomas Heywood put together by the printers William and Isaac Jaggard for no particular reason other than creating a profitable anthology of popular texts that many buyers could choose to buy as a bound collection. Using a variety of investigative bibliographical methodologies applied to over 300 different copies of the various Pavier Quartos currently scattered across multiple institutions and bound mostly as individual plays, Lesser's meticulous study reveals that most of what we know about their bibliographic history is at best somewhat flawed and at worst completely false.
- 17 June 2021
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 126 (24) , 240502
Optimal Quantum Spatial Search with One-Dimensional Long-Range Interactions
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their classical counterpart, in time for entries. However, the capability of models found in nature is largely unexplored—e.g., in one dimension only nearest-neighbor Hamiltonians have been considered so far, for which the quadratic speedup does not exist. Here, we prove that optimal spatial search, namely with run time and high fidelity, is possible in one-dimensional spin chains with long-range interactions that decay as with distance . In particular, near unit fidelity is achieved for and, in the limit , we find a continuous transition from a region where optimal spatial search does exist () to where it does not (). Numerically, we show that spatial search is robust to dephasing noise and that, for reasonable chain lengths, should be sufficient to demonstrate optimal spatial search experimentally with near unit fidelity.- 17 June 2021
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 126 (24) , 240502
Optimal Quantum Spatial Search with One-Dimensional Long-Range Interactions
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their classical counterpart, in time for entries. However, the capability of models found in nature is largely unexplored—e.g., in one dimension only nearest-neighbor Hamiltonians have been considered so far, for which the quadratic speedup does not exist. Here, we prove that optimal spatial search, namely with run time and high fidelity, is possible in one-dimensional spin chains with long-range interactions that decay as with distance . In particular, near unit fidelity is achieved for and, in the limit , we find a continuous transition from a region where optimal spatial search does exist () to where it does not (). Numerically, we show that spatial search is robust to dephasing noise and that, for reasonable chain lengths, should be sufficient to demonstrate optimal spatial search experimentally with near unit fidelity.- Open Access
Optimal quantum spatial search with one-dimensional long-range interactions
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their classical counterpart, in $\mathcal O(\sqrt n)$ time for $n$ entries. However the capability of models found in nature is largely unexplored - e.g., in one dimension only nearest-neighbour Hamiltonians have been considered so far, for which the quadratic speedup does not exist. Here, we prove that optimal spatial search, namely with $\mathcal O(\sqrt n)$ run time and large fidelity, is possible in one-dimensional spin chains with long-range interactions that decay as $1/r^\alpha$ with distance $r$. In particular, near unit fidelity is achieved for $\alpha\approx 1$ and, in the limit $n\to\infty$, we find a continuous transition from a region where optimal spatial search does exist ($\alpha1.5$). Numerically, we show that spatial search is robust to dephasing noise and that, for realistic conditions, $\alpha \lesssim 1.2$ should be sufficient to demonstrate optimal spatial search experimentally with near unit fidelity.Open AccessOptimal quantum spatial search with one-dimensional long-range interactions
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their classical counterpart, in $\mathcal O(\sqrt n)$ time for $n$ entries. However the capability of models found in nature is largely unexplored - e.g., in one dimension only nearest-neighbour Hamiltonians have been considered so far, for which the quadratic speedup does not exist. Here, we prove that optimal spatial search, namely with $\mathcal O(\sqrt n)$ run time and large fidelity, is possible in one-dimensional spin chains with long-range interactions that decay as $1/r^\alpha$ with distance $r$. In particular, near unit fidelity is achieved for $\alpha\approx 1$ and, in the limit $n\to\infty$, we find a continuous transition from a region where optimal spatial search does exist ($\alpha1.5$). Numerically, we show that spatial search is robust to dephasing noise and that, for realistic conditions, $\alpha \lesssim 1.2$ should be sufficient to demonstrate optimal spatial search experimentally with near unit fidelity.