Reuben Tate

dblp:181/3217 · also Reuben Blake Tate · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0002-9170-8906ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2026 Theoretical approximation ratios for Warm-Started QAOA on 3-regular max-cut instances at depth p = 1
Reuben Tate, Stephan J. Eidenbenz
Theor. Comput. Sci.1
2025 Enhancing Quantum Expectation Values Via Exponential Error Suppression and CVaR Optimization
abstract
Precise quantum expectation values are crucial for quantum algorithm development, but noise in real-world systems can degrade these estimations. While quantum error correction is resource-intensive, error mitigation strategies offer a practical alternative. This paper presents a framework that combines Virtual Channel Purification (VCP) technique with Conditional Value-at-Risk (CVaR) optimization to improve expectation value estimations in noisy quantum circuits. Our contributions are twofold: first, we derive conditions to compare CVaR values from different probability distributions, offering insights into the reliability of quantum estimations under noise. Second, we apply this framework to VCP, providing analytical bounds that establish its effectiveness in improving expectation values, both when the overhead VCP circuit is ideal (error-free) and when it adds additional noise. By introducing CVaR into the analysis of VCP, we offer a general noise-characterization method that guarantees improved expectation values for any quantum observable. We demonstrate the practical utility of our approach with numerical examples, highlighting how our bounds guide VCP implementation in noisy quantum systems.
Touheed Anwar Atif, Reuben Tate, Stephan J. Eidenbenz
ISIT2
2025 Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
Reuben Tate, Stephan J. Eidenbenz
SOFSEM (2)1
2023 Bridging Classical and Quantum with SDP initialized warm-starts for QAOA
abstract
We study the Quantum Approximate Optimization Algorithm ( QAOA ) in the context of the Max-Cut problem. Noisy quantum devices are only able to accurately execute QAOA at low circuit depths, while classically-challenging problem instances may call for a relatively high circuit-depth. This is due to the need to build correlations between reachable pairs of vertices in potentially large graphs [ 16 ]. To enhance the solving power of low-depth QAOA, we introduce a classical pre-processing step that initializes QAOA with a biased superposition of possible cuts in the graph, referred to as a warm-start . In particular, we initialize QAOA with a solution to a low-rank semidefinite programming relaxation of the Max-Cut problem. Our experimental results show that this variant of QAOA , called QAOA-warm , is able to outperform standard QAOA on lower circuit depths in solution quality and training time. While this improvement is partly due to the classical warm-start, we find strong evidence of further improvement using QAOA circuit at small depth. We provide experimental evidence of improved performance as well as theoretical properties of the proposed framework.
Reuben Tate, Majid Farhadi, Creston Herold, Greg Mohler, Swati Gupta 0001
ACM Trans. Quantum Comput.1