论文信息 - Runtime of unstructured search with a faulty Hamiltonian oracle - 字舞流文

Runtime of unstructured search with a faulty Hamiltonian oracle

National Science Foundation (U.S.) (Physics Frontiers Center, Institute for Quantum Information and Matter)

[1] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[2] Liron Schiff,et al. Impossibility of a Quantum Speed-Up with a Faulty Oracle , 2008, ICALP.

[3] G. Lindblad. On the generators of quantum dynamical semigroups , 1976 .

[4] Gerhard J. Woeginger,et al. Automata, Languages and Programming , 2003, Lecture Notes in Computer Science.

[5] Jeroen van de Graaf,et al. Cryptographic Distinguishability Measures for Quantum-Mechanical States , 1997, IEEE Trans. Inf. Theory.

[6] Michael M. Wolf,et al. Fault-ignorant quantum search , 2013, 1307.0771.

[7] Alvin M. Despain,et al. Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer , 1998, QCQC.

[8] Yan Song Li,et al. Dominant gate imperfection in Grover’s quantum search algorithm , 2000 .

[9] Klaus Sutner,et al. On σ-Automata , 1988, Complex Syst..

[10] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[11] O. Biham,et al. Effect of unitary noise on Grover's quantum search algorithm , 2003 .

[12] Ronald de Wolf,et al. Robust Polynomials and Quantum Algorithms , 2003, Theory of Computing Systems.

[13] K. B. Whaley,et al. Effects of a random noisy oracle on search algorithm complexity , 2003, quant-ph/0304138.