<p>With the increasing trend of quantum computing in recent years, many quantum machine learning (<i>QML</i>) models are being widely used to replace the classical models for solving complex classification problems as the latter struggles with nonlinearly separable datasets. One such quantum algorithm is the Pegasos-Quantum Support Vector Classifier (<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13369_2025_10035_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\(P-QSVC\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>P</mi> <mo>-</mo> <mi>Q</mi> <mi>S</mi> <mi>V</mi> <mi>C</mi> </mrow> </math></EquationSource> </InlineEquation>) which solves the binary classification problems more efficiently or comparable to its classical counterpart by leveraging quantum computing fundamentals. Quantum walks are nonlinear quantum computational frameworks that enhance performance by utilizing quantum mechanical principles such as superposition and interference. In our approach, we make use of the coined quantum walk in a two-dimensional lattice to optimize the functionality of the <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13369_2025_10035_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\(P-QSVC\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>P</mi> <mo>-</mo> <mi>Q</mi> <mi>S</mi> <mi>V</mi> <mi>C</mi> </mrow> </math></EquationSource> </InlineEquation> in solving the <i>XOR</i> problem, a nonlinear separable problem. Nonlinearly separable problems are a class of classification problems where a single straight line cannot separate the data points from differed classes. The <i>XOR</i> problem is an elementary example of this category, and finding an effective solution for <i>XOR</i> constitutes a critical step toward addressing more such nonlinearly separable problems. Our proposed model, the Quantum Walk Optimized Pegasos-Quantum Support Vector Classifier (<InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13369_2025_10035_Article_IEq3.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="122" /> </InlineMediaObject> <EquationSource Format="TEX">\(QW-PQSVC\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>Q</mi> <mi>W</mi> <mo>-</mo> <mi>P</mi> <mi>Q</mi> <mi>S</mi> <mi>V</mi> <mi>C</mi> </mrow> </math></EquationSource> </InlineEquation>) efficiently classifies the binary nonlinearly separable <i>XOR</i> dataset by minimizing the <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13369_2025_10035_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathcal {L}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">L</mi> </math></EquationSource> </InlineEquation>oss function and maximizing the classification accuracy of the model using an iterative process. Additionally, we provide the values of the parameters used in the qubit encoding and also the quantum kernel for increasing the classification accuracy of the test points. Using this optimization approach, we achieved the classification accuracy of 99% alongside other metrics such as <i>p</i>recision, <i>F1</i>-score and <i>r</i>ecall scores close to 99% as compared to the 95% accuracy of the <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13369_2025_10035_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\(P-QSVC\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>P</mi> <mo>-</mo> <mi>Q</mi> <mi>S</mi> <mi>V</mi> <mi>C</mi> </mrow> </math></EquationSource> </InlineEquation>. We further experimented using the fivefold cross-validation, to ensure the generalization and reduce the risk of overfitting or underfitting our model thereby validating the optimization process. </p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Quantum Approach to XOR Problem: Quantum Walk Optimizer for PQSVC

  • Karuna Kadian,
  • Sunita Garhwal,
  • Ajay Kumar

摘要

With the increasing trend of quantum computing in recent years, many quantum machine learning (QML) models are being widely used to replace the classical models for solving complex classification problems as the latter struggles with nonlinearly separable datasets. One such quantum algorithm is the Pegasos-Quantum Support Vector Classifier ( \(P-QSVC\) P - Q S V C ) which solves the binary classification problems more efficiently or comparable to its classical counterpart by leveraging quantum computing fundamentals. Quantum walks are nonlinear quantum computational frameworks that enhance performance by utilizing quantum mechanical principles such as superposition and interference. In our approach, we make use of the coined quantum walk in a two-dimensional lattice to optimize the functionality of the \(P-QSVC\) P - Q S V C in solving the XOR problem, a nonlinear separable problem. Nonlinearly separable problems are a class of classification problems where a single straight line cannot separate the data points from differed classes. The XOR problem is an elementary example of this category, and finding an effective solution for XOR constitutes a critical step toward addressing more such nonlinearly separable problems. Our proposed model, the Quantum Walk Optimized Pegasos-Quantum Support Vector Classifier ( \(QW-PQSVC\) Q W - P Q S V C ) efficiently classifies the binary nonlinearly separable XOR dataset by minimizing the \({\mathcal {L}}\) L oss function and maximizing the classification accuracy of the model using an iterative process. Additionally, we provide the values of the parameters used in the qubit encoding and also the quantum kernel for increasing the classification accuracy of the test points. Using this optimization approach, we achieved the classification accuracy of 99% alongside other metrics such as precision, F1-score and recall scores close to 99% as compared to the 95% accuracy of the \(P-QSVC\) P - Q S V C . We further experimented using the fivefold cross-validation, to ensure the generalization and reduce the risk of overfitting or underfitting our model thereby validating the optimization process.