初态对光波导阵列中连续量子行走影响的研究

本文使用近邻耦合模型得到的解析解,分析了周期性波导中输入态对量子行走的粒子数的概率分布函数 和二阶相干性的影响.结果表明:输入态的对称性质对量子行走过程的二阶相干度有影响, 而对粒子数的概率分布函数影响不大. 关键词： 周期性光波导阵列 量子行走 二阶相干度 纠缠态     

Spontaneous parametric down-conversion and quantum walks in arrays of quadratic nonlinear waveguides

We analyze the process of photon-pair generation with simultaneous quantum walks in a quadratic nonlinear waveguide array. We demonstrate that the spontaneous parametric down-conversion in the array allows for creating quantum states with strongly pronounced spatial correlations, which are qualitatively different from those possible in bulk crystals or through quantum walks in linear waveguide arrays. Most importantly, the photon correlations can be controlled entirely classically by varying the spatial profile of the pump beam or the phase-matching conditions.     

Finding tree symmetries using continuous-time quantum walk

Quantum walk, the quantum counterpart of random walk, is an important model and widely studied to develop new quantum algorithms. This paper studies the relationship between the continuous-time quantum walk and the symmetry of a graph, especially that of a tree. Firstly, we prove in mathematics that the symmetry of a graph is highly related to quantum walk. Secondly, we propose an algorithm based on the continuous-time quantum walk to compute the symmetry of a tree. Our algorithm has better time complexity O(N3) than the current best algorithm. Finally, through testing three types of 10024 trees, we find that the symmetry of a tree can be found with an extremely high efficiency with the help of the continuous-time quantum walk.     

Estimation of photon counting statistics with imperfect detectors

The study on photon counting statistics is of fundamental importance in quantum optics. We theoretically analyzed the imperfect detection of an arbitrary quantum state. We derived photon counting formulae for six typical quantum states(i.e.,Fock, coherent, squeeze-vacuum, thermal, odd and even coherent states) with finite quantum efficiencies and dark counts based on multiple on/off detector arrays. We applied the formulae to the simulation of multiphoton number detections and obtained both the simulated and ideal photon number distributions of each state. A comparison between the results by using the fidelity and relative entropy was carried out to evaluate the detection scheme and help select detectors for different quantum states.     

Continuous-time quantum walks on star graphs

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K₂ graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.     

State transfer on two-fold Cayley trees via quantum walks

Perfect state transfer(PST)has great significance due to its applications in quantum information processing and quantum computation.The main problem we study in this paper is to determine whether the two-fold Cayley tree,an extension of the Cayley tree,admits perfect state transfer between two roots using quantum walks.We show that PST can be achieved by means of the so-called nonrepeating quantum walk[Phys.Rev.A 89042332(2014)]within time steps that are the distance between the two roots;while both the continuous-time quantum walk and the typical discrete-time quantum walk with Grover coin approaches fail.Our results suggest that in some cases the dynamics of a discrete-time quantum walk may be much richer than that of the continuous-time quantum walk.     

Quantum walk under coherence non-generating channels

We investigate the probability distribution of the quantum walk under coherence non-generating channels. We definea model called generalized classical walk with memory. Under certain conditions, generalized classical random walk withmemory can degrade into classical random walk and classical random walk with memory. Based on its various spreadingspeed, the model may be a useful tool for building algorithms. Furthermore, the model may be useful for measuring thequantumness of quantum walk. The probability distributions of quantum walks are generalized classical random walkswith memory under a class of coherence non-generating channels. Therefore, we can simulate classical random walkand classical random walk with memory by coherence non-generating channels. Also, we find that for another class ofcoherence non-generating channels, the probability distributions are influenced by the coherence in the initial state of thecoin. Nevertheless, the influence degrades as the number of steps increases. Our results could be helpful to explore therelationship between coherence and quantum walk.     

On the quantum CTRW approach

The concept of continuous-time random walk is generalized into the quantum approach using a completely positive map. This approach introduces in a phenomenological way the concept of disorder in the transport problem of a quantum open system. If the waiting-time of the continuous-time renewal approach is exponential we recover a semigroup for a dissipative quantum walk. Two models of non-Markovian evolution have been solved considering different types of waiting-time functions.     

On the Relationship Between Continuous- and Discrete-Time Quantum Walk

Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or discrete time. But whereas a continuous-time random walk can be obtained as the limit of a sequence of discrete-time random walks, the two types of quantum walk appear fundamentally different, owing to the need for extra degrees of freedom in the discrete-time case. In this article, I describe a precise correspondence between continuous- and discrete- time quantum walks on arbitrary graphs. Using this correspondence, I show that continuous-time quantum walk can be obtained as an appropriate limit of discrete-time quantum walks. The correspondence also leads to a new technique for simulating Hamiltonian dynamics, giving efficient simulations even in cases where the Hamiltonian is not sparse. The complexity of the simulation is linear in the total evolution time, an improvement over simulations based on high-order approximations of the Lie product formula. As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model. Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.     

Classical analogues to quantum nonlinear coherent states in photonic lattices

We show that light evolution occurring in waveguide arrays with a particular n-functional square root dependence of coupling coefficients can be used to produce classical analogues of nonlinear quantum coherent states. Using operator algebras we obtain closed-form expressions describing the optical field dynamics in such structures. In addition, by numerically monitoring the Mandel's parameter, we obtain the conditions necessary to generate sub-Poissonian and super-Poissonian classical intensity distributions in the proposed photonic lattices.     

Classical random walk with memory versus quantum walk on a one-dimensional infinite chain

