Fixed-point quantum search

The quantum search algorithm consists of an iterative sequence of selective inversions and diffusion type operations, as a result of which it is able to find a state with desired properties (target state) in an unsorted database of size N in only sqrt[N] queries. This is achieved by designing the iterative transformations in a way that each iteration results in a small rotation of the state vector in a two-dimensional Hilbert space that includes the target state; if we choose the right number of iterative steps, we will stop just at the target state. This Letter shows that by replacing the selective inversions by selective phase shifts of pi/3, the algorithm preferentially converges to the target state irrespective of the step size or number of iterations. This feature leads to robust search algorithms and also to new schemes for quantum control and error correction.     

Fixed-point quantum search for different phase shifts

Grover recently presented the fixed-point search algorithm. In this Letter, we study the fixed-point search algorithm obtained by replacing equal phase shifts of π/3$\pi /3$ by different phase shifts.     

Quantum Pattern Search with Closed Match

This paper we proposed a quantum pattern search algorithm based on Grover’s algorithm with closed match. Compared to QuAM proposed by Dan Ventura and QuAM with distributed queries proposed by Ezhov, our algorithm could not only resolve completion problem but also retrieved the full information of the query pattern which only known partial information with non-negligible probability. The algorithm took advantage of the encoding for the pattern set. Moreover we transformed the encoding of each pattern in set to encode all the pattern match cases in order to reduce the cost of encoding. Thus, the nontrivial initial state brought a new method to realize quantum pattern search with a series of proper unitary operations. The simulation result of experiments was also proved that our algorithm was useful and efficient.     

Quantum state transformations and the Schubert calculus

Recent developments in mathematics have provided powerful tools for comparing the eigenvalues of matrices related to each other via a moment map. In this paper, we survey some of the more concrete aspects of the approach with a particular focus on applications to quantum information theory. After discussing the connection between Horn’s Problem and Nielsen’s Theorem, we move on to characterizing the eigenvalues of the partial trace of a matrix.     

Comment on: “Construction of bound entangled edge states with special ranks” [Phys. Lett. A 359 (2006) 603]

Recently, Clarisse [L. Clarisse, Phys. Lett. A 359 (2006) 603] and Ha [K.-C. Ha, Phys. Lett. A 361 (2007) 515] found examples of types (5,5) and (6,6) entangled states with positive partial transposes. In this Letter, we show that their examples have the Schmidt number as 2.     

Quantum cryptography using partially entangled states

We show that non-maximally entangled states can be used to build a quantum key distribution (QKD) scheme where the key is probabilistically teleported from Alice to Bob. This probabilistic aspect of the protocol ensures the security of the key without the need of non-orthogonal states to encode it, in contrast to other QKD schemes. Also, the security and key transmission rate of the present protocol is nearly equivalent to those of standard QKD schemes and these aspects can be controlled by properly harnessing the new free parameter in the present proposal, namely, the degree of partial entanglement. Furthermore, we discuss how to build a controlled QKD scheme, also based on partially entangled states, where a third party can decide whether or not Alice and Bob are allowed to share a key.     

Quantum teleportation for continuous variables and related quantum information processing

Quantum teleportation is one of the most important subjects in quantum information science. This is because quantum teleportation can be regarded as not only quantum information transfer but also a building block for universal quantum information processing. Furthermore, deterministic quantum information processing is very important for efficient processing and it can be realized with continuous-variable quantum information processing. In this review, quantum teleportation for continuous variables and related quantum information processing are reviewed from these points of view.     

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}} $.     

Dissipative decoherence in the Grover algorithm

Using the methods of quantum trajectories we study effects of dissipative decoherence on the accuracy of the Grover quantum search algorithm. The dependence on the number of qubits and dissipation rate are determined and tested numerically with up to 16 qubits. As a result, our numerical and analytical studies give the universal law for decay of fidelity and probability of searched state which are induced by dissipative decoherence effects. This law is in agreement with the results obtained previously for quantum chaos algorithms.     

Teleportation of the three-level three-particle entangled state and classical communication cost

We propose a scheme to probabilistically teleport an unknown three-level three-particle entangled state. The quantum channel is composed of a partial entangled three-level two-particle state and a partial entangled three-level three-particle state. We calculate the successful total probability and the classical communication cost required in the ideal probabilistic teleportation process, respectively. It is shown that an unknown three-level three-particle entangled state can be teleported using fewer entangled particles and lesser classical communication cost than Bennett et al.’s original protocol.     

Scalable Quantum Secret Sharing Extended from Quantum Key Distribution

