On the public citation graph

Bridging Classical and Quantum with SDP initialized warm-starts for QAOA

https://doi.org/10.1145/3549554
0 signed · 94 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cpa.21830openalex-snapshot
Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_10openalex-snapshot
Minima of Functions of Several Variables with Inequalities as Side Conditions
inferredcites →https://doi.org/10.1007/978-94-015-8330-5_4openalex-snapshot
A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation
inferredcites →https://doi.org/10.1007/bf01585184openalex-snapshot
Laplacian eigenvalues and the maximum cut problem
inferredcites →https://doi.org/10.1007/bf02574037openalex-snapshot
Problems of distance geometry and convex properties of quadratic maps
inferredcites →https://doi.org/10.1007/s10107-002-0352-8openalex-snapshot
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
inferredcites →https://doi.org/10.1007/s10107-004-0564-1openalex-snapshot
Local Minima and Convergence in Low-Rank Semidefinite Programming
inferredcites →https://doi.org/10.1007/s10589-010-9329-3openalex-snapshot
Implementing the Nelder-Mead simplex algorithm with adaptive parameters
inferredcites →https://doi.org/10.1007/s42484-020-00022-wopenalex-snapshot
Optimizing quantum heuristics with meta-learning
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1103/physreva.97.022304openalex-snapshot
Quantum approximate optimization algorithm for MaxCut: A fermionic view
inferredcites →https://doi.org/10.1103/physrevlett.124.090504openalex-snapshot
Reachability Deficits in Quantum Approximate Optimization
inferredcites →https://doi.org/10.1103/physrevlett.125.260505openalex-snapshot
Obstacles to Variational Quantum Optimization from Symmetry Protection
inferredcites →https://doi.org/10.1103/physrevresearch.4.033029openalex-snapshot
Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
inferredcites →https://doi.org/10.1103/physrevx.10.021067openalex-snapshot
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
inferredcites →https://doi.org/10.1109/focs.2004.39openalex-snapshot
Maximizing Quadratic Programs: Extending Grothendieck's Inequality
inferredcites →https://doi.org/10.1109/qce49297.2020.00041openalex-snapshot
Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
inferredcites →https://doi.org/10.1109/sfcs.2005.53openalex-snapshot
Noise stability of functions with low in.uences invariance and optimality
inferredcites →https://doi.org/10.1109/tac.2020.3007688openalex-snapshot
Warm Start of Mixed-Integer Programs for Model Predictive Control of Hybrid Systems
inferredcites →https://doi.org/10.1137/0805024openalex-snapshot
Nonpolyhedral Relaxations of Graph-Bisection Problems
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1137/s0097539797328847openalex-snapshot
Gadgets, Approximation, and Linear Programming
inferredcites →https://doi.org/10.1137/s1052623400382467openalex-snapshot
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.1214/15-aos1388openalex-snapshot
Best subset selection via a modern optimization lens
inferredcites →https://doi.org/10.1287/ijoc.2017.0798openalex-snapshot
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
inferredcites →https://doi.org/10.1287/moor.23.2.339openalex-snapshot
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
inferredcites →https://doi.org/10.1525/9780520411586-036openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.22331/q-2018-08-06-79openalex-snapshot
Quantum Computing in the NISQ era and beyond
inferredcites →https://doi.org/10.22331/q-2021-06-17-479openalex-snapshot
Warm-starting quantum optimization
inferredcites →https://doi.org/10.22331/q-2021-07-01-491openalex-snapshot
Quantum annealing initialization of the quantum approximate optimization algorithm
inferredcites →https://doi.org/10.25080/tcwv9851openalex-snapshot
Exploring Network Structure, Dynamics, and Function using NetworkX
inferredcites →https://doi.org/10.5555/3219315.3219319openalex-snapshot
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/qute.202400253openalex-snapshot
Difference of Convex Algorithm for Warm‐Start Quantum Approximate Optimization Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_854-1openalex-snapshot
Quantum Approximate Optimization Algorithm (QAOA)
inferred← citeshttps://doi.org/10.1007/978-3-030-87568-8_2openalex-snapshot
Patterns for Hybrid Quantum Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_23openalex-snapshot
Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere
inferred← citeshttps://doi.org/10.1007/s11128-021-03342-3openalex-snapshot
Empirical performance bounds for quantum approximate optimization
inferred← citeshttps://doi.org/10.1007/s11128-024-04438-2openalex-snapshot
Variational quantum algorithms: fundamental concepts, applications and challenges
inferred← citeshttps://doi.org/10.1007/s11128-025-04743-4openalex-snapshot
Transfer learning of optimal QAOA parameters in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s42484-026-00427-zopenalex-snapshot
Quantum-accelerated security analysis in quantum cryptography: semidefinite programming (SDP) from classical bottlenecks to quantum solutions — a comprehensive review
inferred← citeshttps://doi.org/10.1016/j.ijepes.2025.111115openalex-snapshot
Joint generation-transmission expansion planning in renewables-dominated power systems based on hybrid quantum-classical computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115571openalex-snapshot
Theoretical approximation ratios for Warm-Started QAOA on 3-regular max-cut instances at depth p = 1
inferred← citeshttps://doi.org/10.1038/s41534-023-00787-5openalex-snapshot
Alignment between initial state and mixer improves QAOA performance for constrained optimization
inferred← citeshttps://doi.org/10.1038/s41534-024-00825-wopenalex-snapshot
Short-depth QAOA circuits and quantum annealing on higher-order ising models
inferred← citeshttps://doi.org/10.1038/s41534-026-01192-4openalex-snapshot
The Lie algebra of XY-mixer topologies and warm starting QAOA for constrained optimization
inferred← citeshttps://doi.org/10.1038/s41598-022-10555-8openalex-snapshot
Multi-angle quantum approximate optimization algorithm
inferred← citeshttps://doi.org/10.1038/s41598-023-50406-8openalex-snapshot
Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions
inferred← citeshttps://doi.org/10.1038/s41598-025-26699-2openalex-snapshot
Hybrid quantum-classical stochastic programming for co-planning 5G base stations and photovoltaic power stations in urban communities
inferred← citeshttps://doi.org/10.1038/s42254-024-00770-9openalex-snapshot
Challenges and opportunities in quantum optimization
inferred← citeshttps://doi.org/10.1038/s43588-025-00873-yopenalex-snapshot
Quantum approximate multi-objective optimization
inferred← citeshttps://doi.org/10.1063/5.0189374openalex-snapshot
Restricted global optimization for QAOA
inferred← citeshttps://doi.org/10.1063/5.0329914openalex-snapshot
Improving semidefinite programming for NP-hard nonlinear numerical optimization problems
inferred← citeshttps://doi.org/10.1088/1367-2630/ad4629openalex-snapshot
Artificial intelligence warm-start approach: optimizing the generalization capability of QAOA in complex energy landscapes
inferred← citeshttps://doi.org/10.1088/1367-2630/ae8ea2openalex-snapshot
Constrained quantum optimization via iterative warm-start X Y -mixers
inferred← citeshttps://doi.org/10.1088/1751-8121/ad00f0openalex-snapshot
A practitioner’s guide to quantum algorithms for optimisation problems
inferred← citeshttps://doi.org/10.1088/2058-9565/ad200aopenalex-snapshot
An expressive ansatz for low-depth quantum approximate optimisation
inferred← citeshttps://doi.org/10.1088/2516-1075/ace86dopenalex-snapshot
Accelerating variational quantum eigensolver convergence using parameter transfer
inferred← citeshttps://doi.org/10.1103/nh3b-1wv5openalex-snapshot
qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1103/nt3w-j4mjopenalex-snapshot
Warm-start adaptive-bias quantum approximate optimization algorithm
inferred← citeshttps://doi.org/10.1103/physrevresearch.7.013035openalex-snapshot
Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation
inferred← citeshttps://doi.org/10.1103/prxquantum.5.040320openalex-snapshot
Benchmarking Digital Quantum Simulations Above Hundreds of Qubits Using Quantum Critical Dynamics
inferred← citeshttps://doi.org/10.1109/dsn-w65791.2025.00064openalex-snapshot
AI-Augmented Parameter Initialization for QAOA
inferred← citeshttps://doi.org/10.1109/icccnt61001.2024.10725610openalex-snapshot
Exploring the Versatility of QAOA: A Comprehensive Review
inferred← citeshttps://doi.org/10.1109/icfpt67023.2025.00049openalex-snapshot
FPGA Implemented Quantum Approximate Optimization Algorithm for MaxCut Acceleration
inferred← citeshttps://doi.org/10.1109/qce53715.2022.00032openalex-snapshot
Quantum Approximate Optimization Algorithm with Sparsified Phase Operator
inferred← citeshttps://doi.org/10.1109/qce57702.2023.00042openalex-snapshot
The Quantum Alternating Operator Ansatz for Satisfiability Problems
inferred← citeshttps://doi.org/10.1109/qce57702.2023.00068openalex-snapshot
The Role of Entanglement in Quantum-Relaxation Based Optimization Algorithms
inferred← citeshttps://doi.org/10.1109/qce65121.2025.10338openalex-snapshot
CVAE-Guided QAOA Parameter Initialization and Dynamic Injection
inferred← citeshttps://doi.org/10.1109/qcnc64685.2025.00077openalex-snapshot
The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution
inferred← citeshttps://doi.org/10.1109/qsw67625.2025.00032openalex-snapshot
ProvideQ: A Quantum Optimization Toolbox
inferred← citeshttps://doi.org/10.1109/tqe.2021.3063635openalex-snapshot
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
inferred← citeshttps://doi.org/10.1109/tqe.2023.3327055openalex-snapshot
Quantum Approximate Bayesian Optimization Algorithms With Two Mixers and Uncertainty Quantification
inferred← citeshttps://doi.org/10.1109/tqe.2024.3421294openalex-snapshot
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
inferred← citeshttps://doi.org/10.1117/12.2648434openalex-snapshot
Benchmarking the recursive quantum approximate optimization algorithm
inferred← citeshttps://doi.org/10.1117/12.3002220openalex-snapshot
A hybrid quantum-classical approach to warm-starting optimization
inferred← citeshttps://doi.org/10.1142/s0129183126430059openalex-snapshot
Exploring Clifford and near-Clifford initialization strategies for quantum variational optimization
inferred← citeshttps://doi.org/10.1145/3620668openalex-snapshot
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
inferred← citeshttps://doi.org/10.1145/3649329.3663523openalex-snapshot
Invited: Graph Learning for Parameter Prediction of Quantum Approximate Optimization Algorithm
inferred← citeshttps://doi.org/10.1145/3652510openalex-snapshot
Warm-Starting and Quantum Computing: A Systematic Mapping Study
inferred← citeshttps://doi.org/10.1145/3711935openalex-snapshot
Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0551openalex-snapshot
Optimized Noise Suppression for Quantum Circuits
inferred← citeshttps://doi.org/10.14569/ijacsa.2023.0141217openalex-snapshot
Research on Qubit Mapping Technique Based on Batch SWAP Optimization
inferred← citeshttps://doi.org/10.2172/2229681openalex-snapshot
Quantum Optimization: Potential, Challenges, and the Path Forward
inferred← citeshttps://doi.org/10.22331/q-2021-06-17-479openalex-snapshot
Warm-starting quantum optimization
inferred← citeshttps://doi.org/10.22331/q-2022-03-30-678openalex-snapshot
Hybrid quantum-classical algorithms for approximate graph coloring
inferred← citeshttps://doi.org/10.22331/q-2022-12-07-870openalex-snapshot
Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
inferred← citeshttps://doi.org/10.22331/q-2023-09-26-1121openalex-snapshot
Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
inferred← citeshttps://doi.org/10.22331/q-2025-11-06-1906openalex-snapshot
Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
inferred← citeshttps://doi.org/10.3389/fphy.2025.1468348openalex-snapshot
Transfer of knowledge through reverse annealing: a preliminary analysis of the benefits and what to share
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.