Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

All-Russian Youth Scientific Conference

PERSPECTIVES OF QUANTUM ALGORITHMS APPLICATION IN ECAD SYSTEMS

K.A. Egortsev, Андрей Борисович Климовский, A.A. Romanov

Published Oct 21, 2024• 0 citations
Publisher

Abstract

The advantages and disadvantages of classical component placement and routing algorithms for second-level electronic modules, the integrated placement and routing problem are considered. The prospects of applying quantum computing to solve the integrated problem are discussed.
DOI
10.61527/appfe-2024.186-187

Related papers

Effectiveness of quantum algorithms on classical computing complexities

Hicham Amellal, Abdelmajid Meslouhi, Abderrahim El Allati

In this paper, we analyze the effectiveness of quantum algorithms to solve some classical computing complexities. In fact, we focus in this study on several famous quantum algorithms, where we discussed their impact on classical computing using in computer science.

International Conference on Smart City Applications (SCA)•Oct 10, 2018•2 citations

APPLICATION OF QUANTUM ALGORITHMS IN OPTIMIZATION OF COGNITIVE DECISION-MAKING SYSTEMS

Noilakhon Sobirjоnovna Yakubova

The article analyzes the potential of quantum algorithms for optimizing cognitive decision-making systems in production processes in the energy sector. Compared with traditional algorithms, quantum algorithms allow high-speed processing of large amounts of variable data in real time and solving multiparameter problems based on an integrated approach. The study considers uncertainties and issues of increasing efficiency in the processes of production and distribution of electricity using a cognitive model. The integration of quantum algorithms into this model allows developing optimal strategies for using resources in production. A heating boiler was taken as a control object, and taking into account its multidimensionality and multi-connectedness, the problem of modeling an intelligent control system using quantum algorithms was solved.

Himičeskaâ tehnologiâ. Kontrolʹ i upravlenie/Chemical Technology. Control and Management•Apr 30, 2025•1 citation

An Overview of Quantum Computing for Technology Managers

Eleanor Gilbert Rieffel

Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum algorithms perform a select set of tasks vastly more efficiently than any classical algorithm, but for many tasks it has been proved that quantum algorithms provide no advantage. The breadth of quantum computing applications is still being explored. Major application areas include security and the many fields that would benefit from efficient quantum simulation. The quantum information processing viewpoint provides insight into classical algorithmic issues as well as a deeper understanding of entanglement and other non-classical aspects of quantum physics. This overview is aimed at technology managers who wish to gain a high level understanding of quantum information processing, particularly quantum computing.

arXiv:0804.2264•Apr 14, 2008•3 citations

HYBRID QUANTUM-CLASSICAL ALGORITHMS IN LOGISTICS OPTIMIZATION PROBLEMS

Tatiana A. Sanaeva, Anna A. Ilmushkina, Osman M. Minaev

The paper considers the application of hybrid quantum-classical algorithms (HQCA) to optimization problems in logistics, such as the vehicle routing problem (VRP), the traveling salesman problem (TSP), as well as their generalizations with time windows and fleet constraints. A multi-level architecture of hybrid computing is presented, including the stages of problem translation into QUBO form, implementation of variational quantum algorithms (QAOA), annealing on quantum systems (e.g., D-Wave Advantage2), as well as methods for error correction and post-processing of solutions. A review of domestic and foreign developments in this area is conducted, including the results of Russian research groups (RKC, MISiS, Innopolis, MIPT). It is experimentally shown that GCQAs provide gains in quality and time for medium-sized tasks (100–1 clients), especially when using warm-start strategies and dynamic load distribution between classical and quantum subsystems. The limitations of current NISQ devices and scaling prospects, including integration with predictive analytics and digital twins of logistics systems, are discussed.

EKONOMIKA I UPRAVLENIE PROBLEMY RESHENIYA•Jan 1, 2025•0 citations

Quantum Annealing-Based Software Components

Tom Krüger, Wolfgang Mauerer

Quantum computers have the potential of solving problems more efficiently than classical computers. While first commercial prototypes have become available, the performance of such machines in practical application is still subject to exploration. Quantum computers will not entirely replace classical machines, but serve as accelerators for specific problems. This necessitates integrating quantum computational primitives into existing applications.

arXiv:2005.05465•Jun 27, 2020•32 citations

An Advanced Hybrid Quantum Tabu Search Approach to Vehicle Routing Problems

James B. Holliday, Eneko Osaba, Khoa Luu

