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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Clear that \(\alpha _1 = (1-\alpha )/P\).
- 2.
Entry (3,3) at \(H^{(0)}\) is thus \(-\gamma N ((1-\alpha ) - (1-\alpha )/P) = -\gamma (N-m_0 - m_1)\).
- 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
Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48(2), 1687 (1993)
Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210–239 (2007)
Childs, A.M.: On the relationship between continuous-and discrete-time quantum walk. Commun. Math. Phys. 294(2), 581–603 (2010)
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)
Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70(2), 022314 (2004)
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)
Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the hamiltonian nand tree. arXiv preprint quant-ph/0702144 (2007)
Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58(2), 915 (1998)
Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 413–424 (2007)
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)
Novo, L., Chakraborty, S., Mohseni, M., Omar, Y.: Environment-assisted analog quantum search. arXiv preprint arXiv:1710.02111 (2017)
Yang, Y.-G., Zhao, Q.-Q.: Novel pseudo-random number generator based on quantum random walks. Sci. Rep. 6, 20362 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A Appendix A: Reduction Using Lanczos Algorithm
A Appendix A: Reduction Using Lanczos Algorithm
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
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
with \(\alpha _2 = (N-m_0-m_1)\). At iteration \(j=3\), we obtain \(\beta _3 = \sqrt{(N-m_0)(m_0-1)}\) with
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
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
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
DOI: https://doi.org/10.1007/978-3-030-02686-8_68
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02685-1
Online ISBN: 978-3-030-02686-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)