Quantum walk is a very useful tool for building quantum algorithms due to the faster spreading of probability distributions as compared to a classical random walk. Comparing the spreading of the probability distributions of a quantum walk with that of a mnemonic classical random walk on a one-dimensional infinite chain, we find that the classical random walk could have a faster spreading than that of the quantum walk conditioned on a finite number of walking steps. Quantum walk surpasses classical random walk with memory in spreading speed when the number of steps is large enough. However, in such a situation, quantum walk would seriously suffer from decoherence. Therefore, classical walk with memory may have some advantages in practical applications.     

Approximate locality for quantum systems on graphs

In this Letter we make progress on a long-standing open problem of Aaronson and Ambainis [Theory Comput. 1, 47 (2005)]: we show that if U is a sparse unitary operator with a gap Delta in its spectrum, then there exists an approximate logarithm H of U which is also sparse. The sparsity pattern of H gets more dense as 1/Delta increases. This result can be interpreted as a way to convert between local continuous-time and local discrete-time quantum processes. As an example we show that the discrete-time coined quantum walk can be realized stroboscopically from an approximately local continuous-time quantum walk.     

Photon propagation in a discrete fiber network: an interplay of coherence and losses

We study light propagation in a photonic system that shows stepwise evolution in a discretized environment. It resembles a discrete-time version of photonic waveguide arrays or quantum walks. By introducing controlled photon losses to our experimental setup, we observe unexpected effects like subexponential energy decay and formation of complex fractal patterns. This demonstrates that the interplay of linear losses, discreteness and energy gradients leads to genuinely new coherent phenomena in classical and quantum optical experiments. Moreover, the influence of decoherence is investigated.     

Boundary conditions for the subdiffusion equation

The boundary conditions for the subdiffusion equations are formulated using the continuous-time random walk model, as well as several versions of the random walk model on an irregular lattice. It is shown that the boundary conditions for the same equation in different models have different forms, and this difference considerably affects the solutions of this equation.     

Survival probabilities in coherent exciton transfer with trapping

In the quest for signatures of coherent transport we consider exciton trapping in the continuous-time quantum walk framework. The survival probability displays different decay domains, related to distinct regions of the spectrum of the Hamiltonian. For linear systems and at intermediate times the decay obeys a power law, in contrast with the corresponding exponential decay found in incoherent continuous-time random walk situations. To differentiate between the coherent and incoherent mechanisms, we present an experimental protocol based on a frozen Rydberg gas structured by optical dipole traps.     

Thermal conductance in a quantum waveguide modulated with quantum dots

We investigate the thermal conductance in a quantum waveguide modulated with quantum dots at low temperatures. It is found that the thermal conductance sensitively depends on the geometrical parameters of the structure and boundary conditions. When the stress-free boundary conditions are applied in the structure, the universal quantum of thermal conductance can be found regardless of the geometry details in the limit T→0. For an uniform quantum waveguide, a thermal conductance plateau can be observed at very low temperatures; while for the quantum waveguide modulated with quantum dots, the plateau disappears, instead a decrease of the thermal conductance can be observed as the temperature goes up in the low temperature region, and its magnitude can be adjusted by the radius of the quantum dot. Moreover, it is found that the quantum waveguide with two coupling quantum dots exhibits oscillatory decaying thermal conductance behavior with the distance between two quantum dots. However, when the hard-wall boundary conditions are applied, the thermal conductance displays different behaviors.     

High winding number of topological phase in non-unitary periodic quantum walk

Topological phases and their associated multiple edge states are studied by constructing a one-dimensional non-unitary multi-period quantum walk with parity-time symmetry. It is shown that large topological numbers can be obtained when choosing an appropriate time frame. The maximum value of the winding number can reach the number of periods in the one-step evolution operator. The validity of the bulk–edge correspondence is confirmed, while for an odd-period quantum walk and an even-period quantum walk, they have different configurations of the 0-energy edge state and π-energy edge state. On the boundary, two kinds of edge states always coexist in equal amount for the odd-period quantum walk, however three cases including equal amount, unequal amount or even only one type may occur for the even-period quantum walk.     

"量身定做"单光子波包:在量子网络中控制光子/自旋量子界面

文章简要地介绍了如何在量子网络中控制量子界面动力学以实现静态量子比特和动态量子比特的相互转换．具体言之，该界面由半导体量子点、固体光学微腔以及光学波导管构成，静态及动态比特分别为量子点中的电子自旋和波导管中的单光子波包所携带．界面动力学的控制则是基于对量子点、微腔和波导管耦合系统的量子电动力学的严格求解．据此可实现网络中两个远距离节点间的量子态传输、交换以及确定性的建立量子纠缠等量子操作．上述量子界面亦可用于任意指定波形的单光子源或者单光子探测装置。     

Stopping time of a one-dimensional bounded quantum walk

The stopping time of a one-dimensional bounded classical random walk(RW) is defined as the number of steps taken by a random walker to arrive at a fixed boundary for the first time.A quantum walk(QW) is a non-trivial generalization of RW,and has attracted a great deal of interest from researchers working in quantum physics and quantum information.In this paper,we develop a method to calculate the stopping time for a one-dimensional QW.Using our method,we further compare the properties of stopping time for QW and RW.We find that the mean value of the stopping time is the same for both of these problems.However,for short times,the probability for a walker performing a QW to arrive at the boundary is larger than that for a RW.This means that,although the mean stopping time of a quantum and classical walker are the same,the quantum walker has a greater probability of arriving at the boundary earlier than the classical walker.