activity
20232026
most citedThe discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver

5 citations · 7 across the 7 of their papers we have counts for

collaborators

9 papers

quant-ph2026

Adiabatic tracking and optimal schedules for classical and quantum Gibbs-state preparation

Pedro C. S. Costa, Mauro E. S. Morales, Dong An +1

We develop a discrete adiabatic framework for Gibbs-state preparation in classical and quantum optimisation algorithms. For finite time-inhomogeneous reversible Markov chains, we d…

quant-ph2026

Transducer-based linear combination of unitaries: theory and applications

Dong An, Dekuan Dong, Changpeng Shao +2

Linear combination of unitaries (LCU) is a fundamental primitive in quantum algorithms, whose cost is typically governed by the most expensive unitary appearing in the combination.…

quant-ph2026

Fast-forwarding quantum algorithms for weakly nonlinear dissipative differential equations and beyond

Yixiang Li, Dong An

We study a fast-forwarded quantum algorithm for solving weakly nonlinear dissipative ordinary differential equations. Our approach is a combination of the Carleman embedding techni…

quant-ph2026

Quantum simulation of slow analytic time-dependent Hamiltonians

Chenhao Zhao, Yinan Li, Dong An

We develop a quantum algorithm for slow analytic Hamiltonians with that achieves nearly additive query complexity and low gate overhead. Ou…

quant-ph2026

Constant Factor Analysis of Optimal Quantum Linear Solvers in Practice

Pedro C. S. Costa, Alexander M. Dalzell, Dong An +1

Optimal quantum linear equation solvers provide complexity , where is the condition number and is the allowable error. The optimal solver using a discrete ad…

quant-ph2025

Large time-step discretisation of adiabatic quantum dynamics

Dong An, Pedro C. S. Costa, Dominic W. Berry

Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltoni…

quant-ph2024

Assessing Quantum and Classical Approaches to Combinatorial Optimization: Testing Quadratic Speed-ups for Heuristic Algorithms

Pedro C. S. Costa, Mauro E. S. Morales, Dong An +1

Many recent investigations conclude, based on asymptotic complexity analyses, that quantum computers could accelerate combinatorial optimization (CO) tasks relative to a purely cla…

quant-ph2024★ 2 cited

Quantum Linear System Solvers: A Survey of Algorithms and Applications

Mauro E. S. Morales, Lirandë Pira, Philipp Schleich +7

Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve t…

quant-ph2023★ 5 cited

The discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver

Pedro C. S. Costa, Dong An, Ryan Babbush +1

The solution of linear systems of equations is the basis of many other quantum algorithms, and recent results provided an algorithm with optimal scaling in both the condition numbe…