We suggest a general approach for extending quantum key distribution （Q, KD） protocols possessing discrete rotational symmetry into quantum secret sharing （QSS） schemes among multiparty, under certain conditions. Only local unitary operations are required for this generalization based on the almost mature technologies of Q, KD. Theoretically, the number of the participating partners can be arbitrary high. As an application of this method, we propose a fault-tolerant QSS protocol based on a fault-tolerant QKD implementation. The 6-state protocol is also discussed.     

First experimental demonstration of an exact quantum search algorithm in nuclear magnetic resonance system

The success probability of searching an objective item from an unsorted database using standard Grover's algorithm is usually not exactly 1. It is exactly 1 only when it is used to find the target state from a database with four items. Exact search is always important in theoretical and practical applications. The failure rate of Grover's algorithm becomes big when the database is small, and this hinders the use of the commonly used divide-and-verify strategy. Even for large database, the failure rate becomes considerably large when there are many marked items. This has put a serious limitation on the usability of the Grover's algorithm. An important improved version of the Grover's algorithm, also known as the improved Grover algorithm, solves this problem. The improved Grover algorithm searches arbitrary number of target states from an unsorted database with full success rate. Here, we give the first experimental realization of the improved Grover algorithm, which finds a marked state with certainty, in a nuclear magnetic resonance system. The optimal control theory is used to obtain an optimized control sequence. The experimental results agree well with the theoretical predictions.     

Performance of equal phase-shift search for one iteration

Grover presented the phase-shift search by replacing the selective inversions by selective phase shifts of π/3. In this paper, we investigate the phase-shift search with general equal phase shifts. We show that for small uncertainties, the failure probability of the phase-π/3 search is smaller than the general phase-shift search and for large uncertainties, the success probability of the large phase-shift search is larger than the phase-π/3 search. Therefore, the large phase-shift search is suitable for large-size of databases.     

Entanglement swapping,light cones and elements of reality

Recently, a number of two-participant all-versus-nothing Bell experiments have been proposed. Here, we give local realistic explanations for these experiments. More precisely, we examine the scenario where a participant swaps his entanglement with two other participants and then is removed from the experiment; we also examine the scenario where two particles are in the same light cone, i.e. belong to a single participant. Our conclusion is that, in both cases, the proposed experiments are not convincing proofs against local realism.     

Partial teleportation of entangled atomic states

In this Letter we propose a scheme for partially teleporting entangled atomic states. Our scheme can be implemented using only four two-level atoms interacting either resonantly or off-resonantly with a single cavity-QED. The estimative of losses occurring during this partial teleportation process is accomplished through the phenomenological operator approach technique.     

Partial Hermitian Conjugate Separability Criteria for Pure Quantum States

We propose a criterion for the separability of quantum pure states using the concept of a partial Hermitian conjugate. It is equivalent to the usual positive partial transposition criteria, with a simple physical interpretation.     

Quantification of continuous variable entanglement with only two types of simple measurements

Here we propose an experimental set-up in which it is possible to obtain the entanglement of a two-mode Gaussian state, be it pure or mixed, using only simple linear optical measurement devices. After a proper unitary manipulation of the two-mode Gaussian state only number and purity measurements of just one of the modes suffice to give us a complete and exact knowledge of the state’s entanglement.     

Liquid Nuclear Magnetic Resonance Implementation of Quantum Computation in Subspace

Based on the logical labelling method, we prepare an effective pure state in a subsystem of a three spin system via liquid nuclear magnetic resonance technique. Then with this subspace effective pure state we implement the Deutsch-Jozsa algorithm. The tomography for the subspace effective pure state and the corresponding spectrum of the output for the Deutsch-Jozsa algorithm agree with theoretical predictions, which shows that we have successfully implemented the Deutsch-Jozsa algorithm in a subsystem of a nuclear spin system and demonstrated a subspace quantum computation.     

Efficient Three-Party Quantum Secret Sharing with Single Photons

A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.     

Partial evolution based local adiabatic quantum search

Recently, Zhang and Lu provided a quantum search algorithm based on partial adiabatic evolution, which beats the time bound of local adiabatic search when the number of marked items in the unsorted database is larger than one. Later, they found that the above two adiabatic search algorithms had the same time complexity when there is only one marked item in the database. In the present paper, following the idea of Roland and Cerf [Roland J and Cerf N J 2002 Phys. Rev. A 65 042308], if within the small symmetric evolution interval defined by Zhang et al., a local adiabatic evolution is performed instead of the original “global” one, this “new” algorithm exhibits slightly better performance, although they are progressively equivalent with M increasing. In addition, the proof of the optimality for this partial evolution based local adiabatic search when M=1 is also presented. Two other special cases of the adiabatic algorithm obtained by appropriately tuning the evolution interval of partial adiabatic evolution based quantum search, which are found to have the same phenomenon above, are also discussed.