A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Ansatz adaptations can occur as a byproduct, as in the Quantum Alternating Operator Ansatz where the primary goal is to find a mixing Hamiltonian that ensures staying in the feasible subspace.
“Besides the mentioned ansatz search, as the driving force behind ansatz adaptation, there is also the possibility of having these adaptations as a byproduct, like it happens, e.g., within the Quantum Alternating Operator Ansatz where the primary goal is to find a mixing Hamiltonian that ensures to stay in the feasible subspace [11, 58, 95, 112, 116, 117, 120, 127].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [95]
To mitigate drawbacks of the Quantum Alternating Operator Ansatz, a quantum walk-assisted approach, a dynamic update of the ansatz, and constraint-encoding schemes for QAOA have been proposed.
“To mitigate these drawbacks, a quantum walk-assisted approach has been suggested [95], a dynamic update of the ansatz based on the quantum outputs has been proposed [120], and constraint-encoding schemes for QAOA have been classified [117] into linear equality, linear inequality, and arbitrary constraints.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [95]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905 · see citing works
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511 · see citing works
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · see citing works
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472 · see citing works
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · see citing works
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512 · see citing works
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · see citing works
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · see citing works
Spatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725 · see citing works
Universal Computation by Multiparticle Quantum Walk
Childs, A. M., Gosset, D., & Webb, Z. (2013) · Science · doi:10.1126/science.1229957 · Cited by 456 · see citing works
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322 · see citing works
Physical Implementation of Quantum Walks
Manouchehri, K., & Wang, J. B. (2013) · Springer eBooks · doi:10.1007/978-3-642-36014-5 · Cited by 263 · see citing works
Self-citationGeneral theory of higher-order decomposition of exponential operators and symplectic integrators
Suzuki, M. (1992) · Physics Letters A · doi:10.1016/0375-9601(92)90335-j · Cited by 244 · see citing works
Godsil, C. D. (2011) · Discrete Mathematics · doi:10.1016/j.disc.2011.06.032 · Cited by 222 · see citing works
SNPs Problems, Complexity, and Algorithms
Lancia, G., Bafna, V., Istrail, S., Lippert, R. A., & Schwartz, R. S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44676-1_15 · Cited by 199 · see citing works
Two-particle quantum walks applied to the graph isomorphism problem
Gamble, J. K., Friesen, M., Zhou, D., Joynt, R., & Coppersmith, S. N. (2010) · Physical Review A · doi:10.1103/physreva.81.052313 · Cited by 145 · see citing works
The fundamental limit theorems in probability
Feller, W. (1945) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1945-08448-1 · Cited by 136 · see citing works
Efficient quantum circuits for diagonal unitaries without ancillas
Welch, J., Greenbaum, D., Mostame, S., & Aspuru-Guzik, A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033040 · Cited by 114 · see citing works
Efficient quantum walk on a quantum processor
Qiang, X., Loke, T., Montanaro, A., Aungskunsiri, K., Zhou, X., O’Brien, J. L., Wang, J. B., & Matthews, J. C. F. (2016) · Nature Communications · doi:10.1038/ncomms11511 · Cited by 108 · see citing works
Self-citationQuantum Machine Learning over Infinite Dimensions
Lau, H.-K., Pooser, R. C., Siopsis, G., & Weedbrook, C. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.080501 · Cited by 101 · see citing works
Hybrid dynamic data race detection
O'Callahan, R., & Choi, J.-D. (2003) · ACM SIGPLAN Notices · doi:10.1145/966049.781528 · Cited by 76 · see citing works
Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries
Domingo, C., Mishra, N., & Pitt, L. (1999) · Machine Learning · doi:10.1023/a:1007627028578 · Cited by 62 · see citing works
Comparing classical and quantum PageRanks
Loke, T., Tang, J.-S., Rodriguez, J., SMALL, M. P., & Wang, J. B. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1456-z · Cited by 52 · see citing works
Self-citationSome better bounds on the variance with applications
Sharma, R., Gupta, M., & Kapoor, G. (2010) · Journal of Mathematical Inequalities · doi:10.7153/jmi-04-32 · Cited by 46 · see citing works
Centrality measure based on continuous-time quantum walks and experimental realization
Izaac, J., Zhan, X., Bian, Z., Wang, K., Li, J., Wang, J. B., & Xue, P. (2017) · Physical Review A · doi:10.1103/physreva.95.032318 · Cited by 45 · see citing works
Self-citationA theory of measurement in diagnosis from first principles
Hou, A. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90019-1 · Cited by 38 · see citing works
Polynomially bounded minimization problems which are hard to approximate
Kann, V. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56939-1_61 · Cited by 21 · see citing works
Strong lower bounds on the approximability of some NPO PB-complete maximization problems
Kann, V. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60246-1_129 · Cited by 15 · see citing works
An analytical study of quantum walk through glued-tree graphs
Li, Z.-J., & Wang, J. B. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/35/355301 · Cited by 13 · see citing works
Self-citationQuantum walk on a chimera graph
Xu, S., Sun, X., Wu, J., Zhang, W., Arshed, N., & Sanders, B. C. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab701 · Cited by 5 · see citing works
Flagged first, then by citations
Research works printed but not linked: 21
- [1]P. W. Shor, SIAM Journal on Computing 26 , 1484 (1997).
- [2]A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, in STOC (ACM, 2003) p. 59.
- [3]L. K. Grover, in STOC (ACM, 1996) p. 212.
- [4]V. Kann, in Mathematical Foundations of Computer Science (Springer, 1995) p. 227.
- [6]V. Kann, in Automata, Languages and Programming (Springer, 1993) p. 52.
- [7]E. Farhi, J. Goldstone, and S. Gutmann, arXiv (2014), 1411.4028 [quant-ph].
- [8]E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, arXiv (2000), quant-ph/0001106. · arXiv
- [9]E. Farhi and S. Gutmann, Physical Review A 58 , 915 (1998).
- [14]S. Xu, X. Sun, J. Wu, W.-W. Zhang, N. Arshed, and B. C. Sanders, New Journal of Physics (in press) (2018).
- [16]Z.-J. Li and J. B. Wang, Journal of Physics A: Mathematical and Theoretical 48 , 355301 (2015).
- [21]G. Lancia, V. Bafna, S. Istrail, R. Lippert, and R. Schwartz, in Computers and Games (Springer, 2001) p. 182.
- [22]R. O'Callahan and J. D. Choi, ACM SIGPLAN Notices 38 , 167 (2003).
- [26]S. Hadfield, Z. Wang, B. O'Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, arXiv (2017), 1709.03489 [quant-ph].
- [28]R. Sharma, M. Gupta, and G. Kapoor, Journal of Mathematical Inequalities 4 , 355 (2010).
- [29]J. Welch, D. Greenbaum, S. Mostame, and A. Aspuru-Guzik, New Journal of Physics 16 (2014).
- [30]A. M. Childs, Quantum information processing in continuous time , Ph.D. thesis, Massachusetts Institute of Technology (2004).
- [31]D. Aharonov and A. Ta-Shma, in STOC (ACM, 2003) p. 20.
- [32]J. A. Nelder and R. Mead, The Computer Journal 7 , 308 (1965).
- [34]Hartmanis, Juris, SIAM Review 24 , 90 (1982).
- [35]G. Karakostas, ACM Trans. Algorithms 5 , 41 (2009).
- [36]L. Babai, arXiv (2015), 1512.03547 [cs.DS].
Cited by
Sorted by citations
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772 · see citing works
Quantum walk and its application domains: A systematic review
Kadian, K., Garhwal, S., & Kumar, A. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100419 · Cited by 147 · see citing works
Qu, Z., Zhang, Z., & Zheng, M. X. (2022) · Information Sciences · doi:10.1016/j.ins.2022.09.028 · Cited by 97 · see citing works
On the universality of the quantum approximate optimization algorithm
Morales, M. E. S., Biamonte, J., & Zimborás, Z. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02748-9 · Cited by 95 · see citing works
Domain wall encoding of discrete variables for quantum annealing and QAOA
Chancellor, N. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab33c2 · Cited by 90 · see citing works
Naik, A. S., Yeniaras, E., Hellstern, G., Prasad, G., & Vishwakarma, S. (2025) · Financial Innovation · doi:10.1186/s40854-025-00751-6 · Cited by 69 · see citing works
Quantum Walk Computing: Theory, Implementation, and Application
Qiang, X., Ma, S., & Song, H. (2024) · Intelligent Computing · doi:10.34133/icomputing.0097 · Cited by 59 · see citing works
Opportunities and Challenges of Quantum Computing for Engineering Optimization
Wang, Y., Kim, J. E., & Suresh, K. (2023) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4062969 · Cited by 53 · see citing works
Combinatorial optimization via highly efficient quantum walks
Marsh, S., & Wang, J. B. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023302 · Cited by 50 · see citing works
Self-citationFinding spin glass ground states using quantum walks
Callison, A., Chancellor, N., Mintert, F., & Kendon, V. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab5ca2 · Cited by 48 · see citing works
Quantum-enhanced greedy combinatorial optimization solver
Dupont, M., Evert, B., Hodson, M. J., Sundar, B., Jeffrey, S., Yamaguchi, Y., Feng, D., Maciejewski, F. B., Hadfield, S., Alam, M. S., et al. (2023) · Science Advances · doi:10.1126/sciadv.adi0487 · Cited by 54 · see citing works
Constrained optimization via quantum Zeno dynamics
Herman, D., Shaydulin, R., Sun, Y., Chakrabarti, S., Hu, S., Minssen, P., Rattew, A. G., Yalovetzky, R., & Pistoia, M. (2023) · Communications Physics · doi:10.1038/s42005-023-01331-9 · Cited by 43 · see citing works
Analytical framework for quantum alternating operator ansätze
Hadfield, S., Hogg, T., & Rieffel, E. G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/aca3ce · Cited by 28 · see citing works
Experimental implementation of quantum-walk-based portfolio optimization
Qu, D., Matwiejew, E., Wang, K., Wang, J. B., & Xue, P. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad27e9 · Cited by 26 · see citing works
Self-citationReachability Deficits in Quantum Approximate Optimization of Graph Problems
Akshay, V., Philathong, H., Zacharov, I., & Biamonte, J. (2021) · Quantum · doi:10.22331/q-2021-08-30-532 · Cited by 26 · see citing works
Quantum approximate optimization for combinatorial problems with constraints
Ruan, Y., Yuan, Z., Xue, X., & Liu, Z. (2022) · Information Sciences · doi:10.1016/j.ins.2022.11.020 · Cited by 26 · see citing works
Quantum optimization for training quantum neural networks
Liao, Y., Hsieh, M.-H., & Ferrie, C. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00169-w · Cited by 26 · see citing works
Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22 · see citing works
“Objective Function [10], [78], [86] Ansatz [11, 36, 48, 58, 82, 86, 88, 89, 95–97], [112], [116], [117, 120, 127, 131, 151], [152, 153, 155] Parameter Optimization [51], [75], [76, 99], [141], [143], [146] Measurement [122], [125] Grover-search [52], [118] Other gate-based approaches [15], [16],…”
BackgroundMethodHybrid quantum-classical heuristic for the bin packing problem
de Andoin, M. G., Osaba, E., Oregi, I., Villar-Rodríguez, E., & Sanz, M. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3533986 · Cited by 18 · see citing works
Quantum Walk-Based Vehicle Routing Optimisation
Bennett, T., Matwiejew, E., Marsh, S., & Wang, J. B. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.730856 · Cited by 16 · see citing works
Self-citationMiki, T., Okita, R., Shimada, M., Tsukayama, D., & Shirakashi, J. (2022) · AIP Advances · doi:10.1063/5.0077706 · Cited by 16 · see citing works
Quantum Approximate Bayesian Optimization Algorithms With Two Mixers and Uncertainty Quantification
Kim, J. E., & Wang, Y. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3327055 · Cited by 17 · see citing works
Deterministic spatial search using alternating quantum walks
Marsh, S., & Wang, J. B. (2021) · Physical Review A · doi:10.1103/physreva.104.022216 · Cited by 15 · see citing works
Self-citationHuot, C., Kea, K., Kim, T.-K., & Han, Y. (2024) · IEEE Access · doi:10.1109/access.2024.3506981 · Cited by 14 · see citing works
Xiao, J., Sukulthanasorn, N., Nomura, R., Moriguchi, S., & Terada, K. (2025) · Advanced Modeling and Simulation in Engineering Sciences · doi:10.1186/s40323-025-00298-2 · Cited by 12 · see citing works
Scalable and programmable three-dimensional photonic processor
Tan, X. G., Song, H., Ji, Y., Tang, H. L., Fang, Y.-Y., Xu, X.-Y., Li, Y., Li, X.-K., Zhu, K., & Jin, X. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.044041 · Cited by 11 · see citing works
QSW_MPI: A framework for parallel simulation of quantum stochastic walks
Matwiejew, E., & Wang, J. B. (2020) · Computer Physics Communications · doi:10.1016/j.cpc.2020.107724 · Cited by 9 · see citing works
Self-citationOne-dimensional quantum walks with two-step memory
Zhou, Q., & Lu, S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2475-3 · Cited by 8 · see citing works
Analytical results for the quantum alternating operator ansatz with Grover mixer
Bridi, G. A., & Marquezino, F. D. L. (2024) · Physical Review A · doi:10.1103/physreva.110.052409 · Cited by 8 · see citing works
Quantum optimisation for continuous multivariable functions by a structured search
Matwiejew, E., Pye, J., & Wang, J. B. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace6cc · Cited by 9 · see citing works
Self-citationA systematic method to building Dirac quantum walks coupled to electromagnetic fields
Jay, G., Debbasch, F., & Wang, J. B. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02933-w · Cited by 6 · see citing works
Self-citationParallel circuit implementation of variational quantum algorithms
Cattelan, M., Yarkoni, S., & Lechner, W. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00982-6 · Cited by 8 · see citing works
QuOp_MPI: A framework for parallel simulation of quantum variational algorithms
Matwiejew, E., & Wang, J. B. (2022) · Journal of Computational Science · doi:10.1016/j.jocs.2022.101711 · Cited by 4 · see citing works
Self-citationA framework for optimal quantum spatial search using alternating phase-walks
Marsh, S., & Wang, J. B. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac26af · Cited by 4 · see citing works
Self-citationApplying analog quantum computing to solve optimisation problems: case studies on Max-Cut and CVRP
Deleplanque, S., Yaagoubi, A. E., Gras, T., Descamps, F., Mourrier, J., & Lefebvre, I. (2025) · International Journal of Systems Science Operations & Logistics · doi:10.1080/23302674.2025.2463530 · Cited by 3 · see citing works
Benchasattabuse, N., Bärtschi, A., García-Pintos, L. P., Golden, J. K., Lemons, N., & Eidenbenz, S. (2025) · Physical Review A · doi:10.1103/physreva.111.062411 · Cited by 13 · see citing works
Non-Variational Quantum Combinatorial Optimisation
Bennett, T., Noakes, L., & Wang, J. B. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00014 · Cited by 2 · see citing works
Self-citationQuantum Semi-trust Evaluation Model with Graph-based Quantum Walk Teleportation
Huang, H., Zhao, W., Zhang, X., & Wu, X. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05156-0 · Cited by 2 · see citing works
Finding spin-glass ground states using quantum walks [dataset]
Callison, A. (2019) · Durham Research Online (Durham University) · doi:10.15128/r21544bp097 · Cited by 2 · see citing works
Bennett, T., Smith, A., Matwiejew, E., & Wang, Y. (2025) · Physical Review A · doi:10.1103/sdlc-wl67 · Cited by 1 · see citing works
Optimum 6G/7G quantum network design: Survey
Glisic, S., & Lorenzo, B. (2025) · Optics Communications · doi:10.1016/j.optcom.2025.131883 · Cited by 1 · see citing works
Li, C., Li, L., & Zhong, M. (2022) · International Conference on Electronics and Sustainable Communication Systems (ICESC) · doi:10.1109/icesc54411.2022.9885678 · Cited by 1 · see citing works
Agarwal, P., Ali, N., & Hillery, M. S. (2025) · International Journal of Quantum Information · doi:10.1142/s0219749925500248
Mammola, A., Schaeverbeke, Q., & Molfetta, G. D. (2025) · Physical Review Research · doi:10.1103/wc4h-thmg
Realization of arbitrary unitary operations using discrete-time quantum walks
Han, Y., Zhou, Y., & Wang, K. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04959-4
Studies of quantum combinatorial optimization algorithms: <?A3B2 pi6?>a review
Li, Z., Wu, Y., Zhang, R., Wen, J., Wang, T., & Wang, C. (2025) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/csb-2025-5565
Q-CHOP: Quantum constrained Hamiltonian optimization
Perlin, M. A., Shaydulin, R., Hall, B., Minssen, P., Li, C., Dubey, K., Rines, R., Anschuetz, E. R., Pistoia, M., & Gokhale, P. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3778864 · Cited by 1 · see citing works
A finite state automaton for quantum computing
Kwon, Y., & Agha, G. (2026) · Quantum Information Processing · doi:10.1007/s11128-025-05047-3
Variational quantum algorithm for constrained combinatorial optimization problems
Li, H.-M., Han, Y.-L., Wang, Z.-X., & Fei, S.-M. (2026) · Physical Review A · doi:10.1103/ykxd-h19w · Cited by 2 · see citing works
Quantum Dominating Set Problem: An Unbalanced Penalization Analysis
Chaurra-Gutierrez, F. A., Feregrino-Uribe, C., & Sun, G. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00033
- Authors
- Marsh, S., & Wang, J. B.
- Affiliations
- The University of Western Australia (AU)
- Corresponding author
- Wang, J. B.
- ORCID
- Wang, J. B.
- Venue
- Quantum Information Processing
- Published
- 2019-01-16
- Volume
- 18
- Issue
- 3
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W2798553955
- Cited by
- 50
- References
- 30
- Citations by year
- 2026: 3 · 2025: 12 · 2024: 7 · 2023: 7 · 2022: 8 · 2021: 5 · 2020: 4 · 2019: 4
- FWCI
- 2.54
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Quantum Information Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- UWA Profiles and Research Repository (UWA) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- quantum approximate optimization algorithm, quantum walks, minimum vertex cover, constrained optimization, phase shift, quantum circuit synthesis
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
