Conserved Quantities in Linear and Nonlinear Quantum Search
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909756387491840 |
|---|---|
| author | Meyer, David A. Wong, Thomas G. |
| author_facet | Meyer, David A. Wong, Thomas G. |
| contents | In this tutorial, which contains some original results, we bridge the fields of quantum computing algorithms, conservation laws, and many-body quantum systems by examining three algorithms for searching an unordered database of size $N$ using a continuous-time quantum walk, which is the quantum analogue of a continuous-time random walk. The first algorithm uses a linear quantum walk, and we apply elementary calculus to show that the success probability of the algorithm reaches 1 when the jumping rate of the walk takes some critical value. We show that the expected value of its Hamiltonian $H_0$ is conserved. The second algorithm uses a nonlinear quantum walk with effective Hamiltonian $H(t) = H_0 + λ|ψ|^2$, which arises in the Gross-Pitaevskii equation describing Bose-Einstein condensates. When the interactions between the bosons are repulsive, $λ> 0$, and there exists a range of fixed jumping rates such that the success probability reaches 1 with the same asymptotic runtime of the linear algorithm, but with a larger multiplicative constant. Rather than the effective Hamiltonian, we show that the expected value of $H_0 + \frac{1}{2} λ|ψ|^2$ is conserved. The third algorithm utilizes attractive interactions, corresponding to $λ< 0$. In this case there is a time-varying critical function for the jumping rate $γ_c(t)$ that causes the success probability to reach 1 more quickly than in the other two algorithms, and we show that the expected value of $H(t)/[γ_c(t) N]$ is conserved. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_06423 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Conserved Quantities in Linear and Nonlinear Quantum Search Meyer, David A. Wong, Thomas G. Quantum Physics In this tutorial, which contains some original results, we bridge the fields of quantum computing algorithms, conservation laws, and many-body quantum systems by examining three algorithms for searching an unordered database of size $N$ using a continuous-time quantum walk, which is the quantum analogue of a continuous-time random walk. The first algorithm uses a linear quantum walk, and we apply elementary calculus to show that the success probability of the algorithm reaches 1 when the jumping rate of the walk takes some critical value. We show that the expected value of its Hamiltonian $H_0$ is conserved. The second algorithm uses a nonlinear quantum walk with effective Hamiltonian $H(t) = H_0 + λ|ψ|^2$, which arises in the Gross-Pitaevskii equation describing Bose-Einstein condensates. When the interactions between the bosons are repulsive, $λ> 0$, and there exists a range of fixed jumping rates such that the success probability reaches 1 with the same asymptotic runtime of the linear algorithm, but with a larger multiplicative constant. Rather than the effective Hamiltonian, we show that the expected value of $H_0 + \frac{1}{2} λ|ψ|^2$ is conserved. The third algorithm utilizes attractive interactions, corresponding to $λ< 0$. In this case there is a time-varying critical function for the jumping rate $γ_c(t)$ that causes the success probability to reach 1 more quickly than in the other two algorithms, and we show that the expected value of $H(t)/[γ_c(t) N]$ is conserved. |
| title | Conserved Quantities in Linear and Nonlinear Quantum Search |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.06423 |