Permitting loopless isolated vertices in dynamic graphs yields simpler quantum-walk implementations of the Pauli, Hadamard, T, and CNOT gates, with the T gate reduced to a single graph.
A quantum al- gorithm for the Hamiltonian NAND tree,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Isolated Vertices in Continuous-Time Quantum Walks on Dynamic Graphs
Permitting loopless isolated vertices in dynamic graphs yields simpler quantum-walk implementations of the Pauli, Hadamard, T, and CNOT gates, with the T gate reduced to a single graph.