Vertices cannot be hidden from quantum spatial search for almost all random graphs

Vertices cannot be hidden from quantum spatial search for almost all random graphs In this paper, we show that all nodes can be found optimally for almost all random Erdős–Rényi $$\mathcal G(n,p)$$ G ( n , p ) graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices, though under different conditions. The first one requires $$p=\omega (\log ^8(n)/n)$$ p = ω ( log 8 ( n ) / n ) , while the second requires $$p\ge (1+\varepsilon )\log (n)/n$$ p ≥ ( 1 + ε ) log ( n ) / n , where $$\varepsilon >0$$ ε > 0 . The proof was made by analyzing the convergence of eigenvectors corresponding to outlying eigenvalues in the $$\Vert \cdot \Vert _\infty$$ ‖ · ‖ ∞ norm. At the same time for $$p<(1-\varepsilon )\log (n)/n$$ p < ( 1 - ε ) log ( n ) / n , the property does not hold for any matrix, due to the connectivity issues. Hence, our derivation concerning Laplacian matrix is tight. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Vertices cannot be hidden from quantum spatial search for almost all random graphs

, Volume 17 (4) – Feb 22, 2018
15 pages

/lp/springer_journal/vertices-cannot-be-hidden-from-quantum-spatial-search-for-almost-all-hGcUi0sExb
Publisher
Springer US
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-018-1844-7
Publisher site
See Article on Publisher Site

Abstract

In this paper, we show that all nodes can be found optimally for almost all random Erdős–Rényi $$\mathcal G(n,p)$$ G ( n , p ) graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices, though under different conditions. The first one requires $$p=\omega (\log ^8(n)/n)$$ p = ω ( log 8 ( n ) / n ) , while the second requires $$p\ge (1+\varepsilon )\log (n)/n$$ p ≥ ( 1 + ε ) log ( n ) / n , where $$\varepsilon >0$$ ε > 0 . The proof was made by analyzing the convergence of eigenvectors corresponding to outlying eigenvalues in the $$\Vert \cdot \Vert _\infty$$ ‖ · ‖ ∞ norm. At the same time for $$p<(1-\varepsilon )\log (n)/n$$ p < ( 1 - ε ) log ( n ) / n , the property does not hold for any matrix, due to the connectivity issues. Hence, our derivation concerning Laplacian matrix is tight.

Journal

Quantum Information ProcessingSpringer Journals

Published: Feb 22, 2018

DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month Explore the DeepDyve Library Unlimited reading Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere. Stay up to date Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates. Organize your research It’s easy to organize your research with our built-in tools. Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. Monthly Plan • Read unlimited articles • Personalized recommendations • No expiration • Print 20 pages per month • 20% off on PDF purchases • Organize your research • Get updates on your journals and topic searches$49/month

14-day Free Trial

Best Deal — 39% off

Annual Plan

• All the features of the Professional Plan, but for 39% off!
• Billed annually
• No expiration
• For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588$360/year

billed annually

14-day Free Trial