We study the average position and the symmetry of the distribution in the SU（2） open quantum random walk （OQRW）. We show that the average position in the central limit theorem （CLT） is non-uniform compared with ...We study the average position and the symmetry of the distribution in the SU（2） open quantum random walk （OQRW）. We show that the average position in the central limit theorem （CLT） is non-uniform compared with the average position in the non-CLT. The symmetry of distribution is shown to be even in the CLT.展开更多
We study the open quantum random walk (OQRW) with time-dependence on the one-dimensional lattice space and obtain the associated limit distribution. As an application we study the return probability of the OQRW. We al...We study the open quantum random walk (OQRW) with time-dependence on the one-dimensional lattice space and obtain the associated limit distribution. As an application we study the return probability of the OQRW. We also ask, "What is the average time for the return probability of the OQRW?"展开更多
In this paper we define direct product of graphs and give a recipe for obtaining probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability o...In this paper we define direct product of graphs and give a recipe for obtaining probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability of observing particle on direct product of graph is obtained by multiplication of probability on the corresponding to sub-graphs, where this method is useful to determining probability of walk on compficated graphs. Using this method, we calculate the probability of Continuous-time classical and quantum random walks on many of finite direct product Cayley graphs （complete cycle, complete Kn, charter and n-cube）. Also, we inquire that the classical state the stationary uniform distribution is reached as t→∞ but for quantum state is not always satisfied.展开更多
The present paper is focused on non-uniform quantum coins for the quantum random walk search algorithm. This is an alternative to the modification of the shift operator, which divides the search space into two parts. ...The present paper is focused on non-uniform quantum coins for the quantum random walk search algorithm. This is an alternative to the modification of the shift operator, which divides the search space into two parts. This method changes the quantum coins, while the shift operator remains unchanged and sustains the hypercube topology. The results discussed in this paper are obtained by both theoretical calculations and numerical simulations.展开更多
In the optical quantum random walk system,phase nuctuation and Deam splitter uuctuation are two unavoldable decoherence factors.These two factors degrade the performance of quantum random walk by destroying coherence,...In the optical quantum random walk system,phase nuctuation and Deam splitter uuctuation are two unavoldable decoherence factors.These two factors degrade the performance of quantum random walk by destroying coherence,and even degrade it into a classical one.We propose a scheme for the simulation of quantum random walk using phase shifters,tunable beam splitters,and photodetectors.This proposed scheme enables us to analyze the effect of phase fluctuation and beam splitter fluctuation on two-photon quantum random walk.Furthermore,it is helpful to guide the control of phase fluctuation and beam snlitter fluctuation in the exneriment.展开更多
Quantum algorithms have demonstrated provable speedups over classical counterparts,yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge.In this work,we de...Quantum algorithms have demonstrated provable speedups over classical counterparts,yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge.In this work,we decode the quantum search advantage by investigating the critical role of quantum state properties in random-walk-based algorithms.We propose three distinct variants of quantum random-walk search algorithms and derive exact analytical expressions for their success probabilities.These probabilities are fundamentally determined by specific initial state properties:the coherence fraction governs the first algorithm’s performance,while entanglement and coherence dominate the outcomes of the second and third algorithms,respectively.We show that increased coherence fraction enhances success probability,but greater entanglement and coherence reduce it in the latter two cases.These findings reveal fundamental insights into harnessing quantum properties for advantage and guide algorithm design.Our searches achieve Grover-like speedups and show significant potential for quantum-enhanced machine learning.展开更多
This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the se...This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.展开更多
This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the opt...This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative.展开更多
This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this ...This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover＇s algorithm.展开更多
Weak cross-Kerr media provides additional degrees of freedom of qubits in quantum information processing.In this paper,by exploiting weak cross-Kerr nonlinearity,we propose an optical implementation scheme of one-dime...Weak cross-Kerr media provides additional degrees of freedom of qubits in quantum information processing.In this paper,by exploiting weak cross-Kerr nonlinearity,we propose an optical implementation scheme of one-dimensional quantum random walks. The random walks are described by the interaction of single photons with cross-Kerr media.The proposed scheme can also be used to implement one-dimensional quantum random walks on an infinite line.展开更多
We investigated discrete-time quantum walks with an arbitary unitary coin.Here we discover that the average position x=max（x） sin（α＋γ）,while the initial state is 1/2～（1/2）（｜0L＋i｜0R）.We verify the result...We investigated discrete-time quantum walks with an arbitary unitary coin.Here we discover that the average position x=max（x） sin（α＋γ）,while the initial state is 1/2～（1/2）（｜0L＋i｜0R）.We verify the result,and obtain some symmetry properties of quantum walks with a U（2） coin with ｜0L and ｜0R as the initial state.展开更多
In this paper the return probability of the one-dimensional discrete-time quantum walk is studied. We derive probabilistic formulas for the return probability related to the quantum walk governed by the Fibonacci coin.
We study decoherence in the quantum walk on the xy-plane. We generalize the method of decoherent coin quantum walk, introduced by [T.A. Brun, et al., Phys. Rev. A 67 （2003） 032304], which could be applicable to all ...We study decoherence in the quantum walk on the xy-plane. We generalize the method of decoherent coin quantum walk, introduced by [T.A. Brun, et al., Phys. Rev. A 67 （2003） 032304], which could be applicable to all sorts of decoherence in two-dimensional quantum walks, irrespective of the unitary transformation governing the walk. As an application we study decoherence in the presence of broken line noise in which the quantum walk is governed by the two-dimensional ttadamard operator.展开更多
Following Konno [1], it is natural to ask: What is the Ito’s formula for the discrete time quantum walk on a graph different than Z, the set of integers? In this paper we answer the question for the discrete time qua...Following Konno [1], it is natural to ask: What is the Ito’s formula for the discrete time quantum walk on a graph different than Z, the set of integers? In this paper we answer the question for the discrete time quantum walk on Z2, the square lattice.展开更多
量子行走得益于概率幅的叠加特性,可同时出现在多条路径中,使其能以平方式乃至指数级别的速度加速扩散所携带的量子信息。文章基于无向图G=(V,E)结构,从离散时间量子随机行走(Discrete Time Quantum Walk,DTQW)搜索算法特性出发,运用幺...量子行走得益于概率幅的叠加特性,可同时出现在多条路径中,使其能以平方式乃至指数级别的速度加速扩散所携带的量子信息。文章基于无向图G=(V,E)结构,从离散时间量子随机行走(Discrete Time Quantum Walk,DTQW)搜索算法特性出发,运用幺正变换的硬币算符与迁移算符,构建了DTQW搜索算法步骤框图,在此基础上,应用SKW搜索算法对4节点无向图中的标记节点态进行搜索,通过态塌缩的观测,实现以1/4概率化读取出目标节点。研究结果表明,当有n个足够大的量子系统,并保持彼此之间的强纠缠性时,量子随机行走可以过渡到经典随机行走。文章还详细讨论了DTQW搜索算法实现左右同移的二次加速搜索机制。展开更多
文摘We study the average position and the symmetry of the distribution in the SU（2） open quantum random walk （OQRW）. We show that the average position in the central limit theorem （CLT） is non-uniform compared with the average position in the non-CLT. The symmetry of distribution is shown to be even in the CLT.
文摘We study the open quantum random walk (OQRW) with time-dependence on the one-dimensional lattice space and obtain the associated limit distribution. As an application we study the return probability of the OQRW. We also ask, "What is the average time for the return probability of the OQRW?"
文摘In this paper we define direct product of graphs and give a recipe for obtaining probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability of observing particle on direct product of graph is obtained by multiplication of probability on the corresponding to sub-graphs, where this method is useful to determining probability of walk on compficated graphs. Using this method, we calculate the probability of Continuous-time classical and quantum random walks on many of finite direct product Cayley graphs （complete cycle, complete Kn, charter and n-cube）. Also, we inquire that the classical state the stationary uniform distribution is reached as t→∞ but for quantum state is not always satisfied.
文摘The present paper is focused on non-uniform quantum coins for the quantum random walk search algorithm. This is an alternative to the modification of the shift operator, which divides the search space into two parts. This method changes the quantum coins, while the shift operator remains unchanged and sustains the hypercube topology. The results discussed in this paper are obtained by both theoretical calculations and numerical simulations.
基金Project supported by the National Natural Science Foundation of China(Grant No.61701139).
文摘In the optical quantum random walk system,phase nuctuation and Deam splitter uuctuation are two unavoldable decoherence factors.These two factors degrade the performance of quantum random walk by destroying coherence,and even degrade it into a classical one.We propose a scheme for the simulation of quantum random walk using phase shifters,tunable beam splitters,and photodetectors.This proposed scheme enables us to analyze the effect of phase fluctuation and beam splitter fluctuation on two-photon quantum random walk.Furthermore,it is helpful to guide the control of phase fluctuation and beam snlitter fluctuation in the exneriment.
基金supported by the Fundamental Research Funds for the Central Universities,the National Natural Science Foundation of China(Grant Nos.12371132,12075159,12171044,12071179,and 12405006)the specific research fund of the Innovation Platform for Academicians of Hainan Province.
文摘Quantum algorithms have demonstrated provable speedups over classical counterparts,yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge.In this work,we decode the quantum search advantage by investigating the critical role of quantum state properties in random-walk-based algorithms.We propose three distinct variants of quantum random-walk search algorithms and derive exact analytical expressions for their success probabilities.These probabilities are fundamentally determined by specific initial state properties:the coherence fraction governs the first algorithm’s performance,while entanglement and coherence dominate the outcomes of the second and third algorithms,respectively.We show that increased coherence fraction enhances success probability,but greater entanglement and coherence reduce it in the latter two cases.These findings reveal fundamental insights into harnessing quantum properties for advantage and guide algorithm design.Our searches achieve Grover-like speedups and show significant potential for quantum-enhanced machine learning.
基金supported by the National Basic Research Program of China(Grant No.2013CB338002)
文摘This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.
基金supported by the National Basic Research Program of China(Grant No.2013CB338002)
文摘This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative.
基金Project supported by the National Basic Research Program of China(Grant No.2013CB338002)
文摘This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover＇s algorithm.
基金supported by the National Basic Research Program of China (2010CB923202)the Specialized Research Fund for Doctoral Programs of the Ministry of Education of China(20090005120008)+1 种基金the Fundamental Research Funds for the Central Universities(BUPT2009RC0710)the National Natural Science Foundation of China(10805010,10947151)
文摘Weak cross-Kerr media provides additional degrees of freedom of qubits in quantum information processing.In this paper,by exploiting weak cross-Kerr nonlinearity,we propose an optical implementation scheme of one-dimensional quantum random walks. The random walks are described by the interaction of single photons with cross-Kerr media.The proposed scheme can also be used to implement one-dimensional quantum random walks on an infinite line.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 10974192 and 61275122)the National Basic Research Program of China(Grant Nos. 2011CB921200 and 2011CBA00200)K. C. Wong Education Foundation and the Chinese Academy of Sciences
文摘We investigated discrete-time quantum walks with an arbitary unitary coin.Here we discover that the average position x=max（x） sin（α＋γ）,while the initial state is 1/2～（1/2）（｜0L＋i｜0R）.We verify the result,and obtain some symmetry properties of quantum walks with a U（2） coin with ｜0L and ｜0R as the initial state.
文摘In this paper the return probability of the one-dimensional discrete-time quantum walk is studied. We derive probabilistic formulas for the return probability related to the quantum walk governed by the Fibonacci coin.
文摘We study decoherence in the quantum walk on the xy-plane. We generalize the method of decoherent coin quantum walk, introduced by [T.A. Brun, et al., Phys. Rev. A 67 （2003） 032304], which could be applicable to all sorts of decoherence in two-dimensional quantum walks, irrespective of the unitary transformation governing the walk. As an application we study decoherence in the presence of broken line noise in which the quantum walk is governed by the two-dimensional ttadamard operator.
文摘Following Konno [1], it is natural to ask: What is the Ito’s formula for the discrete time quantum walk on a graph different than Z, the set of integers? In this paper we answer the question for the discrete time quantum walk on Z2, the square lattice.
文摘量子行走得益于概率幅的叠加特性,可同时出现在多条路径中,使其能以平方式乃至指数级别的速度加速扩散所携带的量子信息。文章基于无向图G=(V,E)结构,从离散时间量子随机行走(Discrete Time Quantum Walk,DTQW)搜索算法特性出发,运用幺正变换的硬币算符与迁移算符,构建了DTQW搜索算法步骤框图,在此基础上,应用SKW搜索算法对4节点无向图中的标记节点态进行搜索,通过态塌缩的观测,实现以1/4概率化读取出目标节点。研究结果表明,当有n个足够大的量子系统,并保持彼此之间的强纠缠性时,量子随机行走可以过渡到经典随机行走。文章还详细讨论了DTQW搜索算法实现左右同移的二次加速搜索机制。
