{"title":"一维离散时间量子行走的包络","authors":"Yunguo Lin , Shuiying Cai","doi":"10.1016/j.ins.2025.122722","DOIUrl":null,"url":null,"abstract":"<div><div>A mathematical model is presented for a one-dimensional discrete-time quantum walk, which is initiated from a quantum initial state and governed by a coin operator. When the coin operator is a flip operator, a path analysis formula is employed to compute the position probability distribution. For a general coin operator, matrix decomposition is utilized to transform it into the equivalent flip operator. When a walker undergoes <span><math><mi>n</mi></math></span> steps of evolution, it is observed that the probability of the walker occupying any given position exhibits the existence of both maximum and minimum values, irrespective of the quantum initial state. By linking these extreme positions together, a confined region is delineated, the boundary of which is designated as the envelope of the quantum walk. Remarkably, the envelope is independent of the quantum initial state. To facilitate the computation of this envelope, the relevant formulas are transformed into rational expressions, wherein both the numerators and denominators are represented by polynomials with even integer coefficients. These polynomials are classified to determine the coefficients of the numerator polynomials. An analysis is conducted to identify the location of the maximum value of the envelope, thereby examining the maximum value of the position probability distribution.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"726 ","pages":"Article 122722"},"PeriodicalIF":6.8000,"publicationDate":"2025-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The envelope of one-dimensional discrete-time quantum walk\",\"authors\":\"Yunguo Lin , Shuiying Cai\",\"doi\":\"10.1016/j.ins.2025.122722\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>A mathematical model is presented for a one-dimensional discrete-time quantum walk, which is initiated from a quantum initial state and governed by a coin operator. When the coin operator is a flip operator, a path analysis formula is employed to compute the position probability distribution. For a general coin operator, matrix decomposition is utilized to transform it into the equivalent flip operator. When a walker undergoes <span><math><mi>n</mi></math></span> steps of evolution, it is observed that the probability of the walker occupying any given position exhibits the existence of both maximum and minimum values, irrespective of the quantum initial state. By linking these extreme positions together, a confined region is delineated, the boundary of which is designated as the envelope of the quantum walk. Remarkably, the envelope is independent of the quantum initial state. To facilitate the computation of this envelope, the relevant formulas are transformed into rational expressions, wherein both the numerators and denominators are represented by polynomials with even integer coefficients. These polynomials are classified to determine the coefficients of the numerator polynomials. An analysis is conducted to identify the location of the maximum value of the envelope, thereby examining the maximum value of the position probability distribution.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"726 \",\"pages\":\"Article 122722\"},\"PeriodicalIF\":6.8000,\"publicationDate\":\"2025-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525008588\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525008588","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
The envelope of one-dimensional discrete-time quantum walk
A mathematical model is presented for a one-dimensional discrete-time quantum walk, which is initiated from a quantum initial state and governed by a coin operator. When the coin operator is a flip operator, a path analysis formula is employed to compute the position probability distribution. For a general coin operator, matrix decomposition is utilized to transform it into the equivalent flip operator. When a walker undergoes steps of evolution, it is observed that the probability of the walker occupying any given position exhibits the existence of both maximum and minimum values, irrespective of the quantum initial state. By linking these extreme positions together, a confined region is delineated, the boundary of which is designated as the envelope of the quantum walk. Remarkably, the envelope is independent of the quantum initial state. To facilitate the computation of this envelope, the relevant formulas are transformed into rational expressions, wherein both the numerators and denominators are represented by polynomials with even integer coefficients. These polynomials are classified to determine the coefficients of the numerator polynomials. An analysis is conducted to identify the location of the maximum value of the envelope, thereby examining the maximum value of the position probability distribution.
期刊介绍:
Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions.
Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.