Quantum walk search algorithm for multi-objective searching with iteration auto-controlling on hypercube

Shenvi et al. have proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley (SKW) algorithm, but this search algorithm can only search one target state and use a specific search target state vector. Therefore, when there are more than two target nodes in the search space, the algorithm has certain limitations. Even though a multi-objective SKW search algorithm was proposed later, when the number of target nodes is more than two, the SKW search algorithm cannot be mapped to the same quotient graph. In addition, the calculation of the optimal target state depends on the number of target states m. In previous studies, quantum computing and testing algorithms were used to solve this problem. But these solutions require more Oracle calls and cannot get a high accuracy rate. Therefore, to solve the above problems, we improve the multi-target quantum walk search algorithm, and construct a controllable quantum walk search algorithm under the condition of unknown number of target states. By dividing the Hilbert space into multiple subspaces, the accuracy of the search algorithm is improved from p_c=(1/2)-O(1/n) to p_c=1-O(1/n). And by adding detection gate phase, the algorithm can stop when the amplitude of the target state becomes the maximum for the first time, and the algorithm can always maintain the optimal number of iterations, so as to reduce the number of unnecessary iterations in the algorithm process and make the number of iterations reach $ t_{\rm f}=(\pi /2)\sqrt{2^{n-2}} $.     

A Note on Normal Forms of Quantum States and Separability

We study the normal form of multipartite density matrices. It is shown that the correlation matrix （CM） separability criterion can be improved from the normal form we obtained under filtering transformations. Based on CM criterion the entanglement witness is further constructed in terms of local orthogonal observables for both bipartite and multipartite systems.     

Entanglement and Pancharatnam Phase for Two Two-Level Atoms Interacting with a Single Mode Field

A model of two 2-level atoms interacts with a single quantized electromagnetic field is considered. We study the effect of the mean photon number and the structure of the initial states of the two atoms on the dynamics of the atomic system from the separability point of view. It is found that, if we start from a product mixed atomic state, the probability of generating long living entangled states is increased as the mean photon number increases. Starting from excited atomic system in product state, one generates a more stable entangled states with high degree of entanglement. Also, the effect of the mean photon number on atomic system prepared initially in entangled states is investigated. It is found that the entangled state generated from the initially partial entangled states are more robust than those obtained from a maximum entangled state. The Pancharatnam phase for the separable and entangled states is studied under the effect of the mean photon number and the structure of the initial state. We find that for the separable states, the collapses decrease and the amplitude of the revivals is smaller than that for the entangled state, so there are long-living entangled phases. This property give us a great chances to store safely information in entangled state.     

Design of quantum VQ iteration and quantum VQ encoding algorithm taking O（√N） steps for data compression

Vector quantization (VQ) is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take $O(N)$ steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes $O(\sqrt N )$ steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor's factorization algorithm and Grover's algorithm. Entanglement state is generated and used, by contrast the state in Grover's algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.     

Arbitrary Phase Rotation of the Marked State Cannot Be Used for Grover's Quantum Search Algorithm

A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation can be used to construct a (less efficient) quantum search algorithm is cleared. The π rotation of the phase of the marked state is not only the choice for efficiency, but also vital in Grover's quantum search algorithm. The results also show that Grover's quantum search algorithm is robust.     

Separable states are more disordered globally than locally

A remarkable feature of quantum entanglement is that an entangled state of two parties, Alice ( A) and Bob ( B), may be more disordered locally than globally. That is, S(A)>S(A,B), where S(*) is the von Neumann entropy. It is known that satisfaction of this inequality implies that a state is nonseparable. In this paper we prove the stronger result that for separable states the vector of eigenvalues of the density matrix of system AB is majorized by the vector of eigenvalues of the density matrix of system A alone. This gives a strong sense in which a separable state is more disordered globally than locally and a new necessary condition for separability of bipartite states in arbitrary dimensions.     

量子相关词汇搜索

本文讨论了基于量子并行计算和叠加态原理的量子搜索算法,并结合概率论,给出了从无结构的海量数据(库)中搜索相关词汇(组)的方法,并说明该方法远远优越于经典搜索算法。     

Thermodynamics of non-differentiable systems

An axiomatisation of classical thermodynamics previously proposed for a somewhat restricted class of systems whose state spaces are differentiable manifolds is extended to systems whose state spaces are arbitrary connected separable topological spaces. It turns out that such systems need not obey Carathéodory's principle, although they do obey a form of Kelvin's principle.     

A study of break-up processes in neutron-deuteron scattering

Neutron-deuteron break-up reactions for kinematically complete and incomplete situations are examined for various types of local two-nucleon S-wave potentials and for the separable Yamaguchi potential. In particular, a systematic search has been made in the entire phase space of three free nucleons for large differences between the results of the various interactions. Certain parts outside the final state peaks and the quasifree scattering regions are found which are significantly sensitive to the two-nucleon interactions studied.     

Scheme for Implementing Quantum Search Algorithm in a Cluster State Quantum Computer

Using cluster state and single qubit measurement one can perform the one-way quantum computation. Here we give a detailed scheme for realizing a modified Grover search algorithm using measurements on cluster state. We give the measurement pattern for the cluster-state realization of the algorithm and estimated the number of measurement needed for its implementation. It is found that O（2^3n/^2n^2） number of single qubit measurements is required for its realization in a cluster-state quantum computer.     

