Impact of the malicious input data modification on the efficiency of quantum spatial search

Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search

The Quantum Approximate Optimization Algorithm (QAOA) is a standard method for combinatorial optimization with a gate-based quantum computer. The QAOA consists of a particular ansatz for the quantum circuit architecture, together with a prescription for choosing the variational parameters of the circuit. We propose modifications to both. First, we define the Gibbs objective function and show that it is superior to the energy expectation value for use as an objective function in tuning the variational parameters. Second, we describe an Ansatz Architecture Search (AAS) algorithm for searching th…

A Non-Oracle Quantum Search Algorithm and Its Experimental Implementation

Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without Oracle. We analyze the general difficulties in quantum search algorithms and show how to solve them in the present algorithm. As well this algorithm could deal with both single-solution and multi-solution searches without modification. We also implement this algorithm on NMR quantum computer. It is the first experiment which perform a real quantum database sea…

Modified Grover's Search Algorithm in O(M+logN)Steps

The present letter proposes a modification in the well known Grover's search algorithm, which searches a database of $N$ unsorted items in $O(\sqrt{N/M})$ steps, where $M$ represents the number of solutions to the search problem. Concurrency control techniques and extra registers for marking and storing the solutions are used in the modified algorithm. This requires additional space but it is shown that the use of extra register and marking techniques can reduce the time complexity to $O(M+\log N)$.

Insecurity of detector-device-independent quantum key distribution

Detector-device-independent quantum key distribution (ddiQKD) held the promise of being robust to detector side-channels, a major security loophole in QKD implementations. In contrast to what has been claimed, however, we demonstrate that the security of ddiQKD is not based on post-selected entanglement, and we introduce various eavesdropping strategies that show that ddiQKD is in fact insecure against detector side-channel attacks as well as against other attacks that exploit device's imperfections of the receiver. Our attacks are valid even when the QKD apparatuses are built by the legitimat…

Critically damped quantum search

Although measurement and unitary processes can accomplish any quantum evolution in principle, thinking in terms of dissipation and damping can be powerful. We propose a modification of Grover's algorithm in which the idea of damping plays a natural role. Remarkably, we have found that there is a critical damping value that divides between the quantum $O(\sqrt{N})$ and classical O(N) search regimes. In addition, by allowing the damping to vary in a fashion we describe, one obtains a fixed-point quantum search algorithm in which ignorance of the number of targets increases the number of oracle q…

通过局部门修改进行参数量子电路的概率设计

Probabilistic Design of Parametrized Quantum Circuits through Local Gate Modifications

本文提出一种基于进化启发式的量子架构搜索算法，通过局部概率搜索优化参数量子电路架构，并在多个任务上验证其有效性。