Gülbahar, Burhan
Loading...
Name Variants
Job Title
Doç.Dr.
Email Address
Main Affiliation
01.01.09.02. Elektrik- Elektronik Mühendisliği
Status
Current Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Sustainable Development Goals
SDG data is not available
Documents
31
Citations
356
h-index
9
Documents
27
Citations
262
Scholarly Output
6
Articles
5
Views / Downloads
0/0
Supervised MSc Theses
1
Supervised PhD Theses
0
WoS Citation Count
17
Scopus Citation Count
17
Patents
0
Projects
1
WoS Citations per Publication
2.83
Scopus Citations per Publication
2.83
Open Access Source
1
Supervised Theses
1
| Journal | Count |
|---|---|
| IEEE Transactions on Wireless Communications | 2 |
| IEEE Access | 1 |
| Quantum Information Processing | 1 |
| Quantum Science and Technology | 1 |
Current Page: 1 / 1
Scopus Quartile Distribution
Quartile distribution chart data is not available
Competency Cloud
6 results
Scholarly Output Search Results
Now showing 1 - 6 of 6
Article Encrypted quantum state tomography with phase estimation for quantum Internet(SPRINGER, 2023) Burhan Gulbahar; Gulbahar, BurhanQuantum state tomography (QST) is a fundamental tool requiring privacy in future distributed systems where unknown states are measured for extracting information. Gentle measurement and differential privacy (DP)-based privacy solutions minimize the damage on unknown state and leakage about the quantum information respectively. In this article we propose a fundamentally different design for privacy-preserving QST in a multi-party setting. We assume that Alice delegates QST task of a distant source for which she has no access to a third-party player Bob accessing to the source while preserving the source privacy against the operations realized by Bob. Encrypted QST algorithm is proposed which encodes or maps source computational basis states by exploiting phase estimation and feature mapping concept of quantum machine learning (QML). Bob maps basis states to eigenvalues of a specially designed unitary operator in an entangled manner with his ancillary qubits while teleporting the source qubits back to Alice before applying conventional QST. Encoding mechanism is conjectured as having NP-hard decoding complexity based on difficulty of subset-sum problem combined with Hadamard transform. Linear optical design and quantum circuit implementations are presented for future experiments in noisy intermediate-scale quantum (NISQ) devices. Theoretical and numerical supporting evidences are proposed supporting the proposed eigenstructure. EQST promises further applications for multiple source classification tasks and as a novel feature mapping method for future data embedding tasks in QML.Article Citation - WoS: 5Citation - Scopus: 6Majority Voting With Recursive QAOA and Cost-Restricted Uniform Sampling for Maximum-Likelihood Detection in Massive MIMO(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2025) Burhan Gulbahar; Gülbahar, BurhanQuantum approximate optimization algorithm (QAOA) with layer depth p is promising near-optimum performance and low complexity for NP-hard maximum-likelihood (ML) detection in nxn multi-input multi-output (MIMO) systems. Experimental challenges for ML detection on Noisy Intermediate-Scale Quantum (NISQ) computers arise from accumulated errors with large p and n. Recursive QAOA (RQAOA) is promising with small p by reducing complexity over n steps. In this article we modify RQAOA for p << n with cost sorting and post-selection in m << n steps and then integrate it with majority voting (MV) and successive interference cancellation (SIC) into the QAOA-MVSIC algorithm to tackle experimental challenges. We truncate QAOA circuits to further improve experimental feasibility. Simulations with n=24 and 12 for BPSK and QPSK modulations respectively show near-optimum bit-error rate (BER) with p=1 and m <= 4 . Truncated version requires O(mnp) quantum and O(mn2) classical operations with low complexity. We experimentally implement QAOA combined with MV (QAOA-MV) for n is an element of[1764] in IBM Eagle processor by observing superior performance of QAOA-MV over QAOA and reducing problem dimensions by at least n/4 . We generalize QAOA as cost-restricted uniform sampling (CRUS) oracle and approximately simulate for n <= 128 to obtain comparison benchmark for future QAOA experiments.Master Thesis Aşırı az örneklemede ikili sinyal kurtarma: Çoğunluk oylaması ve ardışık girişim iptali ile birlikte SDP(2025) Abay, Ece; Gülbahar, Burhanİkili Seyrek Algılama (BCS), n uzunluğundaki k-seyrek bir ikili vektörün m doğrusal ölçümden (m≪n) kurtarılması problemini ele alır. Aşırı örnekleme eksikliği rejiminde (m<2k), geleneksel seyrek algılama (CS) garantileri geçerliliğini yitirir ve rastgele ölçüm matrisleri kullanan mevcut BCS algoritmaları yetersiz performans sergiler. Bu makale, m≤k durumunda bile güvenilir kurtarma sağlamak için yarı-tanımlı programlama (SDP), çoğunluk oylaması (MV) ve özyinelemeli ardışık girişim iptali (SIC) tekniklerini birleştiren SDP-MVRSIC adlı yeni bir algoritma sunmaktadır. Yöntem, L≪n SIC katmanına sahip özyinelemeli bir ağaç yapısı kullanır. Her düğüm, rastgele SDP örneklemesiyle aday çözümler üretir, bunları MV ile rafine eder ve sonraki SIC aşamaları için dallar oluşturur. C(x ̂ )=‖y-Hx ̂ ‖_2^2 maliyet fonksiyonu, en uygun adayların seçimine rehberlik eder. SDP-MVRSIC, hesaplama karmaşıklığı ve kurtarma doğruluğu arasında ayarlanabilir bir denge sunar. Örneğin, n=128 için karmaşıklığın O(n^3.83 )'ten O(n^5.86 )'ya çıkarılması, seyreklik oranı s=k/n 0.5'ten 0.125'e düştükçe m/k∈[0.6,1.5] aralığında tam kurtarma sağlar. Bu esneklik, algoritmayı aşırı yüklenmiş MIMO sistemleri veya kaynak kısıtlı sensör ağları gibi zorlayıcı ölçüm kısıtlamaları olan uygulamalar için özellikle uygun hale getirir.Article Citation - WoS: 1Citation - Scopus: 1Strong simulation of tracking single photons with which-way-detectors in linear optics(IOP Publishing Ltd, 2023) Burhan Gulbahar; Gulbahar, BurhanWhich-way-detectors (WWDs) are path-entangled detectors characterizing mutual exclusivity between path information and interference visibility in wave-particle duality experiments. We show surprisingly that WWDs allow to utilize single photons distinguishable in time domain to realize linear optical circuits where tracking their paths is exponentially hard for strong simulation analogous to rectangular lattice based Ising models. Distinguishable photons have scalability advantages of generation and detection compared with indistinguishable photons by promising both theoretical and experimental improvements in linear optical computing including boson sampling. We calculate strong simulation complexities by using variable elimination (VE) method for undirected graphs related to tensor network contraction for quantum circuits and recursive Feynman path-integral (RFPI) method to reduce space complexity. Two designs include either a single photon touring m times or m single photons propagating sequentially through an optical circuit composed of n beam splitters and phase shifters entangled with n WWDs. VE method for tracking results in undirected graphs matching with (2m - 1) x (n + 1) and m x (n + 1) lattice Ising models with computational complexities of O(m n 2(min)((2 m - 1) (n + 1))) and O(m n 2(min(m n + 1))) in time and O(2(min(2 m - 1 n + 1))) and O(2(min(m n + 1))) in space for single and multi-photon based designs respectively. We exploit RFPI method for m >> n to reduce space complexities to polynomial levels with respect to n and log m. Probability amplitude of specific cases of multi-photon design is represented in terms of Ising partition function with purely imaginary weights to characterize sampling complexity. Open issues about sampling complexity and experimental implementation of multi-WWD set-ups are discussed.Article Citation - WoS: 10Citation - Scopus: 9Maximum-Likelihood Detection With QAOA for Massive MIMO and Sherrington-Kirkpatrick Model With Local Field at Infinite Size(Institute of Electrical and Electronics Engineers Inc., 2024) Burhan Gulbahar; Gulbahar, BurhanQuantum-approximate optimization algorithm (QAOA) is promising in Noisy Intermediate-Scale Quantum (NISQ) computers with applications for NP-hard combinatorial optimization problems. It is recently utilized for NP-hard maximum-likelihood (ML) detection problem with challenges of optimization simulation and performance analysis for n × n multiple-input multiple output (MIMO) systems with large n. QAOA is recently applied by Farhi et al. on infinite size limit of Sherrington-Kirkpatrick (SK) model with a cost model including only quadratic terms. In this article we extend the model by including also linear terms and then realize SK modeling of massive MIMO ML detection. The proposed design targets near ML performance while with complexity including O 16p initial operations independent from problem instance and size n for optimizing QAOA angles and On2\p quantum operations for each instance. We provide both optimized and extrapolated angles for p ϵ [1 14] and signal-to-noise (SNR) < 12 dB achieving near-optimum ML performance with p ≥ 4 for 25 × 25 and 12 × 12 MIMO systems modulated with BPSK and QPSK respectively. We present two conjectures about concentration properties of QAOA and near-optimum performance for next generation massive MIMO systems covering n < 300. © 2024 Elsevier B.V. All rights reserved.Article Citation - WoS: 1Citation - Scopus: 1Theory and Experiment of Spatial Light Modulation and Demodulation With Multi-Plane Diffraction and Applications(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2023) Burhan Gulbahar; Ahmet Emrecan Oksuz; Oksuz, Ahmet Emrecan; Gulbahar, BurhanSpatial light modulation enhances capacity of optical communications by modulating spatial amplitude phase and polarization degrees of freedom with recent success of orbital angular momentum based architectures. There is a hardware challenge to demodulate large symbol families or high order symbols requiring a general design of spatial light demodulation. Multi-plane diffraction (MPD) recently introduced for improving spatial modulation capabilities in free space optical channels promises utilization at the receiver side as a demodulator. In this article we theoretically model numerically simulate and experimentally implement spatial light demodulation based on MPD. Numerical simulations and experimental implementations verify capabilities of MPD for increasing inter-symbol distances at the detector front-end. We obtain approximately two times improvement compared with direct detection for basic design including three diffraction planes as a proof-of-concept and improved performance with increasing number of diffraction planes compared with state-of-the-art single-plane diffraction (SPD) based interferometric receivers. Besides that we perform for the first time experimental implementation of MPD based spatial light modulation. In addition symmetric-key cryptography application of the proposed system is theoretically presented with low decoder complexity while numerical simulations promise high performance security against intruders. MPD based design is practically applicable and promising for diverse optical architectures including both communications and cryptography as a low-cost low hardware complexity passive and high performance design.
