Ahmad Farooq
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
Ahmad Farooq has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Hyundong Shin
Kyung Hee University
9 shared publications - Junaid Ur Rehman
Department of Electrical Engineering, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
7 shared publications - Syed Muhammad Kazim
Department of Electronics and Information Convergence Engineering, Kyung Hee University, Yongin-si, Korea
2 shared publications - Uman Khalid
Kyung Hee University
2 shared publications - Youngmin Jeong
Department of Electronic Engineering, Kyung Hee University, Yongin-si, 17104, Korea
2 shared publications - Anssi Laukkanen
VTT Technical Research Centre of Finland
1 shared publication
Latest Publications
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Nanotechnology Magazine
- Vol. PP (19324510) , 1-10
Hardware Solutions Enabling More Efficient Quantum AI
Efficient quantum artificial intelligence (AI) benefits from fast data transfer between the high-performance computer and the quantum computer. Today's quantum computers have bottlenecks in both software pre- and post-processing as well as in hardware inefficiencies in data transfer to and from the quantum processing unit. Novel disruptive hardware solutions are required for the development of more efficient quantum AI, especially as quantum computers scale up to larger qubit counts. Possible solutions to the hardware challenge for superconducting quantum computers include optical control of superconducting qubits, cryogenic control electronics, and solid-state coolers. To accelerate hybrid processing further, part of the pre-processing in the quantum computer stack can be moved to the classical supercomputer.
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Nanotechnology Magazine
- Vol. PP (19324510) , 1-10
Hardware Solutions Enabling More Efficient Quantum AI
Efficient quantum artificial intelligence (AI) benefits from fast data transfer between the high-performance computer and the quantum computer. Today's quantum computers have bottlenecks in both software pre- and post-processing as well as in hardware inefficiencies in data transfer to and from the quantum processing unit. Novel disruptive hardware solutions are required for the development of more efficient quantum AI, especially as quantum computers scale up to larger qubit counts. Possible solutions to the hardware challenge for superconducting quantum computers include optical control of superconducting qubits, cryogenic control electronics, and solid-state coolers. To accelerate hybrid processing further, part of the pre-processing in the quantum computer stack can be moved to the classical supercomputer.
- 31 July 2024
- Published by Springer Nature
- p. 61-72
Optimal Task Scheduling in 6G Networks: A Variational Quantum Computing Approach
- 31 July 2024
- Published by Springer Nature
- p. 61-72
Optimal Task Scheduling in 6G Networks: A Variational Quantum Computing Approach
- Open Access
- 7 May 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (5) , 052410
Quantum-assisted Hilbert-space Gaussian process regression
Gaussian processes are probabilistic models that are commonly used as functional priors in machine learning. Due to their probabilistic nature, they can be used to capture prior information on the statistics of noise, smoothness of the functions, and training data uncertainty. However, their computational complexity quickly becomes intractable as the size of the data set grows. We propose a Hilbert-space approximation-based quantum algorithm for Gaussian process regression to overcome this limitation. Our method consists of a combination of classical basis function expansion with quantum computing techniques of quantum principal component analysis, conditional rotations, and Hadamard and tests. The quantum principal component analysis is used to estimate the eigenvalues, while the conditional rotations and the Hadamard and tests are employed to evaluate the posterior mean and variance of the Gaussian process. Our method provides polynomial computational complexity reduction over the classical method. Published by the American Physical Society 2024
- 7 May 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (5) , 052410
Open AccessQuantum-assisted Hilbert-space Gaussian process regression
Gaussian processes are probabilistic models that are commonly used as functional priors in machine learning. Due to their probabilistic nature, they can be used to capture prior information on the statistics of noise, smoothness of the functions, and training data uncertainty. However, their computational complexity quickly becomes intractable as the size of the data set grows. We propose a Hilbert-space approximation-based quantum algorithm for Gaussian process regression to overcome this limitation. Our method consists of a combination of classical basis function expansion with quantum computing techniques of quantum principal component analysis, conditional rotations, and Hadamard and tests. The quantum principal component analysis is used to estimate the eigenvalues, while the conditional rotations and the Hadamard and tests are employed to evaluate the posterior mean and variance of the Gaussian process. Our method provides polynomial computational complexity reduction over the classical method. Published by the American Physical Society 2024
- 16 July 2022
- Published by Springer Nature in Quantum Information Processing
- Vol. 21 (7) , 1-17
Self-guided quantum state learning for mixed states
- 16 July 2022
- Published by Springer Nature in Quantum Information Processing
- Vol. 21 (7) , 1-17
Self-guided quantum state learning for mixed states
- Open Access
Robust Quantum State Tomography Method for Quantum Sensing
Reliable and efficient reconstruction of pure quantum states under the processing of noisy measurement data is a vital tool in fundamental and applied quantum information sciences owing to communication, sensing, and computing. Specifically, the purity of such reconstructed quantum systems is crucial in surpassing the classical shot-noise limit and achieving the Heisenberg limit, regarding the achievable precision in quantum sensing. However, the noisy reconstruction of such resourceful sensing probes limits the quantum advantage in precise quantum sensing. For this, we formulate a pure quantum state reconstruction method through eigenvalue decomposition. We show that the proposed method is robust against the depolarizing noise; it remains unaffected under high strength white noise and achieves quantum state reconstruction accuracy similar to the noiseless case.
Open AccessRobust Quantum State Tomography Method for Quantum Sensing
Reliable and efficient reconstruction of pure quantum states under the processing of noisy measurement data is a vital tool in fundamental and applied quantum information sciences owing to communication, sensing, and computing. Specifically, the purity of such reconstructed quantum systems is crucial in surpassing the classical shot-noise limit and achieving the Heisenberg limit, regarding the achievable precision in quantum sensing. However, the noisy reconstruction of such resourceful sensing probes limits the quantum advantage in precise quantum sensing. For this, we formulate a pure quantum state reconstruction method through eigenvalue decomposition. We show that the proposed method is robust against the depolarizing noise; it remains unaffected under high strength white noise and achieves quantum state reconstruction accuracy similar to the noiseless case.
- Open Access
- 24 March 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-8
Self-guided quantum state tomography for limited resources
Quantum state tomography is a process for estimating an unknown quantum state; which is innately probabilistic. The exponential growth of unknown parameters to be estimated is a fundamental difficulty in realizing quantum state tomography for higher dimensions. Iterative optimization algorithms like self-guided quantum tomography have been effective in robust and accurate ascertaining a quantum state even with exponential growth in Hilbert space. We propose a faster convergent simultaneous perturbation stochastic approximation algorithm which is more practical in a resource-deprived situation for determining the underlying quantum states by incorporating the Barzilai–Borwein two-point step size gradient method with minimal loss of accuracy.
- 24 March 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-8
Open AccessSelf-guided quantum state tomography for limited resources
Quantum state tomography is a process for estimating an unknown quantum state; which is innately probabilistic. The exponential growth of unknown parameters to be estimated is a fundamental difficulty in realizing quantum state tomography for higher dimensions. Iterative optimization algorithms like self-guided quantum tomography have been effective in robust and accurate ascertaining a quantum state even with exponential growth in Hilbert space. We propose a faster convergent simultaneous perturbation stochastic approximation algorithm which is more practical in a resource-deprived situation for determining the underlying quantum states by incorporating the Barzilai–Borwein two-point step size gradient method with minimal loss of accuracy.
- 19 October 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (10) , 1-19
Adaptive quantum state tomography with iterative particle filtering
- 19 October 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (10) , 1-19
Adaptive quantum state tomography with iterative particle filtering
- Open Access
Adaptive quantum state tomography with iterative particle filtering
Several Bayesian estimation based heuristics have been developed to perform quantum state tomography (QST). Their ability to quantify uncertainties using region estimators and include a priori knowledge of the experimentalists makes this family of methods an attractive choice for QST. However, specialized techniques for pure states do not work well for mixed states and vice versa. In this paper, we present an adaptive particle filter (PF) based QST protocol which improves the scaling of fidelity compared to nonadaptive Bayesian schemes for arbitrary multi-qubit states. This is due to the protocol's unabating perseverance to find the states's diagonal bases and more systematic handling of enduring problems in popular PF methods relating to the subjectivity of informative priors and the invalidity of particles produced by resamplers. Numerical examples and implementation on IBM quantum devices demonstrate improved performance for arbitrary quantum states and the application readiness of our proposed scheme.
Open AccessAdaptive quantum state tomography with iterative particle filtering
Several Bayesian estimation based heuristics have been developed to perform quantum state tomography (QST). Their ability to quantify uncertainties using region estimators and include a priori knowledge of the experimentalists makes this family of methods an attractive choice for QST. However, specialized techniques for pure states do not work well for mixed states and vice versa. In this paper, we present an adaptive particle filter (PF) based QST protocol which improves the scaling of fidelity compared to nonadaptive Bayesian schemes for arbitrary multi-qubit states. This is due to the protocol's unabating perseverance to find the states's diagonal bases and more systematic handling of enduring problems in popular PF methods relating to the subjectivity of informative priors and the invalidity of particles produced by resamplers. Numerical examples and implementation on IBM quantum devices demonstrate improved performance for arbitrary quantum states and the application readiness of our proposed scheme.
- 23 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 38 (3) , 413-426
Discrete Weyl Channels With Markovian Memory
- 23 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 38 (3) , 413-426
Discrete Weyl Channels With Markovian Memory
- Open Access
- 1 March 2019
- Published by Springer Nature in Scientific Reports
- Vol. 9 (1) , 1-8
Tightening Monogamy and Polygamy Inequalities of Multiqubit Entanglement
Monogamy and polygamy relations of quantum entanglement characterize the sharing and distribution of entanglement in a multipartite system. Multiqubit entanglement can be characterized entirely with bipartite combinations by saturating the monogamy and polygamy inequalities. In this paper, we tighten monogamy and polygamy constraints for the squared convex-roof extended negativity and its dual measure by employing a genetic algorithm. This evolutionary algorithm optimizes inequality residual functions to improve the monogamy and polygamy relations of these entanglement measures.
- 1 March 2019
- Published by Springer Nature in Scientific Reports
- Vol. 9 (1) , 1-8
Open AccessTightening Monogamy and Polygamy Inequalities of Multiqubit Entanglement
Monogamy and polygamy relations of quantum entanglement characterize the sharing and distribution of entanglement in a multipartite system. Multiqubit entanglement can be characterized entirely with bipartite combinations by saturating the monogamy and polygamy inequalities. In this paper, we tighten monogamy and polygamy constraints for the squared convex-roof extended negativity and its dual measure by employing a genetic algorithm. This evolutionary algorithm optimizes inequality residual functions to improve the monogamy and polygamy relations of these entanglement measures.