Quantum algorithms for algebraic problems
Quantum computers can execute algorithms that dramatically outperform classical
computation. As the best-known example, Shor discovered an efficient quantum algorithm …
computation. As the best-known example, Shor discovered an efficient quantum algorithm …
Integrated quantum-walk structure and NAND tree on a photonic chip
In the age of the post-Moore era, the next-generation computing model would be a hybrid
architecture consisting of different physical components, such as photonic chips. In 2008, it …
architecture consisting of different physical components, such as photonic chips. In 2008, it …
Bose-Hubbard model for universal quantum-walk-based computation
We present a scheme for universal quantum computation based on spinless interacting
bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional …
bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional …
A New Type of Classical Logic Circuit with Exponential Speedup
Y Zhang, T Chen, X Tong, N Pan… - Advanced Intelligent …, 2023 - Wiley Online Library
Compared with classical algorithms, quantum algorithms can show the advantage of
exponential speedup in solving some problems. Solving the NAND‐Tree problem is a …
exponential speedup in solving some problems. Solving the NAND‐Tree problem is a …
Single-qubit unitary gates by graph scattering
We consider the effects of plane-wave states scattering off finite graphs as an approach to
implementing single-qubit unitary operations within the continuous-time quantum walk …
implementing single-qubit unitary operations within the continuous-time quantum walk …