In order to solve the ordered quantum database search problem,a quantum binary searching algorithm was proposed which can be used to implement the whole searching process in four steps. Considering the characteristic of quantum parallelism,this paper further improves the searching process,which can be realized in only two steps,and presents the circuit implementation. In this scheme,the number of the quantum logic gates doesn't increase. Moreover,the losing-solution issue in the quantum binary searching algorithm can be efficiently prevented.
In this paper a method is given to calculate the explicit expressions of embedding genus distribution for ladder type graphs and cross type graphs. As an example, we refind the genus distri- bution of the graph Jn which is the first class of graphs studied for genus distribution where its genus depends on n.
Feshbach resonance is a resonance for two-atom scattering with two or more channels,in which a bound state is achieved in one channel.We show that this resonance phenomenon not only exists during the collisions of massive particles,but also emerges during the coherent transport of massless particles,that is,photons confined in the coupled resonator arrays linked by a separated cavity or a tunable two level system(TLS).When the TLS is coupled to one array to form a bound state in this setup,the vanishing transmission appears to display the photonic Feshbach resonance.This process can be realized through various experimentally feasible solid state systems,such as the couple defected cavities in photonic crystals and the superconducting qubit coupled to the transmission line.The numerical simulation based on the finite-different time-domain(FDTD) method confirms our assumption about the physical implementation.