Synthesis of quantum superpositions by quantum computation

The quantum search algorithm can be looked at as a technique for synthesizing a particular kind of superposition-one whose amplitude is concentrated in a single basis state. This basis state is defined by a binary function f(&xmacr;) that is nonzero in this desired basis state and zero everywhere else. This paper extends the quantum search algorithm to an algorithm that can create an arbitrarily specified superposition on a space of size N in O(sqrt[N] ) steps. The superposition is specified by a complex valued function f(&xmacr;) that specifies the desired amplitude of the system in basis state &xmacr;.     

The quadratic speedup in Grover's search algorithm from the entanglement perspective

We show that Grover's algorithm can be described as an iterative change of the bipartite entanglement, which leads to a necessary and sufficient condition for quadratic speedup. This allows us to reestablish, from the entanglement perspective, that Grover's search algorithm is the only optimal pure state search algorithm.     

An N/4 fixed-point duality quantum search algorithm

Here a fixed-point duality quantum search algorithm is proposed.This algorithm uses iteratively non-unitary operations and measurements to search an unsorted database.Once the marked item is found,the algorithm stops automatically.This algorithm uses a constant non-unitary operator,and requires N/4 steps on average(N is the number of data from the database) to locate the marked state.The implementation of this algorithm in a usual quantum computer is also demonstrated.     

Calculations on the three-nucleon system using a separable expansion of local potentials

A separable expansion for local potentials called the unitary pole expansion (UPE) has been applied to the singlet-S soft-core Reid potential. The separable potentials obtained are used in conjunction with a separable tensor potential to calculate the triton binding energy, the nd doublet scattering length and the nd phase shifts in the state above and below break up. The convergence of the UPE is good especially for repulsive terms. The one term approximation (UPA) gives a triton energy differing by 0.04 MeV and a doublet scattering length differing by 0.14 fm from the values found for the local potential. The calculated phase shifts are in good agreement with the phase-shift analysis of Van Oers and Seagrave.     

Exploring Tripartite Quantum Correlations: Entanglement Witness and Quantum Discord

In this study, we explore the tripartite quantum correlations by employing the quantum relative entropy as a distance measure. First, we evaluate the explicit expression for nonlinear entanglement witness (EW) of tripartite systems in the four dimensional space that lends itself to a straightforward algorithm for finding closest separable state (CSS) to the generic state. Then using nonlinear EW with specific feasible regions (FRs), quantum discord is derived analytically for the three-qubit and tripartite systems in the four dimensional space. Furthermore, we explicitly figure out the additivity relation of quantum correlations in tripartite systems.     

Correlation and Information in Quantum Channels

Quantum and classical correlations in quantum channels are investigated by means of an entangled pure state and a separable state which is closest to an entangled pure state. The coherent information and the separable information are used to estimate how much correlation is transmitted through a quantum channel. As the examples, the linear dissipative channel of qubits and the quantum erasure channel are considered.     

Relative Entropy of Entanglement of a Kind of Two-Qubit Entangled States

We strictly prove that some block diagonalizable two-qubit entangled state with six non-zero elements reaches its quantum relative entropy entanglement by a separable state having the same matrix structure. The entangled state comprises local filtering result state as a special case.     

Two-particle resonance poles and the energy spectra of three- and four-particle systems

The position of the two-particle resonance poles is shown to be the dominant factor in a number of interesting phenomena appearing in the energy spectra of bound three- and four-particle systems with separable two-particle interactions. The validity of the bound-state pole dominance assumption in few-particle systems is shown to depend on the location of the two-particle resonance poles. These results generalize the ground state collapse obtained earlier for the Tabakin rank-one separable interactions in the triton. However, our results also indicate that the collapse does not necessarily occur for more general nonlocal interactions.     

Classifying N-qubit entanglement via Bell's inequalities

All the states of N qubits can be classified into N-1 entanglement classes from 2-entangled to N-entangled (fully entangled) states. Each class of entangled states is characterized by an entanglement index that depends on the partition of N. The larger the entanglement index of a state, the more entangled or the less separable is the state in the sense that a larger maximal violation of Bell's inequality is attainable for this class of state.     

基于散射量子行走的完全图上结构异常搜索算法

完全图K_N 上某个顶点连接到图G将破坏其对称性. 为加速定位这类结构异常, 基于散射量子行走模型设计搜索算法, 首先给出了算法酉算子的定义, 在此基础上利用完全图的对称性, 将算法的搜索空间限定为一个低维的坍缩图空间. 以G为一个顶点的情况为例, 利用硬币量子行走模型上的研究结论简化了坍缩图空间中酉算子的计算, 并借助矩阵扰动理论分析算法演化过程. 针对星图S_N 上结构异常的研究表明, 以星图中心节点为界将整个图分为左右两个部分, 当且仅当两部分在N→∞时具有相同的特征值, 搜索算法可以获得量子加速. 本文说明星图上的分析方法和结论可以推广至完全图的坍缩图上. 基于此, 本文证明无论完全图连接的图G结构如何, 搜索算法均可在O(√N) 时间内定位到目标顶点, 成功概率为1-O(1√N), 即量子行走搜索该类异常与经典搜索相比有二次加速.