A new quantum walk variant reduces circuit depth for NISQ devices and enables reproducible chaos-based 128-bit key generation from quantum entropy in simulations.
Efficient implementation of discrete-time quantum walks on quantum computers.Entropy, 26 (4):313, April 2024
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Two distinguishable continuous-time quantum walkers on parallel one-dimensional lattices with tailored distance-dependent interactions exhibit four dynamical regimes, one of which optimizes both transport efficiency and entanglement.
citing papers explorer
-
A NISQ-friendly Coined Quantum Walk Algorithm for Chaos-based Cryptographic Applications
A new quantum walk variant reduces circuit depth for NISQ devices and enables reproducible chaos-based 128-bit key generation from quantum entropy in simulations.
-
Engineering entanglement and transport in interacting quantum walks with tailored potentials
Two distinguishable continuous-time quantum walkers on parallel one-dimensional lattices with tailored distance-dependent interactions exhibit four dynamical regimes, one of which optimizes both transport efficiency and entanglement.