Apoorva D. Patel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Apoorva D. Patel has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Abhijith J.2 shared publications
- Parveen Kumar
Indian Institute of Technology Jammu
2 shared publications - Anjani Priyadarsini
Centre for High Energy Physics Indian Institute of Science 560012 Bangalore Karnataka India
1 shared publication Biplab Mahato
Physics Department Indian Institute of Science 560012 Bangalore
1 shared publicationHimanshu Chaudhary
Physics Department Indian Institute of Science 560012 Bangalore
1 shared publication- Kumari Jyoti
Centre for High Energy Physics Indian Institute of Science 560012 Bangalore Karnataka India
1 shared publication
Latest Publications
- Open Access
Limitations of Quantum Advantage in Unsupervised Machine Learning
Machine learning models are used for pattern recognition analysis of big data, without direct human intervention. The task of unsupervised learning is to find the probability distribution that would best describe the available data, and then use it to make predictions for observables of interest. Classical models generally fit the data to Boltzmann distribution of Hamiltonians with a large number of tunable parameters. Quantum extensions of these models replace classical probability distributions with quantum density matrices. An advantage can be obtained only when features of density matrices that are absent in classical probability distributions are exploited. Such situations depend on the input data as well as the targeted observables. Explicit examples are discussed that bring out the constraints limiting possible quantum advantage. The problem-dependent extent of quantum advantage has implications for both data analysis and sensing applications.
Open AccessLimitations of Quantum Advantage in Unsupervised Machine Learning
Machine learning models are used for pattern recognition analysis of big data, without direct human intervention. The task of unsupervised learning is to find the probability distribution that would best describe the available data, and then use it to make predictions for observables of interest. Classical models generally fit the data to Boltzmann distribution of Hamiltonians with a large number of tunable parameters. Quantum extensions of these models replace classical probability distributions with quantum density matrices. An advantage can be obtained only when features of density matrices that are absent in classical probability distributions are exploited. Such situations depend on the input data as well as the targeted observables. Explicit examples are discussed that bring out the constraints limiting possible quantum advantage. The problem-dependent extent of quantum advantage has implications for both data analysis and sensing applications.
- Open Access
Advances in Machine Learning: Where Can Quantum Techniques Help?
Quantum Machine Learning (QML) represents a promising frontier at the intersection of quantum computing and artificial intelligence, aiming to leverage quantum computational advantages to enhance data-driven tasks. This review explores the potential of QML to address the computational bottlenecks of classical machine learning, particularly in processing complex datasets. We introduce the theoretical foundations of QML, including quantum data encoding, quantum learning theory and optimization techniques, while categorizing QML approaches based on data type and computational architecture. It is well-established that quantum computational advantages are problem-dependent, and so potentially useful directions for QML need to be systematically identified. Key developments, such as Quantum Principal Component Analysis, quantum-enhanced sensing and applications in material science, are critically evaluated for their theoretical speed-ups and practical limitations. The challenges posed by Noisy Intermediate-Scale Quantum (NISQ) devices, including hardware noise, scalability constraints and data encoding overheads, are discussed in detail. We also outline future directions, emphasizing the need for quantum-native algorithms, improved error correction, and realistic benchmarks to bridge the gap between theoretical promise and practical deployment. This comprehensive analysis underscores that while QML has significant potential for specific applications such as quantum chemistry and sensing, its broader utility in real-world scenarios remains contingent on overcoming technological and methodological hurdles.
Open AccessAdvances in Machine Learning: Where Can Quantum Techniques Help?
Quantum Machine Learning (QML) represents a promising frontier at the intersection of quantum computing and artificial intelligence, aiming to leverage quantum computational advantages to enhance data-driven tasks. This review explores the potential of QML to address the computational bottlenecks of classical machine learning, particularly in processing complex datasets. We introduce the theoretical foundations of QML, including quantum data encoding, quantum learning theory and optimization techniques, while categorizing QML approaches based on data type and computational architecture. It is well-established that quantum computational advantages are problem-dependent, and so potentially useful directions for QML need to be systematically identified. Key developments, such as Quantum Principal Component Analysis, quantum-enhanced sensing and applications in material science, are critically evaluated for their theoretical speed-ups and practical limitations. The challenges posed by Noisy Intermediate-Scale Quantum (NISQ) devices, including hardware noise, scalability constraints and data encoding overheads, are discussed in detail. We also outline future directions, emphasizing the need for quantum-native algorithms, improved error correction, and realistic benchmarks to bridge the gap between theoretical promise and practical deployment. This comprehensive analysis underscores that while QML has significant potential for specific applications such as quantum chemistry and sensing, its broader utility in real-world scenarios remains contingent on overcoming technological and methodological hurdles.
- 3 March 2025
- Published by Elsevier in BioSystems
- Vol. 250, 105428
Understanding nature’s selection of genetic languages
- 3 March 2025
- Published by Elsevier in BioSystems
- Vol. 250, 105428
Understanding nature’s selection of genetic languages
- 1 January 2025
- Published by Springer Nature in Journal of the Indian Institute of Science
- Vol. 105 (1) , 85-95
EPR Paradox, Bell Inequalities and Peculiarities of Quantum Correlations
- 1 January 2025
- Published by Springer Nature in Journal of the Indian Institute of Science
- Vol. 105 (1) , 85-95
EPR Paradox, Bell Inequalities and Peculiarities of Quantum Correlations
- Open Access
The Quantum Density Matrix and its many uses: From quantum structure to quantum chaos and noisy simulators
The quantum density matrix generalises the classical concept of probability distribution to quantum theory. It gives the complete description of a quantum state as well as the observable quantities that can be extracted from it. Its mathematical structure is described, with applications to understanding quantum correlations, illustrating quantum chaos and its unravelling, and developing software simulators for noisy quantum systems with efficient quantum state tomography.
Open AccessThe Quantum Density Matrix and its many uses: From quantum structure to quantum chaos and noisy simulators
The quantum density matrix generalises the classical concept of probability distribution to quantum theory. It gives the complete description of a quantum state as well as the observable quantities that can be extracted from it. Its mathematical structure is described, with applications to understanding quantum correlations, illustrating quantum chaos and its unravelling, and developing software simulators for noisy quantum systems with efficient quantum state tomography.
- 1 April 2023
- Published by Springer Nature in Journal of the Indian Institute of Science
- Vol. 103 (2) , 401-417
The Quantum Density Matrix and Its Many Uses
- 1 April 2023
- Published by Springer Nature in Journal of the Indian Institute of Science
- Vol. 103 (2) , 401-417
The Quantum Density Matrix and Its Many Uses
- 1 April 2023
- Published by Springer Nature in Journal of the Indian Institute of Science
- Vol. 103 (2) , 395-396
Editorial
- 1 April 2023
- Published by Springer Nature in Journal of the Indian Institute of Science
- Vol. 103 (2) , 395-396
Editorial
- Open Access
A Software Simulator for Noisy Quantum Circuits
We have developed a software library that simulates noisy quantum logic circuits. We represent quantum states by their density matrices in the Pauli basis, and incorporate possible errors in initialisation, logic gates, memory and measurement using simple models. Our quantum simulator is implemented as a new backend on IBM's open-source Qiskit platform. In this document, we provide its description, and illustrate it with some simple examples.
Open AccessA Software Simulator for Noisy Quantum Circuits
We have developed a software library that simulates noisy quantum logic circuits. We represent quantum states by their density matrices in the Pauli basis, and incorporate possible errors in initialisation, logic gates, memory and measurement using simple models. Our quantum simulator is implemented as a new backend on IBM's open-source Qiskit platform. In this document, we provide its description, and illustrate it with some simple examples.
- Open Access
Grover's Algorithm in Natural Settings
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other quantum features. Several of these set-ups are described, pointing out that some of them occur quite naturally. In particular, it is entirely possible that the algorithm played a key role in the selection of the universal structure of genetic languages.
Open AccessGrover's Algorithm in Natural Settings
The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other quantum features. Several of these set-ups are described, pointing out that some of them occur quite naturally. In particular, it is entirely possible that the algorithm played a key role in the selection of the universal structure of genetic languages.
- Open Access
Improving the query complexity of quantum spatial search in two dimensions
The question of whether quantum spatial search in two dimensions can be made optimal has long been an open problem. We report progress towards its resolution by showing that the oracle complexity for target location can be made optimal, by increasing the number of calls to the walk operator that incorporates the graph structure by a logarithmic factor. Our algorithm does not require amplitude amplification. An important ingredient of our algorithm is the implementation of multi-step quantum walks by graph powering, using a coin space of walk-length dependent dimension, which may be of independent interest. Finally, we demonstrate how to implement quantum walks arising from powers of symmetric Markov chains using our methods.
Open AccessImproving the query complexity of quantum spatial search in two dimensions
The question of whether quantum spatial search in two dimensions can be made optimal has long been an open problem. We report progress towards its resolution by showing that the oracle complexity for target location can be made optimal, by increasing the number of calls to the walk operator that incorporates the graph structure by a logarithmic factor. Our algorithm does not require amplitude amplification. An important ingredient of our algorithm is the implementation of multi-step quantum walks by graph powering, using a coin space of walk-length dependent dimension, which may be of independent interest. Finally, we demonstrate how to implement quantum walks arising from powers of symmetric Markov chains using our methods.