2 citations · 6 across the 9 of their papers we have counts for
9 papers
Optimal and Deterministic Quantum Search on the Simplex of Complete Graphs
Kiyoji Huang Fujiwara, Yujia Shi, Thomas G. Wong
The simplex of complete graphs, also known as the first-order truncated simplex lattice, is a network of identical complete graphs, each with vertices, such that each cli…
Spatial Search by Nonlinear Quantum Walk
David A. Meyer, Thomas G. Wong
Many-body quantum systems with effective nonlinearities have been shown to speed up quantum search on the complete graph, \textit{i.e.}, the combinatorial version of Grover's algor…
Self-Trapping Bounds for Continuous-Time Nonlinear Quantum Walks on Path and Cycle Graphs
Yujia Shi, Thomas G. Wong
We explore a continuous-time quantum walk starting at a single vertex on the discrete path and cycle with a cubic nonlinearity. Such nonlinearities arise in Bose-Einstein condensat…
Quantum Search with a Generalized Laplacian
Jonas Duda, Molly E. McLaughlin, Thomas G. Wong
A single excitation in a quantum spin network described by the Heisenberg model can effect a variety of continuous-time quantum walks on unweighted graphs, including those governed…
Quantum Search with the Signless Laplacian
Molly E. McLaughlin, Thomas G. Wong
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, whi…
Conserved Quantities in Linear and Nonlinear Quantum Search
David A. Meyer, Thomas G. Wong
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 al…
Improving Student Self-Confidence in Quantum Computing with the Qubit Touchdown Board Game
Kristina Armbruster, Gintaras Duda, Thomas G. Wong
Qubit Touchdown is a two-player, competitive board game that was developed to introduce students to quantum computing. A quantum computer is a new kind of computer that is based on…
Searching Weighted Barbell Graphs with Laplacian and Adjacency Quantum Walks
Jonas Duda, Thomas G. Wong
A quantum particle evolving by Schrödinger'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 o…
Constant-Time Quantum Search with a Many-Body Quantum System
Benjamin DalFavero, Alexander Meill, David A. Meyer +2
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…