3 papers
quant-ph2026
Benchmarking Classical and Quantum Optimization Approaches for Rider-Order Assignment
Tharrmashastha SAPV, Surya Prakash Palanivel, Jasjyot Singh Gulati +1
The logistics industry is widely regarded as a promising application domain for emerging optimization paradigms, including quantum computing. The Rider-Order Assignment problem is…
quant-ph2026
Generalized cross-resonance scheme for maximally-entangling two-qutrit gates
Yash Saxena, Tharrmashastha Sapv, Sagnik Chatterjee +1
To utilize higher-dimensional quantum systems, in this Letter, we derive a generalized cross-resonance (GCR) scheme for realizing maximally entangling two-qutrit gates on fixed-fre…
quant-ph2024
Quantum Query-Space Lower Bounds Using Branching Programs
Debajyoti Bera, Tharrmashastha SAPV
Branching programs are quite popular for studying time-space lower bounds. Bera et al. recently introduced the model of generalized quantum branching program aka. GQBP that general…