collaborators

8 papers

quant-ph2026

Suppressing errors in analog logical rotation gates via balanced fusion

Sam McArdle, Alexander M. Dalzell, Fernando G. S. L. Brandão

There have been a number of recent proposals to use analog logical rotations in early fault-tolerant quantum algorithms. Existing proposals implement a logical rotation by angle $Ï…

quant-ph2026

Faster quantum linear system solver beyond the condition number

Alexander M. Dalzell, Jianqiang Li, Yuan Su

The spectral condition number is a widely adopted measure of worst-case cost for quantum linear system solvers. Yet it can significantly overestimate the actual runtime for a typic…

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 discret…

quant-ph2026

A shortcut to an optimal quantum linear system solver

Alexander M. Dalzell

Given a linear system of equations , quantum linear system solvers (QLSSs) approximately prepare a quantum state for which…

quant-ph2025

The Fast for the Curious: How to accelerate fault-tolerant quantum applications

Sam McArdle, Alexander M. Dalzell, Aleksander Kubica +1

We evaluate strategies for reducing the run time of fault-tolerant quantum computations, targeting practical utility in scientific or industrial workflows. Delivering a technology…

quant-ph2025

Quantum and classical algorithms for SOCP based on the multiplicative weights update method

M. Isabel Franco Garrido, Alexander M. Dalzell, Sam McArdle

We give classical and quantum algorithms for approximately solving second-order cone programs (SOCPs) based on the multiplicative weights (MW) update method. Our approach follows t…