Savo Glisic
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
Savo Glisic has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Beatriz Lorenzo
Department of Electrical and Computer Engineering, University of Massachusetts Amherst, Amherst, MA, USA
20 shared publications Beatriz Lorenzo
University of Massachusetts
3 shared publications- Yuguang Fang
City University of Hong Kong
3 shared publications - Alireza Shams Shafigh
Nokia, Espoo, Finland
2 shared publications - Ivana Kovacevic
Nokia, Oulu, Finland
2 shared publications Alireza Shams Shafigh
Centre for Wireless Communications, University of Oulu, 90570 Oulu, Finland
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- p. 1
Quantum Marginal Problem in IoQT Networks
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- p. 1
Quantum Marginal Problem in IoQT Networks
- Open Access
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 19396-19423
Latency-Optimal Quantum Circuits for IoT Networks
Future IoT networks will demand increasingly lower latency for transmitting mission-critical information while simultaneously adopting quantum technologies to enhance security and accelerate information processing. This survey reviews the state-of-the-art in latency-optimal quantum circuit design, focusing on minimizing circuit latency without sacrificing essential functionality. The space is primarily allocated to the network level aspects, exploring balance between the network latency and the energy consumption, programmability and cost, while establishing a proper interface with the problems that should be delegated to the practical design carried on by circuit developers. Section I analyzes how aggressive latency reduction constrains the use of universal and reversible gates—both of which tend to increase circuit depth (latency). Universal gates enable programmability, while reversible gates reduce energy dissipation, yet both can extend circuit latency. Aware of these trade-offs, Section II discusses latency-optimal design methodologies and their implementation aspects. Next we discuss exact minimization of quantum circuits, presenting quantitative improvements. For instance, controlled-T gate implementations demonstrate reductions from 15 → 9 T gates (compression = 15/9), 16 → 12 CNOT gates (compression = 16/12), and 9 → 5 T-latency (compression = 9/5). Similarly, for a 1-bit full adder, reductions include 14 → 8 T gates (14/8), 12 → 10 CNOT gates (12/10), 4 → 2 H gates (2), and 8 → 2 T-latency (4).
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 19396-19423
Open AccessLatency-Optimal Quantum Circuits for IoT Networks
Future IoT networks will demand increasingly lower latency for transmitting mission-critical information while simultaneously adopting quantum technologies to enhance security and accelerate information processing. This survey reviews the state-of-the-art in latency-optimal quantum circuit design, focusing on minimizing circuit latency without sacrificing essential functionality. The space is primarily allocated to the network level aspects, exploring balance between the network latency and the energy consumption, programmability and cost, while establishing a proper interface with the problems that should be delegated to the practical design carried on by circuit developers. Section I analyzes how aggressive latency reduction constrains the use of universal and reversible gates—both of which tend to increase circuit depth (latency). Universal gates enable programmability, while reversible gates reduce energy dissipation, yet both can extend circuit latency. Aware of these trade-offs, Section II discusses latency-optimal design methodologies and their implementation aspects. Next we discuss exact minimization of quantum circuits, presenting quantitative improvements. For instance, controlled-T gate implementations demonstrate reductions from 15 → 9 T gates (compression = 15/9), 16 → 12 CNOT gates (compression = 16/12), and 9 → 5 T-latency (compression = 9/5). Similarly, for a 1-bit full adder, reductions include 14 → 8 T gates (14/8), 12 → 10 CNOT gates (12/10), 4 → 2 H gates (2), and 8 → 2 T-latency (4).
- Open Access
- 28 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Optimum Resource Allocation in Secure Quantum Networks: Survey of Enabling Technology
Due to its complexity, resource allocation in complex communication networks has been always designed with great deal of approximations and restrictions. With the availability of quantum computing, quantum optimization and quantum search algorithms, we are able to overcome these limitations significantly and come up with more precise and efficient “quantum era” algorithms. The main objective of this paper is to provide the future network designers with a new optimization framework for resource (capacity and secrete key rate) allocation in quantum networks. The analysis is general to include: the classical capacity C, for transmitting classical information; the quantum capacity Q, for reliably transmitting intact quantum states; the two-way classical-assisted quantum capacity Q2, for transmitting quantum states with the help of a two-way classical side channel; and the entanglement-assisted classical capacity CE , which we define as the classical capacity of a quantum channel enabled by prior shared entanglement between two nodes. Once the optimization framework is introduced the rest of the paper discusses the optimization constraints, by surveying some examples of the relevant work on achievable network resources (capacity and secrete key rate) and relaxation of the optimization constraints by increasing these parameters using the quantum coding schemes. These constraints are an integral part of the optimization algorithms and full understanding of their nature and limits is essential for system optimization. The achievable secret key rates/capacity of quantum channels are limited, so our optimization framework for resource allocation enables maximization of the overall resources allocated to all users, or maximization of the number of users accessing the network, or minimization of the number of hopes on the routes or maximization of remaining resources in the most critical node in the network. The optimization problems have combinatorial form, and the most efficient execution of these algorithms can be achieved by using quantum search algorithms like Grover’s algorithm or quantum approximative optimization algorithms (QAOA) which are extensively discussed in the paper.Regarding the scope of the technology survey in Section VIII we summarize the coverage of our targeted survey and the coverage of other relevant works.
- 28 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Open AccessOptimum Resource Allocation in Secure Quantum Networks: Survey of Enabling Technology
Due to its complexity, resource allocation in complex communication networks has been always designed with great deal of approximations and restrictions. With the availability of quantum computing, quantum optimization and quantum search algorithms, we are able to overcome these limitations significantly and come up with more precise and efficient “quantum era” algorithms. The main objective of this paper is to provide the future network designers with a new optimization framework for resource (capacity and secrete key rate) allocation in quantum networks. The analysis is general to include: the classical capacity C, for transmitting classical information; the quantum capacity Q, for reliably transmitting intact quantum states; the two-way classical-assisted quantum capacity Q2, for transmitting quantum states with the help of a two-way classical side channel; and the entanglement-assisted classical capacity CE , which we define as the classical capacity of a quantum channel enabled by prior shared entanglement between two nodes. Once the optimization framework is introduced the rest of the paper discusses the optimization constraints, by surveying some examples of the relevant work on achievable network resources (capacity and secrete key rate) and relaxation of the optimization constraints by increasing these parameters using the quantum coding schemes. These constraints are an integral part of the optimization algorithms and full understanding of their nature and limits is essential for system optimization. The achievable secret key rates/capacity of quantum channels are limited, so our optimization framework for resource allocation enables maximization of the overall resources allocated to all users, or maximization of the number of users accessing the network, or minimization of the number of hopes on the routes or maximization of remaining resources in the most critical node in the network. The optimization problems have combinatorial form, and the most efficient execution of these algorithms can be achieved by using quantum search algorithms like Grover’s algorithm or quantum approximative optimization algorithms (QAOA) which are extensively discussed in the paper.Regarding the scope of the technology survey in Section VIII we summarize the coverage of our targeted survey and the coverage of other relevant works.
- Open Access
- 8 July 2025
- Published by Elsevier in Optics Communications
- Vol. 608
Optimum 6G/7G quantum network design: Survey
- 8 July 2025
- Published by Elsevier in Optics Communications
- Vol. 608
Open AccessOptimum 6G/7G quantum network design: Survey
- Open Access
- 14 May 2024
- Published by Elsevier in Intelligent Systems with Applications
- Vol. 23
Quantum computing and neuroscience for 6G/7G networks: Survey
- 14 May 2024
- Published by Elsevier in Intelligent Systems with Applications
- Vol. 23
Open AccessQuantum computing and neuroscience for 6G/7G networks: Survey
- Open Access
- 1 January 2024
- Published by KEAI Publishing in Cyber Security and Applications
- Vol. 2
Quantum vs post‐quantum security for future networks: Survey
- 1 January 2024
- Published by KEAI Publishing in Cyber Security and Applications
- Vol. 2
Open AccessQuantum vs post‐quantum security for future networks: Survey
- 4 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (2) , 2130-2144
Low-Latency Robust Computing Vehicular Networks
Vehicle-centric edge computing provides a promising approach to reducing the network operational costs of the future latency-limited applications (e.g. connected-autonomous vehicles, virtual reality) by migrating the required services toward the vehicle-provided resources. However, uncertainties from unknown traffic and availability of these resources as well as diversity of vehicle platforms can result in significant performance degradation of such service migration mechanisms. In this paper, we propose vehicle-centric networking concept to provide low latency services by designing time compression mechanism for computing programs so that the program execution latency can be significantly reduced. In addition, by jointly tailoring data and control planes we implement a highly responsive and cost-efficient edge service. By leveraging network functions virtualization (NFV) and software defined networking (SDN) technologies we provide a suitable environment for at-edge programmability to customize network functionalities for low latency services in multi-platooning systems for vehicular networks. We develop a responsive edge system by implementing control plane over pre-established access points (e.g., road-side units), allocating redundant resources, and utilizing an adaptive service migration mechanism in order to avoid any degradation of the quality of edge services. We design a robust double Knapsack (RDK) framework, where a spare knapsack of redundant resources is allocated to each plane to cope with the uncertainties of vehicle-provided resources. By combining with VNFs, SDN technology has been used to design a centralized management framework to control and monitor the edge computing in multi-platooning systems.
- 4 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (2) , 2130-2144
Low-Latency Robust Computing Vehicular Networks
Vehicle-centric edge computing provides a promising approach to reducing the network operational costs of the future latency-limited applications (e.g. connected-autonomous vehicles, virtual reality) by migrating the required services toward the vehicle-provided resources. However, uncertainties from unknown traffic and availability of these resources as well as diversity of vehicle platforms can result in significant performance degradation of such service migration mechanisms. In this paper, we propose vehicle-centric networking concept to provide low latency services by designing time compression mechanism for computing programs so that the program execution latency can be significantly reduced. In addition, by jointly tailoring data and control planes we implement a highly responsive and cost-efficient edge service. By leveraging network functions virtualization (NFV) and software defined networking (SDN) technologies we provide a suitable environment for at-edge programmability to customize network functionalities for low latency services in multi-platooning systems for vehicular networks. We develop a responsive edge system by implementing control plane over pre-established access points (e.g., road-side units), allocating redundant resources, and utilizing an adaptive service migration mechanism in order to avoid any degradation of the quality of edge services. We design a robust double Knapsack (RDK) framework, where a spare knapsack of redundant resources is allocated to each plane to cope with the uncertainties of vehicle-provided resources. By combining with VNFs, SDN technology has been used to design a centralized management framework to control and monitor the edge computing in multi-platooning systems.
- 4 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (2) , 2407-2423
Optimization of 3D Spectrum Management in Future Wireless Networks
In this paper, we propose an application customized network slicing mechanism to cope with dynamic traffic in future networks and various service requirements for network users, namely, context-aware network slicing (CANS). The resource allocation is carried out in frequency (f), space (s) and time (t) domains (referred to as three domains (3D) resource allocation) while the customization targets at low latency and high reliability, characteristic for IoT applications. We first formulate CANS as a two-step matching game with unknown preferences for access and back-haul networks. To dynamically resize mobile users' network slices (NSs), we propose application customized CANS++ method based on a coalition game to minimize the hand-off risk in the network. We then develop two-step stable matching (TSSM) and $\epsilon$ -Pareto stability techniques to find the solutions to CANS and CANS++, respectively. To improve energy and cost efficiency, an artificial intelligence-based Dynamic Network Architecture (DNA) with ON/OFF scheduling (AI-DOS) is proposed to dynamically maximize NS utilization. Finally, we carry out extensive numerical analysis and demonstrate that context-aware 3D network slicing and resizing schemes can improve at least three times the users' utilities. These utilities are enhanced up to $180\%$ by minimizing their hand-off risk. Furthermore, NS shrinking technique can reduce the number of active nodes (controlled in the s-domain) by factor five while the average utility of macro base stations, controlled in the t-domain, is improved between $70\%$ and $500\%$ .
- 4 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (2) , 2407-2423
Optimization of 3D Spectrum Management in Future Wireless Networks
In this paper, we propose an application customized network slicing mechanism to cope with dynamic traffic in future networks and various service requirements for network users, namely, context-aware network slicing (CANS). The resource allocation is carried out in frequency (f), space (s) and time (t) domains (referred to as three domains (3D) resource allocation) while the customization targets at low latency and high reliability, characteristic for IoT applications. We first formulate CANS as a two-step matching game with unknown preferences for access and back-haul networks. To dynamically resize mobile users' network slices (NSs), we propose application customized CANS++ method based on a coalition game to minimize the hand-off risk in the network. We then develop two-step stable matching (TSSM) and $\epsilon$ -Pareto stability techniques to find the solutions to CANS and CANS++, respectively. To improve energy and cost efficiency, an artificial intelligence-based Dynamic Network Architecture (DNA) with ON/OFF scheduling (AI-DOS) is proposed to dynamically maximize NS utilization. Finally, we carry out extensive numerical analysis and demonstrate that context-aware 3D network slicing and resizing schemes can improve at least three times the users' utilities. These utilities are enhanced up to $180\%$ by minimizing their hand-off risk. Furthermore, NS shrinking technique can reduce the number of active nodes (controlled in the s-domain) by factor five while the average utility of macro base stations, controlled in the t-domain, is improved between $70\%$ and $500\%$ .
- 14 February 2022
- Published by Wiley
- p. 637-692
Quantum Decision Theory
- 14 February 2022
- Published by Wiley
- p. 593-635
QC Optimization