7 papers
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…
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…
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…
A Generalized Quantum Branching Program
Debajyoti Bera, Tharrmashastha Sapv
Classical branching programs are studied to understand the space complexity of computational problems. Prior to this work, Nakanishi and Ablayev had separately defined two differen…
Few Quantum Algorithms on Amplitude Distribution
Debajyoti Bera, Tharrmashastha Sapv
Amplitude filtering is concerned with identifying basis-states in a superposition whose amplitudes are greater than a specified threshold; probability filtering is defined analogou…
HighDist Framework: Algorithms and Applications
Debajyoti Bera, Tharrmashastha Sapv
We introduce the problem of determining if the mode of the output distribution of a quantum circuit (given as a black-box) is larger than a given threshold, named HighDist, and a s…
Efficient Quantum Algorithms related to Autocorrelation Spectrum
Debajyoti Bera, Subhamoy Maitra, SAPV Tharrmashastha
In this paper, we propose efficient probabilistic algorithms for several problems regarding the autocorrelation spectrum. First, we present a quantum algorithm that samples from th…