Entanglement properties of adiabatic quantum algorithms
From MaRDI portal
Publication:3405965
DOI10.1142/S0219749909006000zbMATH Open1184.81038OpenAlexW2064595913WikidataQ62049434 ScholiaQ62049434MaRDI QIDQ3405965FDOQ3405965
Authors: Jiayan Wen, Yi Huang, Daowen Qiu 
Publication date: 12 February 2010
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219749909006000
Recommendations
- ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
- Groverian entanglement measure and evolution of entanglement in search algorithm for \(n (=3, 5)\)-qubit systems with real coefficients
- Entanglement in phase estimation algorithm and quantum counting algorithm
- scientific article
- Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
Cites Work
- Title not available (Why is that?)
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
- Energy and efficiency of adiabatic quantum search algorithms
- A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
Cited In (8)
- Title not available (Why is that?)
- On the optimal schedule of adiabatic quantum computing
- ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
- On the role of prior probability in adiabatic quantum algorithms
- Title not available (Why is that?)
- Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
- Effects of dissipation on an adiabatic quantum search algorithm
- On the adiabatic evolution of one-dimensional projector Hamiltonians
This page was built for publication: Entanglement properties of adiabatic quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405965)
