activity
20242026
collaborators

14 papers

quant-ph2026

Efficient Circuit Transpilation of Commuting Gates on 2D Grids

Sabina Drăgoi, Daniel J. Egger

Combinatorial optimization problems are central to many applications but can be challenging to solve. Quantum approaches such as the Quantum Approximate Optimization Algorithm (QAO…

quant-ph2026

Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting

Filip B. Maciejewski, Stuart Hadfield, Oscar Wallis +5

Progress towards a quantum advantage using known heuristic methods for combinatorial optimization is impeded by hardware noise and limited qubit count. Here, we propose a noise-awa…

quant-ph2026

Mitigating errors in state preparation and measurement with noncomputational states

Conrad J. Haupt, Almudena Carrera Vazquez, Laurin E. Fischer +2

Error mitigation has enabled quantum computing applications with over one hundred qubits and deep circuits. Many error mitigation methods are noise-aware, relying on a faithful cha…

quant-ph2026

Optimizing Symmetry Informed Probabilistic Error Cancellation

Tom O'Leary, Daniel J. Egger, Dieter Jaksch

We show that combining quantum error detection (QED) with probabilistic error cancellation (PEC) gives more accurate and lower-variance estimates than PEC alone, provided that the…

quant-ph2026

Setting angles in quantum approximate optimization at utility-scale

Maosheng Guo, Joel Jurado Diaz, Anurag Ramesh +16

The quantum approximate optimization algorithm (QAOA) is a powerful heuristic that seeks to solve combinatorial optimization problems using quantum hardware and classical optimizat…

quant-ph2026

Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization

Almudena Carrera Vazquez, Daniel J. Egger, Stefan Woerner

We investigate ancilla-free linear combination of unitaries (LCU) as a framework for approximating complex quantum circuits. This is particularly effective for quantum optimization…