Zobrazeno 1 - 10
of 98
pro vyhledávání: '"Wong, Thomas G."'
Autor:
Duda, Jonas, Wong, Thomas G.
Publikováno v:
Phys. Rev. A 110, 042417 (2024)
A quantum particle evolving by Schr\"odinger's equation in discrete space constitutes a continuous-time quantum walk on a graph of vertices and edges. When a vertex is marked by an oracle, the quantum walk effects a quantum search algorithm. Previous
Externí odkaz:
http://arxiv.org/abs/2408.08244
Publikováno v:
Phys. Rev. A 110, 052411 (2024)
The optimal runtime of a quantum computer searching a database is typically cited as the square root of the number of items in the database, which is famously achieved by Grover's algorithm. With parallel oracles, however, it is possible to search fa
Externí odkaz:
http://arxiv.org/abs/2408.05376
Autor:
Rapoza, Jacob, Wong, Thomas G.
Publikováno v:
Phys. Rev. A 104, 062211 (2021)
The lackadaisical quantum walk is a lazy version of a discrete-time, coined quantum walk, where each vertex has a weighted self-loop that permits the walker to stay put. They have been used to speed up spatial search on a variety of graphs, including
Externí odkaz:
http://arxiv.org/abs/2108.13856
Autor:
Adisa, Ibukunoluwa A., Wong, Thomas G.
Publikováno v:
Phys. Rev. A 104, 042604 (2021)
It is well-known that any quantum gate can be decomposed into the universal gate set {T, H, CNOT}, and recent results have shown that each of these gates can be implemented using a dynamic quantum walk, which is a continuous-time quantum walk on a se
Externí odkaz:
http://arxiv.org/abs/2108.01055
Autor:
Wong, Thomas G., Lockhart, Joshua
Publikováno v:
Phys. Rev. A 104, 042221 (2021)
The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems, however,
Externí odkaz:
http://arxiv.org/abs/2107.05580
Autor:
Herrman, Rebekah, Wong, Thomas G.
Publikováno v:
Quantum Inf. Process. 21, 54 (2022)
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that implements
Externí odkaz:
http://arxiv.org/abs/2106.06015
Autor:
Wong, Thomas G.
Publikováno v:
Quantum Inf. Comput. 22, 53 (2022)
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search problem,
Externí odkaz:
http://arxiv.org/abs/2011.14533
Autor:
Rhodes, Mason L., Wong, Thomas G.
Publikováno v:
Quantum Inf. Process. 19(9), 334 (2020)
The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph with a weighted self-loop at each vertex. It uses a generalized Grover coin and the flip-flop shift, which makes it equivalent to Szegedy's quantum Markov chain. It has
Externí odkaz:
http://arxiv.org/abs/2002.11227
Autor:
Wong, Thomas G.
Publikováno v:
Phys. Rev. A 100, 062325 (2019)
It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of quantum gates. This result treated all isolated vertices as having sel
Externí odkaz:
http://arxiv.org/abs/1908.00507
Autor:
Rhodes, Mason L., Wong, Thomas G.
Publikováno v:
Phys. Rev. A 100, 042303 (2019)
The lackadaisical quantum walk, which is a quantum walk with a weighted self-loop at each vertex, has been shown to speed up dispersion on the line and improve spatial search on the complete graph and periodic square lattice. In these investigations,
Externí odkaz:
http://arxiv.org/abs/1905.05887