On the public citation graph
QAOA for Hard-to-solve Instances of Maximum Independent Set Problem
0 signed · 21 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-030-14082-3_7openalex-snapshot
Variational Quantum Factoring
inferredcites →https://doi.org/10.1007/s42979-022-01638-4openalex-snapshot
Approaches to Constrained Quantum Approximate Optimization
inferredcites →https://doi.org/10.1016/j.ins.2022.11.020openalex-snapshot
Quantum approximate optimization for combinatorial problems with constraints
inferredcites →https://doi.org/10.1016/j.physrep.2024.03.002openalex-snapshot
A review on Quantum Approximate Optimization Algorithm and its variants
inferredcites →https://doi.org/10.1038/s41534-021-00478-zopenalex-snapshot
Analyzing the performance of variational quantum factoring on a superconducting quantum processor
inferredcites →https://doi.org/10.1038/s41598-022-10555-8openalex-snapshot
Multi-angle quantum approximate optimization algorithm
inferredcites →https://doi.org/10.1038/s41598-022-20853-wopenalex-snapshot
Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer
inferredcites →https://doi.org/10.1103/physreva.104.012403openalex-snapshot
Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm
inferredcites →https://doi.org/10.1103/physreva.110.052435openalex-snapshot
Iterative quantum algorithms for maximum independent set
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.2.023302openalex-snapshot
Combinatorial optimization via highly efficient quantum walks
inferredcites →https://doi.org/10.1103/physrevresearch.7.023240openalex-snapshot
Quantifying the impact of precision errors on quantum approximate optimization algorithms
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.1103/prxquantum.5.030348openalex-snapshot
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
inferredcites →https://doi.org/10.1103/yfwq-yqmkopenalex-snapshot
Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras
inferredcites →https://doi.org/10.1109/tcomm.2022.3185287openalex-snapshot
Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection
inferredcites →https://doi.org/10.1140/epjqt/s40507-022-00131-4openalex-snapshot
Unsupervised strategies for identifying optimal parameters in Quantum Approximate Optimization Algorithm
inferredcites →https://doi.org/10.1145/3425607openalex-snapshot
Multilevel Combinatorial Optimization across Quantum Architectures
inferredcites →https://doi.org/10.21468/scipostphyscore.4.4.031openalex-snapshot
Quantum approximate optimization for hard problems in linear algebra
inferredcites →https://doi.org/10.22331/q-2022-08-22-781openalex-snapshot
Quantum Local Search with the Quantum Alternating Operator Ansatz
inferredcites →https://doi.org/10.3390/app10207116openalex-snapshot
Quantum Approximation for Wireless Scheduling
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.