skip to main content
10.1145/3573428.3573611acmotherconferencesArticle/Chapter ViewAbstractPublication PageseitceConference Proceedingsconference-collections
research-article

Preparation and Simulation of Quantum States of Matrices

Authors Info & Claims
Published:15 March 2023Publication History

ABSTRACT

A basic problem of quantum computing is how to effectively express classical data in quantum systems. This problem is called state preparation problem, and the process of preparing quantum states is called coding. In this paper, the classical data of matrix is transformed into quantum states in the form of amplitude coding and simulated. This paper first introduces the detailed process of matrix transformation into the linear combination of quantum ground state, then designs a quantum circuit model to realize amplitude coding according to the idea of binary tree model and quantum random walk algorithm, and finally simulates the three matrices on IBM quantum cloud platform, and analyzes and introduces many situations. The experimental results verify the feasibility of converting the matrix into quantum states by amplitude coding, analyze the causes of errors in the experimental process, and put forward the corresponding solutions. This paper introduces in detail the whole process of matrix conversion to quantum states and the construction of quantum circuits for simulation. Compared with the existing experiments, the quantum circuits constructed in this paper are shorter in length, less in number of quantum gates, and more versatile.

References

  1. Chen Jiajun. Review on Quantum Communication and Quantum Computation [J]. Journal of Physics: Conference Series, 2021,1865(2).Google ScholarGoogle Scholar
  2. Ashley Montanaro. Quantum algorithms: an overview [J]. npj Quantum Information, 2016, 2(1): 1-52.Google ScholarGoogle Scholar
  3. He-Liang Huang Superconducting quantum computing: a review [J]. Science China Information Sciences, 2020, 63(8): 595-600.Google ScholarGoogle Scholar
  4. Soklakov A N, Schack R, 2006, Phys. Rev. A 73 012307.Google ScholarGoogle Scholar
  5. Schuld M, Petruccione F, 2018, Supervised Learning with Quantum Computers (Vol. 17) (Berlin: Springer) pp139–171.Google ScholarGoogle Scholar
  6. Grover L, Rudolph T. Creating superpositions that correspond to efficiently integrable probability distributions [J]. arXiv, 2002.Google ScholarGoogle Scholar
  7. Kaye P, Mosca M 2001International Conference on Quantum Information New York, USA, June 13, 2001, p28.Google ScholarGoogle Scholar
  8. He C, Li J, Liu W, A Low Complexity Quantum Principal Component Analysis Algorithm [J]. arXiv e-prints, 2020.Google ScholarGoogle Scholar
  9. Kadian Karuna and Garhwal Sunita and Kumar Ajay. Quantum walk and its application domains: A systematic review [J]. Computer Science Review, 2021, 41.Google ScholarGoogle Scholar
  10. Duan B, Yuan J, Ying L, Efficient quantum circuit for singular-value thresholding [J]. Physical Review A, 2018, 98(1):012308-.Google ScholarGoogle ScholarCross RefCross Ref
  11. Chen LiuYa Denoising in SVD-based ghost imaging. [J]. Optics express, 2022, 30(4): 6248-6257.Google ScholarGoogle Scholar
  12. Tomi H Johnson and Stephen R Clark and Dieter Jaksch. What is a quantum simulator? [J]. EPJ Quantum Technology, 2014, 1(1): 1-12.Google ScholarGoogle Scholar
  13. Kerenidis I, Prakash A. Quantum Recommendation Systems [C]//, 2016.Google ScholarGoogle Scholar
  14. Alchieri Leonardo An introduction to quantum machine learning: from quantum logic to quantum deep learning [J]. Quantum Machine Intelligence, 2021, 3(2).Google ScholarGoogle Scholar
  15. Coles P J, Eidenbenz S, Pakin S, Quantum Algorithm Implementations for Beginners [J]. 2018.Google ScholarGoogle Scholar
  16. Li G, Ding Y, Xie Y. Tackling the Qubit Map-ping Problem for NISQ-Era Quantum Devices [C]// the Twenty-Fourth International Conference. 2019.Google ScholarGoogle Scholar
  17. Lou Xiaoping Quantum Identity Authentication Scheme Based on Quantum Walks on Graphs with IBM Quantum Cloud Platform [J]. International Journal of Theoretical Physics, 2022, 61(2).Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    EITCE '22: Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering
    October 2022
    1999 pages
    ISBN:9781450397148
    DOI:10.1145/3573428

    Copyright © 2022 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 15 March 2023

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited

    Acceptance Rates

    Overall Acceptance Rate508of972submissions,52%
  • Article Metrics

    • Downloads (Last 12 months)13
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format