Gopal Chandra Santra
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
Gopal Chandra Santra has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Daniel J. Egger
IBM Quantum, IBM Research Europe—Zurich, Rueschlikon, Switzerland
2 shared publications - Philipp Hauke
Università di Trento
2 shared publications - Fred Jendrzejewski
Kirchhoff-Institut für Physik, Universität Heidelberg, Im Neuenheimer Feld 227, 69120 Heidelberg, Germany
1 shared publication - Sudipto Singha Roy
Università di Trento
1 shared publication
Latest Publications
- 20 February 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (2)
Genuine multipartite entanglement in quantum optimization
- 20 February 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 111 (2)
Genuine multipartite entanglement in quantum optimization
- 8 January 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (1) , 012413
Squeezing and quantum approximate optimization
Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations therein remain unclear. Here, we shed light on this open issue by establishing a tight connection to the seemingly unrelated field of quantum metrology: Metrological applications employ quantum states of spin ensembles with a reduced variance to achieve an increased sensitivity, and we cast the generation of such squeezed states in the form of finding optimal solutions to a combinatorial MaxCut problem with an increased precision. By solving this optimization problem with a quantum approximate optimization algorithm (QAOA), we show numerically as well as on an IBM Quantum chip how highly squeezed states are generated in a systematic procedure that can be adapted to a wide variety of quantum machines. Moreover, squeezing tailored for the QAOA of the MaxCut permits us to propose a figure of merit for future hardware benchmarks. Exploiting the connection, we show how the performance can be improved by warm-starting the optimization algorithm with the squeezed state.
- 8 January 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (1) , 012413
Squeezing and quantum approximate optimization
Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations therein remain unclear. Here, we shed light on this open issue by establishing a tight connection to the seemingly unrelated field of quantum metrology: Metrological applications employ quantum states of spin ensembles with a reduced variance to achieve an increased sensitivity, and we cast the generation of such squeezed states in the form of finding optimal solutions to a combinatorial MaxCut problem with an increased precision. By solving this optimization problem with a quantum approximate optimization algorithm (QAOA), we show numerically as well as on an IBM Quantum chip how highly squeezed states are generated in a systematic procedure that can be adapted to a wide variety of quantum machines. Moreover, squeezing tailored for the QAOA of the MaxCut permits us to propose a figure of merit for future hardware benchmarks. Exploiting the connection, we show how the performance can be improved by warm-starting the optimization algorithm with the squeezed state.