Soumik Adhikary
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
Soumik Adhikary has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Vittal Ravishankar Rai
Indian Institute of Information Technology Dharwad
6 shared publications - Sooryansh Asthana
Department of Physics IIT Delhi Hauz Khas 110016 New Delhi Delhi India
4 shared publications - Daniil Rabinovich
Russian Quantum Center
2 shared publications - Jacob Biamonte
Skolkovo Institute of Science and Technology, Moscow 121205, Russia
2 shared publications - Alexey Uvarov
Skolkovo Institute of Science and Technology
1 shared publication - Andrey Kardashin
Skolkovo Institute of Science and Technology
1 shared publication
Latest Publications
- 16 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Role of overparametrization in quantum approximate optimization
- 16 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Role of overparametrization in quantum approximate optimization
- 17 February 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Expressivity limits in quantum walk-based optimization
- 17 February 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Expressivity limits in quantum walk-based optimization
- 1 July 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (1) , 012404
Mitigating quantum gate errors for variational eigensolvers using hardware-inspired zero-noise extrapolation
Variational quantum algorithms have emerged as a cornerstone of contemporary quantum algorithms research. Practical implementations of these algorithms, despite offering certain levels of robustness against systematic errors, show a decline in performance due to the presence of stochastic errors and limited coherence time. In this work, we develop a recipe for mitigating quantum gate errors using zero-noise extrapolation. We introduce an experimentally amenable method to control error strength in the circuit. We utilize the fact that gate errors in a physical quantum device are distributed inhomogeneously over different qubits and qubit pairs. As a result, one can achieve different circuit error sums based on the manner in which abstract qubits in the circuit are mapped to a physical device. We apply the proposed protocol to variational quantum algorithms and find that the estimated energy is approximately linear with respect to the circuit error sum (CES). Consequently, a linear fit through the energy-CES data, when extrapolated to zero CES, can approximate the energy estimated by a noiseless variational algorithm. We demonstrate this numerically and investigate the applicability range of the technique.
- 1 July 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (1) , 012404
Mitigating quantum gate errors for variational eigensolvers using hardware-inspired zero-noise extrapolation
Variational quantum algorithms have emerged as a cornerstone of contemporary quantum algorithms research. Practical implementations of these algorithms, despite offering certain levels of robustness against systematic errors, show a decline in performance due to the presence of stochastic errors and limited coherence time. In this work, we develop a recipe for mitigating quantum gate errors using zero-noise extrapolation. We introduce an experimentally amenable method to control error strength in the circuit. We utilize the fact that gate errors in a physical quantum device are distributed inhomogeneously over different qubits and qubit pairs. As a result, one can achieve different circuit error sums based on the manner in which abstract qubits in the circuit are mapped to a physical device. We apply the proposed protocol to variational quantum algorithms and find that the estimated energy is approximately linear with respect to the circuit error sum (CES). Consequently, a linear fit through the energy-CES data, when extrapolated to zero CES, can approximate the energy estimated by a noiseless variational algorithm. We demonstrate this numerically and investigate the applicability range of the technique.
- 29 April 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (4) , 042426
Robustness of variational quantum algorithms against stochastic parameter perturbation
Variational quantum algorithms are tailored to perform within the constraints of current quantum devices, yet they are limited by performance-degrading errors. In this study we consider a noise model that reflects realistic gate errors inherent to variational quantum algorithms. We investigate the decoherence of a variationally prepared quantum state due to this noise model, which causes a deviation from the energy estimation in the variational approach. By performing a perturbative analysis of optimized circuits, we determine the noise threshold at which the criterion set by the stability lemma is met. We assess our findings against the variational quantum eigensolver and quantum approximate optimization algorithm for various problems with up to 14 qubits. Moreover, we show that certain gate errors have a significantly smaller impact on the coherence of the state, allowing us to reduce the execution time without compromising performance.
- 29 April 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (4) , 042426
Robustness of variational quantum algorithms against stochastic parameter perturbation
Variational quantum algorithms are tailored to perform within the constraints of current quantum devices, yet they are limited by performance-degrading errors. In this study we consider a noise model that reflects realistic gate errors inherent to variational quantum algorithms. We investigate the decoherence of a variationally prepared quantum state due to this noise model, which causes a deviation from the energy estimation in the variational approach. By performing a perturbative analysis of optimized circuits, we determine the noise threshold at which the criterion set by the stability lemma is met. We assess our findings against the variational quantum eigensolver and quantum approximate optimization algorithm for various problems with up to 14 qubits. Moreover, we show that certain gate errors have a significantly smaller impact on the coherence of the state, allowing us to reduce the execution time without compromising performance.
- Open Access
- 5 October 2022
- Published by European Mathematical Society - EMS - Publishing House GmbH in European Mathematical Society Magazine
- No. 126,p. 4-12
Tensor networks in machine learning
EMS Magazine Article from: Richik Sengupta, Soumik Adhikary, Ivan Oseledets, Jacob Biamonte
- 5 October 2022
- Published by European Mathematical Society - EMS - Publishing House GmbH in European Mathematical Society Magazine
- No. 126,p. 4-12
Open AccessTensor networks in machine learning
EMS Magazine Article from: Richik Sengupta, Soumik Adhikary, Ivan Oseledets, Jacob Biamonte
- 2 August 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (8) , 1-12
Entanglement assisted training algorithm for supervised quantum classifiers
- 2 August 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (8) , 1-12
Entanglement assisted training algorithm for supervised quantum classifiers
- 6 January 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (1) , 1-33
Non-locality and entanglement in multi-qubit systems from a unified framework
- 6 January 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (1) , 1-33
Non-locality and entanglement in multi-qubit systems from a unified framework
- Open Access
Non-locality and entanglement in multi-qubit systems from a unified framework
Non-classical probability is the underlying feature of quantum mechanics. The emergence of Bell-CHSH non-locality for bipartite systems and linear entanglement inequalities for two-qubit systems has been shown in Adhikary et al. 2020 [Eur. Phys. J. D 74, 68 (2020)], purely as violations of classical probability rules. In this paper, we improve upon that work by showing that violation of any nonlocality inequality implies violation of classical probability rules, manifested through negative probabilities, without recourse to any underlying theory. Moving on to entanglement, we employ parent pseudoprojections to show how any number of linear and nonlinear entanglement witnesses for multiqubit systems can be obtained as violations of classical probability rules. They include the ones that have been derived earlier by employing different methods. It provides a perspective complementary to the current understanding in terms of the algebraic approaches.
Open AccessNon-locality and entanglement in multi-qubit systems from a unified framework
Non-classical probability is the underlying feature of quantum mechanics. The emergence of Bell-CHSH non-locality for bipartite systems and linear entanglement inequalities for two-qubit systems has been shown in Adhikary et al. 2020 [Eur. Phys. J. D 74, 68 (2020)], purely as violations of classical probability rules. In this paper, we improve upon that work by showing that violation of any nonlocality inequality implies violation of classical probability rules, manifested through negative probabilities, without recourse to any underlying theory. Moving on to entanglement, we employ parent pseudoprojections to show how any number of linear and nonlinear entanglement witnesses for multiqubit systems can be obtained as violations of classical probability rules. They include the ones that have been derived earlier by employing different methods. It provides a perspective complementary to the current understanding in terms of the algebraic approaches.
- Open Access
Entanglement assisted training algorithm for supervised quantum classifiers
We propose a new training algorithm for supervised quantum classifiers. Here, we have harnessed the property of quantum entanglement to build a model that can simultaneously manipulate multiple training samples along with their labels. Subsequently a Bell-inequality based cost function is constructed, that can encode errors from multiple samples, simultaneously, in a way that is not possible by any classical means. We show that upon minimizing this cost function one can achieve successful classification in benchmark datasets. The results presented in this paper are for binary classification problems. Nevertheless, the analysis can be extended to multi-class classification problems as well.
Open AccessEntanglement assisted training algorithm for supervised quantum classifiers
We propose a new training algorithm for supervised quantum classifiers. Here, we have harnessed the property of quantum entanglement to build a model that can simultaneously manipulate multiple training samples along with their labels. Subsequently a Bell-inequality based cost function is constructed, that can encode errors from multiple samples, simultaneously, in a way that is not possible by any classical means. We show that upon minimizing this cost function one can achieve successful classification in benchmark datasets. The results presented in this paper are for binary classification problems. Nevertheless, the analysis can be extended to multi-class classification problems as well.
- 9 April 2020
- Published by Springer Nature in The European Physical Journal D
- Vol. 74 (4) , 1-8
Bell-CHSH non-locality and entanglement from a unified framework
- 9 April 2020
- Published by Springer Nature in The European Physical Journal D
- Vol. 74 (4) , 1-8
Bell-CHSH non-locality and entanglement from a unified framework