Skip to main content

Optimal Dimensionality Reduced Quantum Walk and Noise Characterization

  • Conference paper
  • First Online:
Proceedings of the Future Technologies Conference (FTC) 2018 (FTC 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 880))

Included in the following conference series:

Abstract

In a recent work by Novo et al. (Sci. Rep. \(\mathbf 5\), 13304, 2015), the invariant subspace method was applied to the study of continuous-time quantum walk (CTQW). In this work, we adopt the aforementioned method to investigate the optimality of a perturbed quantum walk search of a marked element in a noisy environment on various graphs. We formulate the necessary condition of the noise distribution in the system such that the invariant subspace method remains effective and efficient. Based on the noise, we further formulate how to set the appropriate coupling factor to preserve the optimality of the quantum walker. Thus, a quantum walker based on an N by N Hamiltonian can be efficiently implemented using the near-term quantum technology.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Clear that \(\alpha _1 = (1-\alpha )/P\).

  2. 2.

    Entry (3,3) at \(H^{(0)}\) is thus \(-\gamma N ((1-\alpha ) - (1-\alpha )/P) = -\gamma (N-m_0 - m_1)\).

  3. 3.

    Simply compute their inner product and we know that \(| s \rangle = \frac{| \omega \rangle + \sqrt{m_0 -1}| S_{V_0 - \omega } \rangle + \sqrt{N-m_0}| S_{\bar{V}_0} \rangle }{\sqrt{N}}\).

References

  1. Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48(2), 1687 (1993)

    Article  Google Scholar 

  2. Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210–239 (2007)

    Article  MathSciNet  Google Scholar 

  3. Childs, A.M.: On the relationship between continuous-and discrete-time quantum walk. Commun. Math. Phys. 294(2), 581–603 (2010)

    Article  MathSciNet  Google Scholar 

  4. Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, pp. 59–68. ACM (2003)

    Google Scholar 

  5. Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70(2), 022314 (2004)

    Google Scholar 

  6. Childs, A.M., Schulman, L.J., Vazirani, U.V.: Quantum algorithms for hidden nonlinear structures. In: 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 395–404. IEEE (2007)

    Google Scholar 

  7. Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the hamiltonian nand tree. arXiv preprint quant-ph/0702144 (2007)

    Google Scholar 

  8. Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58(2), 915 (1998)

    Article  MathSciNet  Google Scholar 

  9. Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 413–424 (2007)

    Article  MathSciNet  Google Scholar 

  10. Novo, L., Chakraborty, S., Mohseni, M., Neven, H., Omar, Y.: Systematic dimensionality reduction for quantum walks: optimal spatial search and transport on non-regular graphs. Sci. Rep. 5 (2015)

    Google Scholar 

  11. Novo, L., Chakraborty, S., Mohseni, M., Omar, Y.: Environment-assisted analog quantum search. arXiv preprint arXiv:1710.02111 (2017)

  12. Yang, Y.-G., Zhao, Q.-Q.: Novel pseudo-random number generator based on quantum random walks. Sci. Rep. 6, 20362 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chen-Fu Chiang .

Editor information

Editors and Affiliations

A Appendix A: Reduction Using Lanczos Algorithm

A Appendix A: Reduction Using Lanczos Algorithm

figure b

If an \(N \times N\) matrix is reduced to a \(3 \times 3\) matrix by Lanczos algorithm, the reduced matrix in the \(\{v_1, v_2, v_3\}\) basis is

$$\begin{aligned} \begin{bmatrix} \alpha _1&\beta _2&0 \\ \beta _2&\alpha _2&\beta _3 \\ 0&\beta _3&\alpha _3\\ \end{bmatrix} \end{aligned}$$
(44)

By using the Lanczos algorithm on a UCPG configuration given in Sect. 2, we start with \(v_1 =| \omega \rangle \) and \(A = H_a\). Immediately we know that \(\alpha _1 = 0\) and that leads to \(\beta _2 = \sqrt{N-m_0}\). At iteration \(j=2\), we can obtain

$$\begin{aligned} v_2= & {} \frac{1}{\sqrt{N-m_0}}\sum _{i\in V, i\notin V_0}| i \rangle \end{aligned}$$
(45)
$$\begin{aligned} w'_2= & {} \frac{1}{\sqrt{N-m_0}}((N-m_0)| \omega \rangle + (N-m_0)\sum _{i\in V_0, i\ne \omega }| i \rangle \nonumber \\&+ (N-m_0-m_1)\sum _{i\in V, i\notin V_0} | i \rangle )\end{aligned}$$
(46)
$$\begin{aligned} w_2= & {} \frac{1}{\sqrt{N-m_0}}(N-m_0)\sum _{i\in V_0, i\ne \omega }| i \rangle \end{aligned}$$
(47)

with \(\alpha _2 = (N-m_0-m_1)\). At iteration \(j=3\), we obtain \(\beta _3 = \sqrt{(N-m_0)(m_0-1)}\) with

$$\begin{aligned} v_3= & {} \frac{1}{\sqrt{m_0-1}}\sum _{i\in V_0, i \ne \omega }| i \rangle \end{aligned}$$
(48)
$$\begin{aligned} w'_3= & {} {\sqrt{m_0-1}}\sum _{i\in V, i\notin V_0} | i \rangle \end{aligned}$$
(49)

and then we have \(\alpha _3 =0, w_3=0\). Readers should be reminded that in 5 the matrix is written in the \(\{v_1, v_3, v_2\}\) basis, instead of the \(\{v_1, v_2, v_3\}\) basis.

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chiang, CF. (2019). Optimal Dimensionality Reduced Quantum Walk and Noise Characterization. In: Arai, K., Bhatia, R., Kapoor, S. (eds) Proceedings of the Future Technologies Conference (FTC) 2018. FTC 2018. Advances in Intelligent Systems and Computing, vol 880. Springer, Cham. https://doi.org/10.1007/978-3-030-02686-8_68

Download citation

Publish with us

Policies and ethics