Skip to main content
Springer Nature Link
Log in

Using small-scale quantum devices to solve algebraic equations

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

Solving algebraic equations over GF(2) is a problem which has a wide range of applications, including NP-Hard problems and problems related to cryptography. The existing mature algorithms are difficult to solve large-scale problems. Inspired by Schöning’s algorithm and its quantum version, we apply related methods to solve algebraic equations over GF (2). The new algorithm we proposed has a significant improvement of solving efficiency in large-scale and sparse algebraic equations. As a hybrid algorithm, the new algorithm can not only run on a classic computer alone, but also use small-scale quantum devices to assist acceleration. And the new algorithm can be seen as an example of solving a large-scale problem on a small-scale quantum device.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Armknecht, F.: Improving fast algebraic attacks. Lect. Notes Comput. Sci. 3017, 65–82 (2004)

    Article  MATH  Google Scholar 

  2. Bard, G.V.: Algorithms for solving linear and polynomial systems of equations over finite fields, with applications to cryptanalysis (2007)

  3. Bard, G.V., Courtois, N., Jefferson, C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over gf(2) via sat-solvers. System 2007, (2007)

  4. Bardet, M., Faugre, J.C., Salvy, B., Spaenlehauer, P.J.: On the complexity of solving quadratic boolean systems. J. Complex. (2013)

  5. Courtois, N., Bard, G.V.: Algebraic cryptanalysis of the data encryption standard. In: Proceedings of 11th IMA International Conference Cryptography and Coding, Cirencester, UK (2006)

  6. Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: International Conference on Advances in Cryptology-eurocrypt (2000)

  7. Cox, D.A., John, L., Donal, O.: Using algebraic geometry (2005)

  8. Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Sch?Ning, U.: A deterministic (22/(k+1))n algorithm for k-sat based on local search. Theoret. Comput. 289(1), 69–83 (2002)

  9. Dunjko, V., Ge, Y., Cirac, J.I.: Computational speedups using small quantum devices. Phys. Rev. Lett. 121(25), 250501 (2018)

    Article  ADS  Google Scholar 

  10. Ge, Y., Dunjko, V.: A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles. J. Math. Phys. 61(1), 012201 (2020)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  11. Herbort, S., Ratz, D.: Improving the efficiency of a nonlinear-system-solver using a componentwise newton method. Institut Fr Angewandte Mathematik Universitt Karlsruhe (1997)

  12. Hochba, D.S.: Approximation algorithms for np-hard problems. ACM Sigact News 28(2), 40–52 (1997)

  13. Kannan, R., Karpinski, M., Prmel, H.J.: Approximation algorithms for np-hard problems

  14. Litman, M.F.: On covering problems of codes. Theory Comput. Syst. (1997)

  15. LIYao-hui, LIUBao-Jun: Survey of finding real roots of nonlinear equations(in chinese). J.f Wuhan Univ. Sci. Technol. 03, 326–330 (2004)

  16. Miura, H., Hashimoto, Y., Takagi, T.: Extended algorithm for solving underdefined multivariate quadratic equations. In: International Workshop on Post-Quantum Cryptography (2013)

  17. Moser, R.A., Scheder, D.: A full derandomization of schöning’s k-sat algorithm. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC ’11, p. 245252. Association for Computing Machinery, New York (2011). https://doi.org/10.1145/1993636.1993670

  18. Rennela, M., Laarman, A., Dunjko, V.: Hybrid divide-and-conquer approach for tree search algorithms (2020)

  19. Schoning, T.: A probabilistic algorithm for k-sat and constraint satisfaction problems. In: 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039), pp. 410–414. IEEE (1999)

  20. Yang, B.Y., Chen, J.M.: Theoretical analysis of xl over small fields. In: Information Security Privacy: Australasian Conference (2004)

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, 450001, China

    Hongshu Li, Zhi Ma, Hong Wang, Qianheng Duan, Yangyang Fei & Xiangdong Meng

Authors
  1. Hongshu Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zhi Ma
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Hong Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Qianheng Duan
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Yangyang Fei
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Xiangdong Meng
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Hong Wang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported in part by the National Natural Science Foundation of China (Grants Nos. 61972413, 61701539, 61901525), and in part by the National Cryptography Development Fund (mmjj20180107, mmjj20180212).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, H., Ma, Z., Wang, H. et al. Using small-scale quantum devices to solve algebraic equations. Quantum Inf Process 20, 140 (2021). https://doi.org/10.1007/s11128-021-03064-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-021-03064-6

Keywords