Ioannis Liliopoulos

Ioannis Liliopoulos

Auto-generated profile, based on publicly available information

Ioannis Liliopoulos

Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 July 2025 in Journal of Computer-Aided Molecular Design
Verified
Journal Article
Open access
PDF file
ILIoannis Liliopoulos
Ioannis Liliopoulos
GVGeorgios D. Varsamis
Georgios D. Varsamis
TKTheodora Karamanidou
Theodora Karamanidou
Christos PapalitsasChristos Papalitsas
Christos Papalitsas
GKGrigorios Koulouras
Grigorios Koulouras
IKIoannis Karafyllidis
Ioannis Karafyllidis
Over the past two decades, the development of novel drugs evolved into a high-demanding computational field. There is a constant and increasing need for advanced methods for determining protein-ligand binding in the drug design process. Even after the introduction and use of High-Performance Computers in drug design, fundamental problems and constraints have not been dealt with in a satisfactory manner. This is partially due to the fact that ligand docking in proteins is a quantum mechanical process. With the quantum computers available today, the question “Can quantum computers be used in drug design and how?” arises naturally. A novel quantum algorithm for protein-ligand docking site identification is presented here. In detail, the protein lattice model has been expanded to include protein-ligand interactions. Quantum state labelling for the interaction sites is introduced, and an extended and modified Grover quantum search algorithm is implemented to search for docking sites. This algorithm has been tested and executed on both a quantum simulator and a real quantum computer. The results show that the quantum algorithm can identify effectively docking sites. The quantum algorithm is highly scalable and well-suited for identifying docking sites within large proteins, poised to harness the potential of increased quantum bits in the future.

7 September 2025 in arXiv
Verified
Preprint
Open access
PDF file
KRKonstantinos Rallis
Konstantinos Rallis
ILIoannis Liliopoulos
Ioannis Liliopoulos
GVGeorgios D. Varsamis
Georgios D. Varsamis
ETEvangelos Tsipas
Evangelos Tsipas
IKIoannis Karafyllidis
Ioannis Karafyllidis
PDPanagiotis Dimitrakis
Panagiotis Dimitrakis
The connection and eventual integration of High-Performance Computing (HPC) with Quantum Computing (QC) represents a transformative advancement in computational technology, promising significant enhancements in solving complex, previously intractable problems. This manuscript provides a comprehensive overview of the current state of HPC-QC interfacing, detailing architectural methodologies, software stack developments, middleware functionalities, and hardware integration strategies. It critically assesses existing hardware-level integration models, ranging from standalone and loosely-coupled architectures to tightly-integrated and on-node systems. The software ecosystem is analyzed, highlighting prominent frameworks such as Qiskit, PennyLane, CUDA-Q, and middleware solutions like Pilot-Quantum, essential for seamless hybrid computing environments. Furthermore, the manuscript discusses practical applications in optimization, machine learning, and many-body dynamics, where hybrid HPC-QC systems can offer substantial advantages. It also describes existing challenges, including hardware limitations (coherence, scalability, connectivity), software maturity, communication overhead, resource management complexities, and cost factors. Finally, future directions towards tighter hardware and software integration are discussed, emphasizing ongoing research developments and emerging trends that promise to expand the capabilities and accessibility of hybrid HPC-QC systems.

18 August 2025 in Advanced Quantum Technologies
Verified
Journal Article
Open access
GVGeorgios D. Varsamis
Georgios D. Varsamis
ILIoannis Liliopoulos
Ioannis Liliopoulos
HMHamed Mohammadbagherpoor
Hamed Mohammadbagherpoor
AKAndreas K. Kostopoulos
Andreas K. Kostopoulos
KMKristin Milchanowski
Kristin Milchanowski
IKIoannis Karafyllidis
Ioannis Karafyllidis
Entanglement is one of the most vital resources in quantum computing. Particularly, in quantum game theory, entanglement holds significant importance since it defines the interactions and the information exchange between two or more players. In this research work, a new set of entanglement operators is introduced for N‐player quantum games. This study explores how their application affects each player's behavior throughout the game. Furthermore, the entangling capabilities are tested and evaluated for a wide range of entanglement operator angles, by exploiting the Von Neumann entropy metric, both on a simulator and on a real IBM Quantum system. Their hardware efficiency, against state‐of‐the‐art quantum games entanglement operators, is assessed in terms of circuit depths and fidelity, and showcases their great potential as multiplayer quantum games operators. Finally, three methods are compared for computing the players’ payoffs, regarding their scalability and efficiency. This study shows that in all payoff cases, the quantum game results, computed by the quantum hardware, are in accordance with the simulated ones.

1 September 2025 in Parallel Processing Letters
Verified
Journal Article
Closed access
GVGeorgios D. Varsamis
Georgios D. Varsamis
ILIoannis Liliopoulos
Ioannis Liliopoulos
HMHamed Mohammadbagherpoor
Hamed Mohammadbagherpoor
AKAndreas K. Kostopoulos
Andreas K. Kostopoulos
KMKristin Milchanowski
Kristin Milchanowski
IKIoannis Karafyllidis
Ioannis Karafyllidis