Abstract
There are numerous ideas that have been provided by quantum walks for new quantum algorithms. In this article, we surveyed the discrete quantum walk algorithm to present probability distributions. Moreover, we transformed the algorithm into MATLAB programming. Finally, the programming can be utilised to compare coin flip transformations that generate probability distributions as proposed in several previous articles and also to identify a unitarity of a coin flip transformation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
