Bilgisayar Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1940
Browse
Search Results
Conference Object Citation - Scopus: 4Ssqem: Semi-Supervised Quantum Error Mitigation(IEEE, 2022-09-14) Sayar, Alperen; Arslan Suayb S.; Çakar Tuna; Arslan, Suayb S.; Cakar, TunaOne of the fundamental obstacles for quantum computation (especially in noisy intermediate-scale quantum (NISQ) era) to be a near-term reality is the manufacturing gate/measurement technologies that make the system state quite fragile due to decoherence. As the world we live in is quite far away from the ideal, complex particle-level material imperfections due to interactions with the environment are an inevitable part of the computation process. Hence keeping the accurate state of the particles involved in the computation becomes almost impossible. In this study, we posit that any physical quantum computer sys-tem manifests more multiple error source processes as the number of qubits as well as depth of the circuit increase. Accordingly, we propose a semi-supervised quantum error mitigation technique consisting of two separate stages each based on an unsupervised and a supervised machine learning model, respectively. The proposed scheme initially learns the error types/processes and then compensates the error due to data processing and the projective measurement all in the computational basis. © 2022 IEEE.Conference Object Citation - Scopus: 1Improved Bounds on the Moments of Guessing Cost(IEEE, 2022-06-26) Arslan, Suayb S.; Haytaoglu, ElifGuessing a random variable with finite or countably infinite support in which each selection leads to a positive cost value has recently been studied within the context of "guessing cost". In those studies, similar to standard guesswork, upper and lower bounds for the rho-th moment of guessing cost are described in terms of the known measure Renyi's entropy. In this study, we non-trivially improve the known bounds using previous techniques along with new notions such as balancing cost. We have demonstrated that the novel lower bound proposed in this work, achieves 5.84%, 18.47% higher values than that of the known lower bound for rho = 1 and rho = 5, respectively. As for the upper bound, the novel expression provides 10.93%, 5.54% lower values than that of the previously presented bounds for rho = 1 and rho = 5, respectively.Conference Object Citation - WoS: 2Citation - Scopus: 2Base Station-Assisted Cooperative Network Coding for Cellular Systems With Link Constraints(IEEE, 2022-06-26) Arslan, Suayb S.; Pourmandi, Massoud; Haytaoglu, ElifWe consider a novel distributed data storage/caching scenario in a cellular network, where multiple nodes may fail/depart simultaneously To meet reliability, we allow cooperative regeneration of lost nodes with the help of base stations allocated in a set of hierarchical layers1. Due to this layered structure, a symbol download from each base station has a different cost, while the link capacities between the nodes of the cellular system and the base stations are also constrained. Under such a setting, we formulate the fundamental trade-off with closed form expressions between repair bandwidth cost and the storage space per node. Particularly, the minimum storage as well as bandwidth cost points are formulated. Finally, we provide an explicit optimal code construction for the minimum storage regeneration point for a special set of system parameters.