ÖSÖzlem Salehi

Özlem Salehi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Özlem Salehi has a total of 30 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Kuantum Yaklaşık Optimizasyon Algoritması İçin Hamilton İşlemcisi İnşası Yöntemlerinin Karşılaştırmalı Analizi

    by Saba Arife Bozpolat, Özlem Salehi Köken

    Kuantum hesaplama, karmaşık optimizasyon problemlerini çözmede devrim niteliğinde bir potansiyele sahiptir. Kuantum yaklaşık optimizasyon algoritması (QAOA), bu alandaki en önemli yöntemlerden biridir. Çalışma özellikle iki parçalı ağırlıklı graf eşleştirme problemine odaklanmaktadır. İlk yaklaşım, kısıtların ihlal edilmesi durumunda amaç fonksiyonunu artıran ceza yöntemini kullanmaktadır. İlk yaklaşım, kısıtlar ihlal edildiğinde amaç fonksiyonunu artıran ceza yöntemini kullanmaktadır. İkinci yaklaşım ise, kısıtları doğrudan Boolean fonksiyonları olarak ifade ederek Hamilton işlemcisi oluşturan Hadfield’ın Boolean temsiline dayanmaktadır. Elde edilen sonuçlar, Hadfield’ın Boolean temsili kullanılarak inşa edilen Hamilton işlemcisinin optimal sonuca ulaşma açısından daha etkili bir performans sergilediğini göstermektedir. Bu bulgu, kısıtlı kombinatorik optimizasyon problemlerinde Hadfield’ın Boolean temsil yönteminin potansiyelini vurgulamaktadır.

  • Open Access

    Fixed interval scheduling problem with minimal idle time with an application to music arrangement problem

    by Ludmila Botelho, Özlem Salehi

    The Operational Fixed Interval Scheduling Problem aims to find an assignment of jobs to machines that maximizes the total weight of the completed jobs. We introduce a new variant of the problem where we consider the additional goal of minimizing the idle time, the total duration during which the machines are idle. The problem is expressed using quadratic unconstrained binary optimization (QUBO) formulation, taking into account soft and hard constraints required to ensure that the number of jobs running at a time point is desirably equal to the number of machines. Our choice of QUBO representation is motivated by the increasing popularity of new computational architectures such as neuromorphic processors, coherent Ising machines, and quantum and quantum-inspired digital annealers for which QUBO is a natural input. An optimization problem that can be solved using the presented QUBO formulation is the music reduction problem, the process of reducing a given music piece for a smaller number of instruments. We use two music compositions to test the QUBO formulation and compare the performance of simulated, quantum, and hybrid annealing algorithms.

  • Open Access

    Integer Factorization through Func-QAOA

    by Mostafa Atallah, Haemanth Velmurugan, Rohan Sharma, Siddhant Midha, Shamim Al Mamun, Ludmila Botelho, Adam Glos, Özlem Salehi

    Integer factorization is a significant problem, with implications for the security of widely-used cryptographic schemes. No efficient classical algorithm for polynomial-time integer factorization has been found despite extensive research. Although Peter Shor's breakthrough quantum algorithm offers a viable solution, current limitations of noisy intermediate-scale quantum (NISQ) computers hinder its practical implementation. To address this, researchers have explored alternative methods for factorization suitable for NISQ devices. One such method is the Quantum Approximate Optimization Algorithm, which treats factoring as an optimization problem defined over binary bits, resulting in various problematic aspects. In this paper, we explore the Func-QAOA approach for factorization, which premises overcoming some of the limitations of previous approaches and allows the incorporation of more advanced factorization techniques. After reviewing the most promising quantum implementations for integer arithmetics, we present a few illustrative examples to demonstrate the efficacy of the Func-QAOA approach and discuss methods to reduce the search space to speed up the optimization process.

  • Open Access

    Optimizing the Production of Test Vehicles Using Hybrid Constrained Quantum Annealing

    by Adam Glos, Akash Kundu, Özlem Salehi

    Optimization of pre-production vehicle configurations is one of the challenges in the automotive industry. Given a list of tests requiring cars with certain features, it is desirable to find the minimum number of cars that cover the tests and obey the configuration rules. In this paper, we model the problem in the framework of satisfiability and solve it utilizing the newly introduced hybrid constrained quadratic model (CQM) solver provided by D-Wave. The problem definition is based on the “Optimizing the Production of Test Vehicles” use-case given in the BMW quantum computing challenge. We formulate a constrained quadratic model for the problem and use a greedy algorithm to configure the cars. We benchmark the results obtained from the CQM solver with the results from the classical solvers like coin-or branch and cut and Gurobi solver. We conclude that the performance of the CQM solver is comparable to the classical solvers in optimizing the number of test vehicles, given the noise-prone quantum hardware. However, the CQM solver takes much more time, which prohibits obtaining useful quantum advantages. As an extension to the problem, we describe how the scheduling of the tests can be incorporated into the model.


  • Open Access

    Cost-efficient QFA Algorithm for Quantum Computers

    by Özlem Salehi, Abuzer Yakaryılmaz

    The study of quantum finite automata (QFAs) is one of the possible approaches in exploring quantum computers with finite memory. Despite being one of the most restricted models, Moore-Crutchfield quantum finite automaton (MCQFA) is proven to be exponentially more succinct than classical finite automata models in recognizing certain languages such as $\mathtt{MOD}_p = \{ a^{j} \mid j \equiv 0 \mod p\}$, where $p$ is a prime number. In this paper, we present a modified MCQFA algorithm for the language $\mathtt{MOD}_p$, the operators of which are selected based on the basis gates on the available real quantum computers. As a consequence, we obtain shorter quantum programs using fewer basis gates compared to the implementation of the original algorithm given in the literature.


  • Applications of Quantum Annealing to Music Theory

    by Ashish Arya, Ludmila Botelho, Fabiola Cañete, Dhruvi Kapadia, Özlem Salehi


  • Open Access

    Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing

    by Krzysztof Domino, Akash Kundu, Özlem Salehi, Krzysztof Krawiec

    As consequences of disruptions in railway traffic affect passenger experience and satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are known to be NP-hard, given the numerous restrictions of traffic nature. With the recent advances in quantum technologies, quantum annealing has become an alternative method to solve such optimization problems. To use quantum annealing, the problem needs to be encoded in quadratic unconstrained binary optimization (QUBO) or higher-order binary optimization (HOBO) formulation that can be recast as a QUBO. This paper introduces QUBO and HOBO representations for rescheduling problems of railway traffic management; the latter is a new approach up to our knowledge. This new approach takes into account not only the single-track lines but also the double- and multi-track lines, as well as stations composed of tracks and switches. We consider the conditions of minimal headway between trains, minimal stay on stations, track occupation, and rolling stock circulation. Furthermore, a hybrid quantum-classical procedure is presented that includes rerouting. We demonstrate the proof of concept implementation on the D-Wave Quantum Processing Unit and D-Wave hybrid solver.


  • Open Access

    Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing

    by Krzysztof Domino, Akash Kundu, Özlem Salehi, Krzysztof Krawiec

    As consequences of disruptions in railway traffic affect passenger experience/satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are known to be NP-hard, given the numerous restrictions of traffic nature. With the recent advances in quantum technologies, quantum annealing has become an alternative method to solve such optimization problems. To use quantum annealing, the problem needs to be encoded in QUBO (quadratic unconstrained binary optimization) or HOBO (higher-order binary optimization) formulation that can be recast as a QUBO. This paper introduces QUBO and HOBO representations for rescheduling problems of railway traffic management; the latter is a new approach up to our knowledge. This new approach takes into account not only the single-track lines but also the double- and multi-track lines, as well as stations composed of tracks and switches. We consider the conditions of minimal headway between trains, minimal stay on stations, track occupation, and rolling stock circulation. Furthermore, a hybrid quantum-classical procedure is presented that includes rerouting. We demonstrate the proof of concept implementation on the D-Wave Quantum Processing Unit and D-Wave hybrid solver.

  • Open Access

    Unconstrained binary models of the travelling salesman problem variants for quantum optimization

    by Özlem Salehi, Adam Glos, Jarosław Adam Miszczak

    Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of quantum devices. In this work, we provide a detailed analysis of the travelling salesman problem with time windows (TSPTW) in the context of solving it on a quantum computer. We introduce quadratic unconstrained binary optimization and higher-order binary optimization formulations of this problem. We demonstrate the advantages of edge-based and node-based formulations of the TSPTW problem. Additionally, we investigate the experimental realization of the presented methods on a quantum annealing device. The provided results pave the path for utilizing quantum computer for a variety of real-world tasks which can be cast in the form of travelling salesman problem with time windows.