An Improved GAS Algorithm and it's application on the Credit Card Scoring Problem

An Improved GAS Algorithm and it's application on the Credit Card Scoring Problem | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article An Improved GAS Algorithm and it's application on the Credit Card Scoring Problem Zhijian Wang, Yuchen He, Yong Long, Tian Luan This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-5437472/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 3 You are reading this latest preprint version Abstract This paper introduces an improved Grover Adaptive Search(GAS) algorithm. The GAS algorithm has been prove to achieve quadratic acceleration in the Constrained Polynomial Binary Optimization (CPBO) problem. Nevertheless, the acceleration effect of the GAS algorithm can be decreased by the poor threshold selection. This article uses the Quantum Approximate Optimization Algorithm(QAOA) to improve the initial threshold selection, thereby accelerating the convergence speed of the original GAS algorithm. The acceleration effect of the improved GAS algorithm is presented by the application on the Max-cut problem and the credit card scoring problem. Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editor assigned by journal 17 Nov, 2024 Submission checks completed at journal 17 Nov, 2024 First submitted to journal 12 Nov, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-5437472","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":379038079,"identity":"5638fbc9-2716-4fd6-8c02-e8bdc35875ac","order_by":0,"name":"Zhijian Wang","email":"","orcid":"","institution":"University of Science and Technology of China","correspondingAuthor":false,"prefix":"","firstName":"Zhijian","middleName":"","lastName":"Wang","suffix":""},{"id":379038080,"identity":"448a632c-39b8-4c97-87fe-fc950722a761","order_by":1,"name":"Yuchen He","email":"","orcid":"","institution":"Yangtze Delta Region Industrial Innovation Center of Quantum and Information Technology","correspondingAuthor":false,"prefix":"","firstName":"Yuchen","middleName":"","lastName":"He","suffix":""},{"id":379038081,"identity":"ff1844bb-9694-4b06-92f3-c94702d57f88","order_by":2,"name":"Yong Long","email":"","orcid":"","institution":"University of Science and Technology of China","correspondingAuthor":false,"prefix":"","firstName":"Yong","middleName":"","lastName":"Long","suffix":""},{"id":379038082,"identity":"1fffbd8c-052b-4a29-8fd4-0849c9886ea8","order_by":3,"name":"Tian Luan","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAzklEQVRIiWNgGAWjYBACPjBpwMDAT7QWNhBxAKhFsg0qwkOcFpBFx4jWIpH87PGHArs84/vtF2/+YLgjZ09YS5q5wQGD5GKzYzzF1jwMz4yJsCXBTOKAAXPitmM8adIMDIcTewhrSf8G1FKfuLmNJ03yB8PheiK05IBsOZy4gY39mAQPw+EEwg7jeVMmccbgeOKMYznM1jwGhw17DhDQws+evk2i4k91Yn/z8Yc3f1QclmdvIGQNAvAYSICSASmA/YEEaRpGwSgYBaNgpAAAxOY6X2zg1ZYAAAAASUVORK5CYII=","orcid":"","institution":"Yangtze Delta Region Industrial Innovation Center of Quantum and Information Technology","correspondingAuthor":true,"prefix":"","firstName":"Tian","middleName":"","lastName":"Luan","suffix":""}],"badges":[],"createdAt":"2024-11-12 08:08:30","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-5437472/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-5437472/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":71593334,"identity":"3c27d9b0-323c-47f2-85df-b08cff6ee652","added_by":"auto","created_at":"2024-12-17 03:48:23","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":565693,"visible":true,"origin":"","legend":"","description":"","filename":"improvedGASalgorithm.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5437472/v1_covered_3f3bd430-74f3-4e16-b5ae-34f1fb981515.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"An Improved GAS Algorithm and it's application on the Credit Card Scoring Problem","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-5437472/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-5437472/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This paper introduces an improved Grover Adaptive Search(GAS) algorithm. The GAS algorithm has been prove to achieve quadratic acceleration in the Constrained Polynomial Binary Optimization (CPBO) problem. Nevertheless, the acceleration effect of the GAS algorithm can be decreased by the poor threshold selection. This article uses the Quantum Approximate Optimization Algorithm(QAOA) to improve the initial threshold selection, thereby accelerating the convergence speed of the original GAS algorithm. The acceleration effect of the improved GAS algorithm is presented by the application on the Max-cut problem and the credit card scoring problem.","manuscriptTitle":"An Improved GAS Algorithm and it's application on the Credit Card Scoring Problem","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-12-17 03:40:17","doi":"10.21203/rs.3.rs-5437472/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorAssigned","content":"","date":"2024-11-17T10:20:55+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-11-17T10:19:10+00:00","index":"","fulltext":""},{"type":"submitted","content":"The Journal of Supercomputing","date":"2024-11-12T08:02:48+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-journal-of-supercomputing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [The Journal of Supercomputing](https://www.springer.com/journal/11227)","snPcode":"11227","submissionUrl":"https://submission.nature.com/new-submission/11227/3","title":"The Journal of Supercomputing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"f3199c05-978f-4494-b7e8-a19a8df88c58","owner":[],"postedDate":"December 17th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2024-12-17T03:40:17+00:00","versionOfRecord":[],"versionCreatedAt":"2024-12-17 03:40:17","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-5437472","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-5437472","identity":"rs-5437472","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}