Quantum walks on triple graphs show a parity-dependent switching effect in main-chain probability interchange for odd-length side chains under geometric conditions, absent for even lengths.
A Quantum Algorithm for the Hamiltonian NAND Tree
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a run time proportional to sqrt N. We also show a lower bound of sqrt N for the NAND tree problem in the Hamiltonian oracle model.
fields
quant-ph 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The switching effect of the side chain on quantum walks on triple graphs
Quantum walks on triple graphs show a parity-dependent switching effect in main-chain probability interchange for odd-length side chains under geometric conditions, absent for even lengths.