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

Layout Optimization in Quantum Circuit using Simulated Annealing

Published Feb 13, 2014• 0 citations
Publisher
DOI
10.15242/iie.e0214516

Related papers

QNSA: Quantum Neural Simulated Annealing for Combinatorial Optimization

Seongbin Kwon, Dohun Kim, Sunghye Park +2 more

In the field of combinatorial optimization (CO), quantum computing is increasingly recognized for its potential to provide groundbreaking solutions. However, embedding the problems into quantum circuits presents significant challenges due to the complexities of scaling to large dimensions and the constraints in qubit count and circuit depth.In this paper, we introduce a quantum neural simulated annealing (QNSA) framework, combining both simulated annealing (SA) in the classical domain and quantum neural networks (QNNs) in the quantum domain to address the computational challenges for large-scale problems. By employing an SA algorithm, we can explore the vast combination space of optimization problems. In addition, by incorporating QNNs with proposed adaptive embedding and observable, our approach extends beyond the standalone capabilities of quantum computing, leveraging the unique strengths of both quantum and classical computing paradigms. Our experimental results show that the QNSA framework significantly outperforms traditional classical computing methods, showcasing its potential for efficient problem-solving in complex scenarios.

International Symposium on Quality Electronic Design (ISQED)•Apr 3, 2024•3 citations

Optimization algorithms for Quantum Annealing

E. Arvidsson

•Jan 1, 2020•0 citations

Quantum circuit design for objective function maximization in gate-model quantum computers

László Gyöngyösi, Sándor Imre

Gate-model quantum computers provide an experimentally implementable architecture for near-term quantum computations. To design a reduced quantum circuit that can simulate a high-complexity reference quantum circuit, an optimization should be taken on the number of input quantum states, on the unitary operations of the quantum circuit, and on the number of output measurement rounds. Besides the optimization of the physical layout of the hardware layer, the quantum computer should also solve difficult computational problems very efficiently. To yield a desired output system, a particular objective function associated with the computational problem fed into the quantum computer should be maximized. The reduced gate structure should be able to produce the maximized value of the objective function. These parallel requirements must be satisfied simultaneously, which makes the optimization difficult. Here, we demonstrate a method for designing quantum circuits for gate-model quantum computers and define the Quantum Triple Annealing Minimization (QTAM) algorithm. The aim of QTAM is to determine an optimal reduced topology for the quantum circuits in the hardware layer at the maximization of the objective function of an arbitrary computational problem.

arXiv:1803.02460•Quantum Information Processing•May 30, 2019•37 citations

Optimized Quantum Circuit Partitioning

Omid Daei, Keivan Navi, Mariam Zomorodi Moghadam

arXiv:2005.11614•International Journal of Theoretical Physics•Nov 6, 2020•87 citations

An Efficient Quantum Circuit Design: Properties and Optimization Techniques

Mamtha Prajapati, Kalyan Babu Killana

Smart innovation, systems and technologies•Oct 17, 2024•4 citations

Joint Black-Box Optimization of Warehouse Layout and Worker Assignment Using Quantum Annealing and Factorization Machines

Kairi Takaki, Yusuke Asai, Shin Katayama +3 more

As global demand for logistics continues to grow, improving the efficiency of warehouse operations has become increasingly important. While many processes in logistics warehouses have been automated, the receiving area still relies heavily on manual work. Therefore, optimizing this area is essential. When optimizing operations in a logistics warehouse, various problems must be considered, such as layout design and worker assignment. Previous research has typically focused on these problems individually. However, because they are closely related, jointly optimizing them can further improve overall efficiency. In this study, we focus on the receiving area and conduct joint optimization of layout design and worker assignment. Specifically, we extend and apply a black-box optimization method called FMQA, which combines Factorization Machines (FM) with Quantum Annealing (QA). By using Factorization Machine regression, we build an objective function from simulator data. We then use Quantum Annealing to minimize it and improve the receiving area. A comparison with an actual warehouse environment, using the multi-agent simulator, shows that our approach can reduce mean package processing time by up to 22.1%. This result demonstrates the effectiveness of joint optimization of layout design and worker assignment.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 5, 2025•1 citation
In the field of combinatorial optimization (CO), quantum computing is increasingly recognized for its potential to provide groundbreaking solutions. However, embedding the problems into quantum circuits presents significant challenges due to the complexities of scaling to large dimensions and the constraints in qubit count and circuit depth.In this paper, we introduce a quantum neural simulated annealing (QNSA) framework, combining both simulated annealing (SA) in the classical domain and quantum neural networks (QNNs) in the quantum domain to address the computational challenges for large-scale problems. By employing an SA algorithm, we can explore the vast combination space of optimization problems. In addition, by incorporating QNNs with proposed adaptive embedding and observable, our approach extends beyond the standalone capabilities of quantum computing, leveraging the unique strengths of both quantum and classical computing paradigms. Our experimental results show that the QNSA framework significantly outperforms traditional classical computing methods, showcasing its potential for efficient problem-solving in complex scenarios.
Gate-model quantum computers provide an experimentally implementable architecture for near-term quantum computations. To design a reduced quantum circuit that can simulate a high-complexity reference quantum circuit, an optimization should be taken on the number of input quantum states, on the unitary operations of the quantum circuit, and on the number of output measurement rounds. Besides the optimization of the physical layout of the hardware layer, the quantum computer should also solve difficult computational problems very efficiently. To yield a desired output system, a particular objective function associated with the computational problem fed into the quantum computer should be maximized. The reduced gate structure should be able to produce the maximized value of the objective function. These parallel requirements must be satisfied simultaneously, which makes the optimization difficult. Here, we demonstrate a method for designing quantum circuits for gate-model quantum computers and define the Quantum Triple Annealing Minimization (QTAM) algorithm. The aim of QTAM is to determine an optimal reduced topology for the quantum circuits in the hardware layer at the maximization of the objective function of an arbitrary computational problem.
As global demand for logistics continues to grow, improving the efficiency of warehouse operations has become increasingly important. While many processes in logistics warehouses have been automated, the receiving area still relies heavily on manual work. Therefore, optimizing this area is essential. When optimizing operations in a logistics warehouse, various problems must be considered, such as layout design and worker assignment. Previous research has typically focused on these problems individually. However, because they are closely related, jointly optimizing them can further improve overall efficiency. In this study, we focus on the receiving area and conduct joint optimization of layout design and worker assignment. Specifically, we extend and apply a black-box optimization method called FMQA, which combines Factorization Machines (FM) with Quantum Annealing (QA). By using Factorization Machine regression, we build an objective function from simulator data. We then use Quantum Annealing to minimize it and improve the receiving area. A comparison with an actual warehouse environment, using the multi-agent simulator, shows that our approach can reduce mean package processing time by up to 22.1%. This result demonstrates the effectiveness of joint optimization of layout design and worker assignment.