Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Multidisciplinary Scientific GeoConference SGEM ...

COMPLEXITY ESTIMATION OF QUANTUM ALGORITHMS USING ENTANGLEMENT PROPERTIES

Victor Potapov

Published Jun 28, 2016• 11 citations
Publisher
DOI
10.5593/sgem2016/b21/s07.018

Related papers

ENTANGLEMENT-ASSISTED ESTIMATION OF QUANTUM CHANNELS

Akio Fujiwara

Foundations of Quantum Mechanics in the Light of New Technology•Jun 1, 2006•0 citations

A COMBINED QUANTUM ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY

Satoshi Iriyama

Infinite Dimensional Analysis Quantum Probability and Related Topics•Nov 1, 2023•0 citations

Computational Complexity Measures of Multipartite Quantum Entanglement

Tomoyuki Yamakami

arXiv:quant-ph/0308072•Lecture notes in computer science•Jan 1, 2003•0 citations

ENTANGLEMENT PROPERTIES OF ADIABATIC QUANTUM ALGORITHMS

Wen Jiayan, Yi Huang, Daowen Qiu

In this paper, by constructing a more entangled quantum system, we shorten the adiabatic quantum search algorithm to constant time. On the other hand, we show that the speed-up of adiabatic quantum algorithms by selecting particular adiabatic evolution paths or injecting energy into the quantum system can be explained as a form of entanglement enlargement. These findings suggest that entanglement plays a fundamental role for the efficiency of algorithm performance.

International Journal of Quantum Information•Dec 1, 2009•5 citations

Quantum entanglement and quantum computational algorithms

Arvind

arXiv:quant-ph/0012116•Pramana•Feb 1, 2001•19 citations

Quantum Algorithms and Complexity: An Information Theory Perspective

Umesh V. Vazirani

•Oct 2, 2002•0 citations