ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS

DOI10.1142/S0219749908004249zbMath1156.81361OpenAlexW2051635379WikidataQ62049450 ScholiaQ62049450MaRDI QIDQ3604124

Jiayan Wen, Dao Wen Qiu

Publication date: 24 February 2009

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219749908004249

zbMATH Keywords

quantum entanglementvon Neumann entropyGrover's algorithmadiabatic quantum computationadiabatic quantum search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Quantum computation (81P68)

Related Items (4)

Do multipartite correlations speed up adiabatic quantum computation or quantum annealing? ⋮ Global multipartite entanglement dynamics in Grover's search algorithm ⋮ ON THE ADIABATIC EVOLUTION OF ONE-DIMENSIONAL PROJECTOR HAMILTONIANS ⋮ ENTANGLEMENT PROPERTIES OF ADIABATIC QUANTUM ALGORITHMS

Cites Work

• Unnamed Item
• Quantum algorithm for Hilbert's tenth problem
• A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Energy and efficiency of adiabatic quantum search algorithms

This page was built for publication: ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS