SHENZHEN, China, April 30, 2026 /PRNewswire/ -- MicroAlgo Inc. (the &#34;Company&#34; or &#34;MicroAlgo&#34;) (NASDAQ: MLGO), today announced the proposal of a new approach to solving the Boolean function query problem.

<p xmlns="http://www.w3.org/1999/xhtml"><span xmlns="http://www.w3.org/1999/xhtml" class="legendSpanClass">SHENZHEN, China</span>, <span xmlns="http://www.w3.org/1999/xhtml" class="legendSpanClass">April 30, 2026</span> /PRNewswire/ -- MicroAlgo Inc. (the &#34;Company&#34; or &#34;MicroAlgo&#34;) (NASDAQ: MLGO), today announced the proposal of a new approach to solving the Boolean function query problem. This framework starts from the sum-of-squares representation form of Boolean functions and constitutes an entirely new technical framework, aimed at designing optimal exact quantum query algorithms. This technology not only holds theoretical significance but also offers new ideas for practical applications.</p>
<p xmlns="http://www.w3.org/1999/xhtml">In quantum computing, the query complexity of Boolean functions directly affects the performance of quantum algorithms. Traditional classical algorithms face limitations in time and space when processing Boolean functions, whereas quantum computing, by leveraging the characteristics of superposition and entanglement, has the potential to significantly improve query efficiency. However, the challenge of designing optimal exact quantum query algorithms for arbitrarily small-input Boolean functions still remains, and there is a lack of general methods.</p><p xmlns="http://www.w3.org/1999/xhtml">Boolean functions can be represented as a sum of squares of multilinear polynomials, and this property provides an important mathematical foundation for designing quantum algorithms. By performing sum-of-squares representations of Boolean functions and their negations, it is possible to reveal their internal structure, thereby enabling the construction of corresponding quantum query algorithms.</p><p xmlns="http://www.w3.org/1999/xhtml">MicroAlgo&#39;s technical framework consists of three fundamental steps:</p><p xmlns="http://www.w3.org/1999/xhtml">Step One: Finding the Sum-of-Squares Representations of the Boolean Function and Its Negative Function</p><p xmlns="http://www.w3.org/1999/xhtml">First, it is necessary to analyze the target Boolean function and find its sum-of-squares representation. The key to this step lies in identifying the structure of the Boolean function and using the properties of multilinear polynomials to express it in the form of a sum of squares. Through this representation, the characteristics of the Boolean function can be obtained, which facilitates the subsequent construction of the algorithm.</p><p xmlns="http://www.w3.org/1999/xhtml">In practical operation, algebraic tools and computer algebra systems can be effectively used to achieve this goal. Various algorithms (such as the Lagrange interpolation method) can be used to derive the sum-of-squares representations of the Boolean function and its negation.</p><p xmlns="http://www.w3.org/1999/xhtml">Step Two: Constructing the Final State of the Optimal Exact Quantum Query Algorithm</p><p xmlns="http://www.w3.org/1999/xhtml">After obtaining the sum-of-squares representation of the Boolean function, the next step is to construct a quantum state. The goal of this process is to determine a state that is assumed to be the final state of the optimal exact quantum query algorithm. The superposition property of quantum states must be used to explore multiple paths simultaneously during the query process, thereby improving efficiency.</p><p xmlns="http://www.w3.org/1999/xhtml">The construction of the quantum state involves the initialization of qubits, phase modulation, and gate operations. This process can be implemented using basic quantum gates such as rotation gates and CNOT gates, so that the required quantum state can be realized in the quantum circuit.</p><p xmlns="http://www.w3.org/1999/xhtml">Step Three: Finding Each Unitary Operator in the Uncertainty Algorithm</p><p xmlns="http://www.w3.org/1999/xhtml">Finally, each unitary operator must be found within the uncertainty algorithm. This step is crucial because the selection of unitary operators directly affects the effectiveness of the quantum query. By reasonably selecting and designing unitary operators, efficient quantum querying can be achieved.</p><p xmlns="http://www.w3.org/1999/xhtml">In this process, it may be necessary to utilize methods such as mathematical optimization and machine learning to find the optimal combination of unitary operators. In addition, for specific Boolean functions, customized algorithms may be required to ensure query efficiency and accuracy.</p><p xmlns="http://www.w3.org/1999/xhtml">The implementation logic of MicroAlgo&#39;s entire technical framework can be summarized as: the use of multilinear polynomials, the construction of quantum states, and the selection of unitary operators. Through the sum-of-squares representation, the properties of Boolean functions can be effectively analyzed, providing a theoretical foundation for the subsequent design of quantum algorithms.</p><p xmlns="http://www.w3.org/1999/xhtml">The constructed quantum states not only need to meet the basic requirements of querying but must also fully leverage the characteristics of quantum superposition and entanglement to enhance the parallelism of queries. Finally, by carefully selecting and designing unitary operators, efficient querying of Boolean functions can be achieved, thereby maximizing the performance of quantum algorithms.</p><p xmlns="http://www.w3.org/1999/xhtml">MicroAlgo&#39;s development of this technology is based on the sum-of-squares representation of Boolean functions and has successfully designed a technical framework for optimal exact quantum query algorithms, bringing a brand-new perspective and implementation path to the field of quantum computing.</p><p xmlns="http://www.w3.org/1999/xhtml">Through in-depth analysis of the structure of Boolean functions and with the aid of quantum state construction and precise design of unitary operators, this framework demonstrates outstanding query efficiency and theoretical superiority. The sum-of-squares representation of Boolean functions not only provides a solid mathematical foundation for the design of quantum decision tree algorithms but also effectively reveals the intrinsic relationships between functions, helping us better understand the complexity issues in quantum algorithms. This method, which combines algebraic techniques with quantum physics, offers new research directions for quantum computing and lays the groundwork for the further optimization of exact quantum query algorithms.</p><p xmlns="http://www.w3.org/1999/xhtml">Although the current technical framework faces challenges in dealing with certain practical problems—for example, the algorithm may be infeasible in specific situations—the algorithmic framework based on sum-of-squares representations has already demonstrated its powerful potential in solving problems with low complexity. This optimization of the quantum query model can significantly reduce the consumption of computational resources while increasing the query speed of the algorithm, thereby further improving the overall performance of quantum computing. This has great application prospects and practicality across multiple fields within quantum information science, including quantum communication, quantum security, and quantum machine learning.</p><p xmlns="http://www.w3.org/1999/xhtml">As a disruptive technology, quantum computing&#39;s potential impact will far exceed the scope of traditional computing. The optimal exact quantum query algorithm technical framework developed by MicroAlgo, though currently focused mainly on the exact querying of Boolean functions, possesses a highly scalable philosophy and methodology. By further exploring more complex Boolean functions and their quantum representations, it is expected that MicroAlgo&#39;s technology will be applied to a broader range of fields, including large-scale quantum data processing, complex system optimization, and future AI enhancement. As quantum computing technology continues to evolve and improve, more and more difficult problems will find new solutions through this algorithmic framework.</p><p xmlns="http://www.w3.org/1999/xhtml">Whether in academia or industry, the potential value of this technical framework is immeasurable. It will drive quantum computing to take a solid step from theoretical research toward practical application and inject continuous new momentum into global scientific and technological innovation.</p><p xmlns="http://www.w3.org/1999/xhtml"><b xmlns="http://www.w3.org/1999/xhtml">About MicroAlgo Inc.</b></p><p xmlns="http://www.w3.org/1999/xhtml">MicroAlgo Inc. (the &#34;MicroAlgo&#34;), a Cayman Islands exempted company, is dedicated to the development and application of bespoke central processing algorithms. MicroAlgo provides comprehensive solutions to customers by integrating central processing algorithms with software or hardware, or both, thereby helping them to increase the number of customers, improve end-user satisfaction, achieve direct cost savings, reduce power consumption, and achieve technical goals. The range of MicroAlgo&#39;s services includes algorithm optimization, accelerating computing power without the need for hardware upgrades, lightweight data processing, and data intelligence services. MicroAlgo&#39;s ability to efficiently deliver software and hardware optimization to customers through bespoke central processing algorithms serves as a driving force for MicroAlgo&#39;s long-term development.</p><p xmlns="http://www.w3.org/1999/xhtml"><b xmlns="http://www.w3.org/1999/xhtml">Forward-Looking Statements</b></p><p xmlns="http://www.w3.org/1999/xhtml">This press release contains statements that may constitute &#34;forward-looking statements.&#34; Forward-looking statements are subject to numerous conditions, many of which are beyond the control of MicroAlgo, including those set forth in the Risk Factors section of MicroAlgo&#39;s periodic reports on Forms 10-K and 8-K filed with the SEC. Copies are available on the SEC&#39;s website, <a xmlns="http://www.w3.org/1999/xhtml" href="http://www.sec.gov/" target="_blank" rel="nofollow">www.sec.gov</a>. Words such as &#34;expect,&#34; &#34;estimate,&#34; &#34;project,&#34; &#34;budget,&#34; &#34;forecast,&#34; &#34;anticipate,&#34; &#34;intend,&#34; &#34;plan,&#34; &#34;may,&#34; &#34;will,&#34; &#34;could,&#34; &#34;should,&#34; &#34;believes,&#34; &#34;predicts,&#34; &#34;potential,&#34; &#34;continue,&#34; and similar expressions are intended to identify such forward-looking statements. These forward-looking statements include, without limitation, MicroAlgo&#39;s expectations with respect to future performance and anticipated financial impacts of the business transaction.</p><p xmlns="http://www.w3.org/1999/xhtml">MicroAlgo undertakes no obligation to update these statements for revisions or changes after the date of this release, except as may be required by law.</p>



<p xmlns="http://www.w3.org/1999/xhtml" id="PURL"><img xmlns="http://www.w3.org/1999/xhtml" title="Cision" width="12" height="12" alt="Cision" src="https://edge.prnewswire.com/c/img/favicon.png?sn=CN48214&amp;sd=2026-04-30"></img> View original content:<a xmlns="http://www.w3.org/1999/xhtml" id="PRNURL" rel="nofollow" href="https://www.prnewswire.com/news-releases/microalgo-inc-develops-optimal-precise-quantum-query-algorithm-based-on-sum-of-squares-representation-form-of-boolean-functions-302759043.html" target="_blank">https://www.prnewswire.com/news-releases/microalgo-inc-develops-optimal-precise-quantum-query-algorithm-based-on-sum-of-squares-representation-form-of-boolean-functions-302759043.html</a></p><p xmlns="http://www.w3.org/1999/xhtml">SOURCE MicroAlgo Inc.</p>

MLGO

MicroAlgo Inc. Develops Optimal Precise Quantum Query Algorithm Based on Sum-of-Squares Representation Form of Boolean Functions

MicroAlgo develops innovative quantum query framework enhancing computational efficiency

<section class="insight" data-version="1">
  <section data-block="information">
    <h3>Information</h3>
    <p>SHENZHEN, China, April 30, 2026 /PRNewswire/ -- MicroAlgo Inc. (the &amp;#34;Company&amp;#34; or &amp;#34;MicroAlgo&amp;#34;) (NASDAQ: MLGO), today announced the proposal of a new approach to solving the Boolean function query problem.</p>
  </section>

  <section data-block="ai-summary-paragraph">
    <h3>AI Summary</h3>
    <p>MicroAlgo Inc. has announced a new framework for optimizing exact quantum query algorithms focused on Boolean functions. This innovative approach promises to boost processing efficiency in quantum computing, signaling potential future applications across various fields in quantum information science. Investors should monitor how this development might affect MLGO&#039;s growth trajectory in the evolving quantum landscape.</p>
  </section>

  <section data-block="ai-summary-bullets">
    <h3>Key Points</h3>
    <ul><li>MicroAlgo proposes a new framework for Boolean function queries.</li><li>The framework focuses on optimal quantum query algorithms.</li><li>Quantum computing can enhance Boolean query efficiency significantly.</li><li>New methods will aid in overcoming existing quantum computing limitations.</li><li>Framework has broad implications for applications in quantum tech.</li></ul>
  </section>

  <section data-block="companies-mentioned">
    <h3>Companies Mentioned</h3>
    <ul><li><strong>IBM (IBM)</strong>: IBM is a leader in quantum computing and could collaborate with MLGO.</li><li><strong>Google (GOOGL)</strong>: Google is investing heavily in quantum technologies, presenting potential partnership avenues.</li><li><strong>Microsoft (MSFT)</strong>: Microsoft’s interest in quantum algorithms may align with MLGO&#039;s advancements.</li></ul>
  </section>

  <section data-block="category">
    <h3>Corporate Developments</h3>
    <p>The news falls under &#039;Corporate Developments&#039; as it outlines a significant technological breakthrough for MicroAlgo. This innovation may establish MLGO as a key player in the quantum computing sector, attracting future partnerships and investments.</p>
  </section>

  <section data-block="market-moving">
    <h3>Market-Moving</h3>
    <ul><li>Emerging applications of the framework in quantum computing could attract investor interest.</li><li>Increased efficiency in quantum queries may lead to partnerships with tech firms.</li><li>Positive engagement in the algorithm could enhance MLGO&#039;s market position significantly.</li><li>Future developments or results from the framework may increase stock price volatility.</li></ul>
  </section>

  <section data-block="key-facts">
    <h3>Key Facts</h3>
    <ul><li>Date of announcement: April 30, 2026.</li><li>Framework leverages sum-of-squares representation of Boolean functions.</li><li>Quantum algorithms significantly improve query efficiency over classical methods.</li><li>Potential applications include quantum communication and machine learning.</li><li>Technical framework enhances performance in quantum computing.</li></ul>
  </section>

  <section data-block="trading-thesis">
    <h3>Trading Thesis</h3>
    <p>Invest in MLGO for potential upside as quantum computing gains traction in various sectors within the next 6-12 months.</p>
  </section>
</section>


<p xmlns="http://www.w3.org/1999/xhtml"><span xmlns="http://www.w3.org/1999/xhtml" class="legendSpanClass">SHENZHEN, China</span>, <span xmlns="http://www.w3.org/1999/xhtml" class="legendSpanClass">April 30, 2026</span> /PRNewswire/ -- MicroAlgo Inc. (the &#34;Company&#34; or &#34;MicroAlgo&#34;) (NASDAQ: MLGO), today announced the proposal of a new approach to solving the Boolean function query problem. This framework starts from the sum-of-squares representation form of Boolean functions and constitutes an entirely new technical framework, aimed at designing optimal exact quantum query algorithms. This technology not only holds theoretical significance but also offers new ideas for practical applications.</p>
<p xmlns="http://www.w3.org/1999/xhtml">In quantum computing, the query complexity of Boolean functions directly affects the performance of quantum algorithms. Traditional classical algorithms face limitations in time and space when processing Boolean functions, whereas quantum computing, by leveraging the characteristics of superposition and entanglement, has the potential to significantly improve query efficiency. However, the challenge of designing optimal exact quantum query algorithms for arbitrarily small-input Boolean functions still remains, and there is a lack of general methods.</p><p xmlns="http://www.w3.org/1999/xhtml">Boolean functions can be represented as a sum of squares of multilinear polynomials, and this property provides an important mathematical foundation for designing quantum algorithms. By performing sum-of-squares representations of Boolean functions and their negations, it is possible to reveal their internal structure, thereby enabling the construction of corresponding quantum query algorithms.</p><p xmlns="http://www.w3.org/1999/xhtml">MicroAlgo&#39;s technical framework consists of three fundamental steps:</p><p xmlns="http://www.w3.org/1999/xhtml">Step One: Finding the Sum-of-Squares Representations of the Boolean Function and Its Negative Function</p><p xmlns="http://www.w3.org/1999/xhtml">First, it is necessary to analyze the target Boolean function and find its sum-of-squares representation. The key to this step lies in identifying the structure of the Boolean function and using the properties of multilinear polynomials to express it in the form of a sum of squares. Through this representation, the characteristics of the Boolean function can be obtained, which facilitates the subsequent construction of the algorithm.</p><p xmlns="http://www.w3.org/1999/xhtml">In practical operation, algebraic tools and computer algebra systems can be effectively used to achieve this goal. Various algorithms (such as the Lagrange interpolation method) can be used to derive the sum-of-squares representations of the Boolean function and its negation.</p><p xmlns="http://www.w3.org/1999/xhtml">Step Two: Constructing the Final State of the Optimal Exact Quantum Query Algorithm</p><p xmlns="http://www.w3.org/1999/xhtml">After obtaining the sum-of-squares representation of the Boolean function, the next step is to construct a quantum state. The goal of this process is to determine a state that is assumed to be the final state of the optimal exact quantum query algorithm. The superposition property of quantum states must be used to explore multiple paths simultaneously during the query process, thereby improving efficiency.</p><p xmlns="http://www.w3.org/1999/xhtml">The construction of the quantum state involves the initialization of qubits, phase modulation, and gate operations. This process can be implemented using basic quantum gates such as rotation gates and CNOT gates, so that the required quantum state can be realized in the quantum circuit.</p><p xmlns="http://www.w3.org/1999/xhtml">Step Three: Finding Each Unitary Operator in the Uncertainty Algorithm</p><p xmlns="http://www.w3.org/1999/xhtml">Finally, each unitary operator must be found within the uncertainty algorithm. This step is crucial because the selection of unitary operators directly affects the effectiveness of the quantum query. By reasonably selecting and designing unitary operators, efficient quantum querying can be achieved.</p><p xmlns="http://www.w3.org/1999/xhtml">In this process, it may be necessary to utilize methods such as mathematical optimization and machine learning to find the optimal combination of unitary operators. In addition, for specific Boolean functions, customized algorithms may be required to ensure query efficiency and accuracy.</p><p xmlns="http://www.w3.org/1999/xhtml">The implementation logic of MicroAlgo&#39;s entire technical framework can be summarized as: the use of multilinear polynomials, the construction of quantum states, and the selection of unitary operators. Through the sum-of-squares representation, the properties of Boolean functions can be effectively analyzed, providing a theoretical foundation for the subsequent design of quantum algorithms.</p><p xmlns="http://www.w3.org/1999/xhtml">The constructed quantum states not only need to meet the basic requirements of querying but must also fully leverage the characteristics of quantum superposition and entanglement to enhance the parallelism of queries. Finally, by carefully selecting and designing unitary operators, efficient querying of Boolean functions can be achieved, thereby maximizing the performance of quantum algorithms.</p><p xmlns="http://www.w3.org/1999/xhtml">MicroAlgo&#39;s development of this technology is based on the sum-of-squares representation of Boolean functions and has successfully designed a technical framework for optimal exact quantum query algorithms, bringing a brand-new perspective and implementation path to the field of quantum computing.</p><p xmlns="http://www.w3.org/1999/xhtml">Through in-depth analysis of the structure of Boolean functions and with the aid of quantum state construction and precise design of unitary operators, this framework demonstrates outstanding query efficiency and theoretical superiority. The sum-of-squares representation of Boolean functions not only provides a solid mathematical foundation for the design of quantum decision tree algorithms but also effectively reveals the intrinsic relationships between functions, helping us better understand the complexity issues in quantum algorithms. This method, which combines algebraic techniques with quantum physics, offers new research directions for quantum computing and lays the groundwork for the further optimization of exact quantum query algorithms.</p><p xmlns="http://www.w3.org/1999/xhtml">Although the current technical framework faces challenges in dealing with certain practical problems—for example, the algorithm may be infeasible in specific situations—the algorithmic framework based on sum-of-squares representations has already demonstrated its powerful potential in solving problems with low complexity. This optimization of the quantum query model can significantly reduce the consumption of computational resources while increasing the query speed of the algorithm, thereby further improving the overall performance of quantum computing. This has great application prospects and practicality across multiple fields within quantum information science, including quantum communication, quantum security, and quantum machine learning.</p><p xmlns="http://www.w3.org/1999/xhtml">As a disruptive technology, quantum computing&#39;s potential impact will far exceed the scope of traditional computing. The optimal exact quantum query algorithm technical framework developed by MicroAlgo, though currently focused mainly on the exact querying of Boolean functions, possesses a highly scalable philosophy and methodology. By further exploring more complex Boolean functions and their quantum representations, it is expected that MicroAlgo&#39;s technology will be applied to a broader range of fields, including large-scale quantum data processing, complex system optimization, and future AI enhancement. As quantum computing technology continues to evolve and improve, more and more difficult problems will find new solutions through this algorithmic framework.</p><p xmlns="http://www.w3.org/1999/xhtml">Whether in academia or industry, the potential value of this technical framework is immeasurable. It will drive quantum computing to take a solid step from theoretical research toward practical application and inject continuous new momentum into global scientific and technological innovation.</p><p xmlns="http://www.w3.org/1999/xhtml"><b xmlns="http://www.w3.org/1999/xhtml">About MicroAlgo Inc.</b></p><p xmlns="http://www.w3.org/1999/xhtml">MicroAlgo Inc. (the &#34;MicroAlgo&#34;), a Cayman Islands exempted company, is dedicated to the development and application of bespoke central processing algorithms. MicroAlgo provides comprehensive solutions to customers by integrating central processing algorithms with software or hardware, or both, thereby helping them to increase the number of customers, improve end-user satisfaction, achieve direct cost savings, reduce power consumption, and achieve technical goals. The range of MicroAlgo&#39;s services includes algorithm optimization, accelerating computing power without the need for hardware upgrades, lightweight data processing, and data intelligence services. MicroAlgo&#39;s ability to efficiently deliver software and hardware optimization to customers through bespoke central processing algorithms serves as a driving force for MicroAlgo&#39;s long-term development.</p><p xmlns="http://www.w3.org/1999/xhtml"><b xmlns="http://www.w3.org/1999/xhtml">Forward-Looking Statements</b></p><p xmlns="http://www.w3.org/1999/xhtml">This press release contains statements that may constitute &#34;forward-looking statements.&#34; Forward-looking statements are subject to numerous conditions, many of which are beyond the control of MicroAlgo, including those set forth in the Risk Factors section of MicroAlgo&#39;s periodic reports on Forms 10-K and 8-K filed with the SEC. Copies are available on the SEC&#39;s website, <a xmlns="http://www.w3.org/1999/xhtml" href="http://www.sec.gov/" target="_blank" rel="nofollow">www.sec.gov</a>. Words such as &#34;expect,&#34; &#34;estimate,&#34; &#34;project,&#34; &#34;budget,&#34; &#34;forecast,&#34; &#34;anticipate,&#34; &#34;intend,&#34; &#34;plan,&#34; &#34;may,&#34; &#34;will,&#34; &#34;could,&#34; &#34;should,&#34; &#34;believes,&#34; &#34;predicts,&#34; &#34;potential,&#34; &#34;continue,&#34; and similar expressions are intended to identify such forward-looking statements. These forward-looking statements include, without limitation, MicroAlgo&#39;s expectations with respect to future performance and anticipated financial impacts of the business transaction.</p><p xmlns="http://www.w3.org/1999/xhtml">MicroAlgo undertakes no obligation to update these statements for revisions or changes after the date of this release, except as may be required by law.</p>



<p xmlns="http://www.w3.org/1999/xhtml" id="PURL"><img xmlns="http://www.w3.org/1999/xhtml" title="Cision" width="12" height="12" alt="Cision" src="https://edge.prnewswire.com/c/img/favicon.png?sn=CN48214&amp;sd=2026-04-30"></img> View original content:<a xmlns="http://www.w3.org/1999/xhtml" id="PRNURL" rel="nofollow" href="https://www.prnewswire.com/news-releases/microalgo-inc-develops-optimal-precise-quantum-query-algorithm-based-on-sum-of-squares-representation-form-of-boolean-functions-302759043.html" target="_blank">https://www.prnewswire.com/news-releases/microalgo-inc-develops-optimal-precise-quantum-query-algorithm-based-on-sum-of-squares-representation-form-of-boolean-functions-302759043.html</a></p><p xmlns="http://www.w3.org/1999/xhtml">SOURCE MicroAlgo Inc.</p>

MicroAlgo Inc. has announced a new framework for optimizing exact quantum query algorithms focused on Boolean functions. This innovative approach promises to boost processing efficiency in quantum computing, signaling potential future applications across various fields in quantum information science. Investors should monitor how this development might affect MLGO's growth trajectory in the evolving quantum landscape.

MicroAlgo Inc. Develops Optimal Precise Quantum Query Algorithm Based on Sum-of-Squares Representation Form of Boolean Functions

AI Summary

Sentiment Rationale

Trading Thesis

Market-Moving

Key Facts

Companies Mentioned

Corporate Developments

Related News