IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i23p4571-d991760.html
   My bibliography  Save this article

Hierarchical Quantum Information Splitting of an Arbitrary Two-Qubit State Based on a Decision Tree

Author

Listed:
  • Dongfen Li

    (School of Computer and Network Security, Chengdu University of Technology, Chengdu 610059, China)

  • Yundan Zheng

    (School of Computer and Network Security, Chengdu University of Technology, Chengdu 610059, China)

  • Xiaofang Liu

    (School of Computer and Network Security, Chengdu University of Technology, Chengdu 610059, China)

  • Jie Zhou

    (School of Computer and Network Security, Chengdu University of Technology, Chengdu 610059, China)

  • Yuqiao Tan

    (School of Computer and Network Security, Chengdu University of Technology, Chengdu 610059, China)

  • Xiaolong Yang

    (School of Computer and Network Security, Chengdu University of Technology, Chengdu 610059, China)

  • Mingzhe Liu

    (School of Computer and Network Security, Chengdu University of Technology, Chengdu 610059, China)

Abstract

Quantum informatics is a new subject formed by the intersection of quantum mechanics and informatics. Quantum communication is a new way to transmit quantum states through quantum entanglement, quantum teleportation, and quantum information splitting. Based on the research of multiparticle state quantum information splitting, this paper innovatively combines the decision tree algorithm of machine learning with quantum communication to solve the problem of channel particle allocation in quantum communication, and experiments showed that the algorithm can make the optimal allocation scheme. Based on this scheme, we propose a two-particle state hierarchical quantum information splitting scheme based on the multi-particle state. First, Alice measures the Bell states of the particles she owns and tells the result to the receiver through the classical channel. If the receiver is a high-level communicator, he only needs the help of one of the low-level communicators and all the high-level communicators. After performing a single particle measurement on the z-basis, they send the result to the receiver through the classical channel. When the receiver is a low-level communicator, all communicators need to measure the particles they own and tell the receiver the results. Finally, the receiver performs the corresponding unitary operation according to the received results. In this regard, a complete hierarchical quantum information splitting operation is completed. On the basis of theoretical research, we also carried out experimental verification, security analysis, and comparative analysis, which shows that our scheme is reliable and has high security and efficiency.

Suggested Citation

  • Dongfen Li & Yundan Zheng & Xiaofang Liu & Jie Zhou & Yuqiao Tan & Xiaolong Yang & Mingzhe Liu, 2022. "Hierarchical Quantum Information Splitting of an Arbitrary Two-Qubit State Based on a Decision Tree," Mathematics, MDPI, vol. 10(23), pages 1-18, December.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4571-:d:991760
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/23/4571/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/23/4571/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bogumił Kamiński & Michał Jakubczyk & Przemysław Szufel, 2018. "A framework for sensitivity analysis of decision trees," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(1), pages 135-159, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Deac Dan Stelian & Schebesch Klaus Bruno, 2018. "Market Forecasts and Client Behavioral Data: Towards Finding Adequate Model Complexity," Studia Universitatis „Vasile Goldis” Arad – Economics Series, Sciendo, vol. 28(3), pages 50-75, September.
    2. Ivan Miguel Pires & Faisal Hussain & Nuno M. Garcia & Petre Lameski & Eftim Zdravevski, 2020. "Homogeneous Data Normalization and Deep Learning: A Case Study in Human Activity Classification," Future Internet, MDPI, vol. 12(11), pages 1-14, November.
    3. Fieberg, Christian & Günther, Steffen & Poddig, Thorsten & Zaremba, Adam, 2024. "Non-standard errors in the cryptocurrency world," International Review of Financial Analysis, Elsevier, vol. 92(C).
    4. Michelle Sapitang & Wanie M. Ridwan & Khairul Faizal Kushiar & Ali Najah Ahmed & Ahmed El-Shafie, 2020. "Machine Learning Application in Reservoir Water Level Forecasting for Sustainable Hydropower Generation Strategy," Sustainability, MDPI, vol. 12(15), pages 1-19, July.
    5. Pinciroli, Luca & Baraldi, Piero & Zio, Enrico, 2023. "Maintenance optimization in industry 4.0," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    6. Fabrizio De Caro & Amedeo Andreotti & Rodolfo Araneo & Massimo Panella & Antonello Rosato & Alfredo Vaccaro & Domenico Villacci, 2020. "A Review of the Enabling Methodologies for Knowledge Discovery from Smart Grids Data," Energies, MDPI, vol. 13(24), pages 1-25, December.
    7. Tymoteusz Miller & Grzegorz Mikiciuk & Anna Kisiel & Małgorzata Mikiciuk & Dominika Paliwoda & Lidia Sas-Paszt & Danuta Cembrowska-Lech & Adrianna Krzemińska & Agnieszka Kozioł & Adam Brysiewicz, 2023. "Machine Learning Approaches for Forecasting the Best Microbial Strains to Alleviate Drought Impact in Agriculture," Agriculture, MDPI, vol. 13(8), pages 1-16, August.
    8. Jorge Omar Razo-De-Anda & Luis Lorenzo Romero-Castro & Francisco Venegas-Martínez, 2023. "Contagion Patterns Classification in Stock Indices: A Functional Clustering Analysis Using Decision Trees," Mathematics, MDPI, vol. 11(13), pages 1-27, July.
    9. Kamyab Karimi & Ali Ghodratnama & Reza Tavakkoli-Moghaddam, 2023. "Two new feature selection methods based on learn-heuristic techniques for breast cancer prediction: a comprehensive analysis," Annals of Operations Research, Springer, vol. 328(1), pages 665-700, September.
    10. Dimitar Haralampiev Popov, 2022. "SME Viability Assessment Methodology: Combining Altman's Z-Score with Big Data," Bulgarian Economic Papers bep-2022-04, Faculty of Economics and Business Administration, Sofia University St Kliment Ohridski - Bulgaria // Center for Economic Theories and Policies at Sofia University St Kliment Ohridski, revised Jun 2022.
    11. Abdul Majeed, 2019. "Improving Time Complexity and Accuracy of the Machine Learning Algorithms Through Selection of Highly Weighted Top k Features from Complex Datasets," Annals of Data Science, Springer, vol. 6(4), pages 599-621, December.
    12. Benjamin M. Abdel-Karim & Nicolas Pfeuffer & Oliver Hinz, 2021. "Machine learning in information systems - a bibliographic review and open research issues," Electronic Markets, Springer;IIM University of St. Gallen, vol. 31(3), pages 643-670, September.
    13. Jana Gerlach & Paul Hoppe & Sarah Jagels & Luisa Licker & Michael H. Breitner, 2022. "Decision support for efficient XAI services - A morphological analysis, business model archetypes, and a decision tree," Electronic Markets, Springer;IIM University of St. Gallen, vol. 32(4), pages 2139-2158, December.
    14. João R. B. Paiva & Alana S. Magalhães & Pedro H. F. Moraes & Júnio S. Bulhões & Wesley P. Calixto, 2021. "Stability Metric Based on Sensitivity Analysis Applied to Electrical Repowering System," Energies, MDPI, vol. 14(22), pages 1-21, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4571-:d:991760. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.