default search action
Reuben Tate
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
- [j4]Reuben Tate
, Stephan J. Eidenbenz:
Theoretical approximation ratios for Warm-Started QAOA on 3-regular max-cut instances at depth p = 1. Theor. Comput. Sci. 1059: 115571 (2026) - 2025
- [c2]Touheed Anwar Atif, Reuben Blake Tate, Stephan J. Eidenbenz:
Enhancing Quantum Expectation Values Via Exponential Error Suppression and CVaR Optimization. ISIT 2025: 1-6 - [c1]Reuben Tate
Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere. SOFSEM (2) 2025: 311-323 - [i6]Bikrant Bhattachayra, Michael Capriotti, Reuben Tate:
Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut. CoRR abs/2504.06253 (2025) - [i5]Sean Feeney, Reuben Tate, John Golden, Stephan J. Eidenbenz:
MPS-JuliQAOA: User-friendly, Scalable MPS-based Simulation for Quantum Optimization. CoRR abs/2508.05883 (2025) - [i4]Reuben Tate, Swati Gupta:
Comparison of Hyperplane Rounding for Max-Cut and Quantum Approximate Optimization Algorithm over Certain Regular Graph Families. CoRR abs/2509.24108 (2025) - 2024
- [i3]Reuben Tate, Stephan J. Eidenbenz:
Guarantees on Warm-Started QAOA: Single-Round Approximation Ratios for 3-Regular MAXCUT and Higher-Round Scaling Limits. CoRR abs/2402.12631 (2024) - [i2]Sean Feeney, Reuben Tate, Stephan J. Eidenbenz:
The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution. CoRR abs/2409.09012 (2024) - [i1]Jad Salem, Reuben Tate, Stephan J. Eidenbenz:
Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems. CoRR abs/2410.02589 (2024) - 2023
- [b1]Reuben Tate:
Classical Optimization to Improve Variational Quantum Algorithms. Georgia Institute of Technology, Atlanta, GA, USA, 2023 - [j3]Reuben Tate
Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths. Quantum 7: 1121 (2023) - [j2]Reuben Tate
Bridging Classical and Quantum with SDP initialized warm-starts for QAOA. ACM Trans. Quantum Comput. 4(2): 9:1-9:39 (2023)
2010 – 2019
- 2016
- [j1]Christopher O'Neill, Vadim Ponomarenko
On the set of catenary degrees of finitely generated cancellative commutative monoids. Int. J. Algebra Comput. 26(3): 565-576 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-01-28 02:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: