Showing quant-phShow all
3 papers · 1 filter
quant-ph2025
Complexity for one-dimensional discrete time quantum walk circuits
Aranya Bhattacharya, Himanshu Sahu, Ahmadullah Zahed +1
We compute the complexity for the mixed state density operator derived from a one-dimensional discrete-time quantum walk (DTQW). The complexity is computed using a two-qubit quantu…
quant-ph2024
NAC-QFL: Noise Aware Clustered Quantum Federated Learning
Himanshu Sahu, Hari Prabhat Gupta
Recent advancements in quantum computing, alongside successful deployments of quantum communication, hold promises for revolutionizing mobile networks. While Quantum Machine Learni…
quant-ph2024
Quantum-walk search in motion
Himanshu Sahu, Kallol Sen
In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional sear…