Quantum computing (QC) is expected to solve incredibly difficult problems, including finding optimal solutions to combinatorial optimization problems. However, to date, QC alone is still far to demonstrate this capability except on small-sized problems. Hybrid approaches where QC and classical computing work together have shown the most potential for solving real-world scale problems. This work aims to show that we can enhance a classical optimization algorithm with QC so that it can overcome this limitation. We present a new hybrid quantum-classical tabu search (HQTS) algorithm to solve the capacitated vehicle routing problem (CVRP). Based on our prior work, HQTS leverages QC for routing within a classical tabu search framework. The quantum component formulates the traveling salesman problem (TSP) for each route as a QUBO, solved using D-Wave's Advantage system. Experiments investigate the impact of quantum routing frequency and starting solution methods. While different starting solution methods, including quantum-based and classical heuristics methods, it shows minimal overall impact. HQTS achieved optimal or near-optimal solutions for several CVRP problems, outperforming other hybrid CVRP algorithms and significantly reducing the optimality gap compared to preliminary research. The experimental results demonstrate that more frequent quantum routing improves solution quality and runtime. The findings highlight the potential of integrating QC within meta-heuristic frameworks for complex optimization in vehicle routing problems.

arXiv:2501.12652•Jan 22, 2025•0 citations
The article analyzes the potential of quantum algorithms for optimizing cognitive decision-making systems in production processes in the energy sector. Compared with traditional algorithms, quantum algorithms allow high-speed processing of large amounts of variable data in real time and solving multiparameter problems based on an integrated approach. The study considers uncertainties and issues of increasing efficiency in the processes of production and distribution of electricity using a cognitive model. The integration of quantum algorithms into this model allows developing optimal strategies for using resources in production. A heating boiler was taken as a control object, and taking into account its multidimensionality and multi-connectedness, the problem of modeling an intelligent control system using quantum algorithms was solved.
Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum algorithms perform a select set of tasks vastly more efficiently than any classical algorithm, but for many tasks it has been proved that quantum algorithms provide no advantage. The breadth of quantum computing applications is still being explored. Major application areas include security and the many fields that would benefit from efficient quantum simulation. The quantum information processing viewpoint provides insight into classical algorithmic issues as well as a deeper understanding of entanglement and other non-classical aspects of quantum physics. This overview is aimed at technology managers who wish to gain a high level understanding of quantum information processing, particularly quantum computing.
The paper considers the application of hybrid quantum-classical algorithms (HQCA) to optimization problems in logistics, such as the vehicle routing problem (VRP), the traveling salesman problem (TSP), as well as their generalizations with time windows and fleet constraints. A multi-level architecture of hybrid computing is presented, including the stages of problem translation into QUBO form, implementation of variational quantum algorithms (QAOA), annealing on quantum systems (e.g., D-Wave Advantage2), as well as methods for error correction and post-processing of solutions. A review of domestic and foreign developments in this area is conducted, including the results of Russian research groups (RKC, MISiS, Innopolis, MIPT). It is experimentally shown that GCQAs provide gains in quality and time for medium-sized tasks (100–1 clients), especially when using warm-start strategies and dynamic load distribution between classical and quantum subsystems. The limitations of current NISQ devices and scaling prospects, including integration with predictive analytics and digital twins of logistics systems, are discussed.
Quantum computing (QC) is expected to solve incredibly difficult problems, including finding optimal solutions to combinatorial optimization problems. However, to date, QC alone is still far to demonstrate this capability except on small-sized problems. Hybrid approaches where QC and classical computing work together have shown the most potential for solving real-world scale problems. This work aims to show that we can enhance a classical optimization algorithm with QC so that it can overcome this limitation. We present a new hybrid quantum-classical tabu search (HQTS) algorithm to solve the capacitated vehicle routing problem (CVRP). Based on our prior work, HQTS leverages QC for routing within a classical tabu search framework. The quantum component formulates the traveling salesman problem (TSP) for each route as a QUBO, solved using D-Wave's Advantage system. Experiments investigate the impact of quantum routing frequency and starting solution methods. While different starting solution methods, including quantum-based and classical heuristics methods, it shows minimal overall impact. HQTS achieved optimal or near-optimal solutions for several CVRP problems, outperforming other hybrid CVRP algorithms and significantly reducing the optimality gap compared to preliminary research. The experimental results demonstrate that more frequent quantum routing improves solution quality and runtime. The findings highlight the potential of integrating QC within meta-heuristic frameworks for complex optimization in vehicle routing problems.