August 03, 2026 article Open access Evidence for effectively constant shot complexity in the quantum approximate optimization algorithm without per-instance optimization Physical Review A DOI: 10.1103/x32d-wx13 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 0 stored of 1 References 2 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Quantum approximate optimization of non-planar graph problems on a planar superconducting processor 2021 Nature Physics article Computer Science Quantum Computing Algorithms and Architecture Open access 470 citations Toward a linear-ramp QAOA protocol: evidence of a scaling advantage in solving some combinatorial optimization problems 2025 npj Quantum Information article Computer Science Quantum Computing Algorithms and Architecture Open access 34 citations 2 results