Suchergebnisse - "quantum approximate optimization algorithm"

A review on Quantum Approximate Optimization Algorithm and its variants von Blekos, Kostas, Brand, Dean, Ceschini, Andrea, Chou, Chiao-Hui, Li, Rui-Hao, Pandya, Komal, Summer, Alessandro

“… The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve combinatorial optimization …”
Volltext

Modified recursive QAOA for exact MAX-CUT solutions on bipartite graphs: closing the gap beyond QAOA limit von Bae, Eunok, Kwon, Hyukjoon, Vijendran, V, Lee, Soojoon

“… Quantum approximate optimization algorithm (QAOA) is a quantum–classical hybrid algorithm proposed with the goal of approximately solving combinatorial …”
Volltext

Large-scale Quantum Approximate Optimization via Divide-and-Conquer von Li, Junde, Alam, Mahabubul, Ghosh, Swaroop

“… Quantum Approximate Optimization Algorithm (QAOA) is a promising hybrid quantum-classical algorithm for solving combinatorial optimization problems. However, …”
Volltext

Genetic algorithms as classical optimizer for the Quantum Approximate Optimization Algorithm von Acampora, Giovanni, Chiatto, Angela, Vitiello, Autilia

“… Optimization is one of the research areas where quantum computing could bring significant benefits. In this scenario, a hybrid quantum–classical variational …”
Volltext

Novel Resolution of Unit Commitment Problems Through Quantum Surrogate Lagrangian Relaxation von Feng, Fei, Zhang, Peng, Bragin, Mikhail A., Zhou, Yifan

“… Unit commitment (UC) problems faced by Independent System Operators on a daily basis are becoming increasingly complex due to the recent push for renewables …”
Volltext

A study of the performance of classical minimizers in the Quantum Approximate Optimization Algorithm von Fernández-Pendás, Mario, Combarro, Elías F., Vallecorsa, Sofia, Ranilla, José, Rúa, Ignacio F.

“… The Quantum Approximate Optimization Algorithm (QAOA) was proposed as a way of finding good, approximate solutions to hard combinatorial optimization problems …”
Volltext

Applying the quantum approximate optimization algorithm to the minimum vertex cover problem von Zhang, Y.J., Mu, X.D., Liu, X.W., Wang, X.Y., Zhang, X., Li, K., Wu, T.Y., Zhao, D., Dong, C.

“… The minimum vertex cover problem belongs to a NP- complete problem, which is difficult to obtain the near-optimal solution in the polynomial time range using …”
Volltext

Application of quantum approximate optimization algorithm to job shop scheduling problem von Kurowski, Krzysztof, Pecyna, Tomasz, Slysz, Mateusz, Różycki, Rafał, Waligóra, Grzegorz, Wȩglarz, Jan

“… •Demonstrate how to efficiently apply Quantum Approximate Optimization Algorithm (QAOA) to Job Shop Scheduling Problem (JSSP).•Investigation of the behaviour …”
Volltext

Exploiting Symmetry Reduces the Cost of Training QAOA von Shaydulin, Ruslan, Wild, Stefan M.

“… A promising approach to the practical application of the quantum approximate optimization algorithm (QAOA) is finding QAOA parameters classically in simulation …”
Volltext

Quantum computing and quantum-inspired techniques for feature subset selection: a review von Mandal, Ashis Kumar, Chakraborty, Basabi

Volltext

Rapidly trainable and shallow-compiled quantum approximate optimization algorithm for maximum likelihood detection von Liu, Yuxiang, Qian, Yinuo, Wang, Lu, Zhang, Zaichen, Yu, Xutao

“… In multiple-input and multiple-output (MIMO) systems, the maximum likelihood (ML) detection problem is NP-hard and becomes increasingly complex with more …”
Volltext

Equivariant Quantum Approximate Optimization Algorithm von Tsvelikhovskiy, Boris, Safro, Ilya, Alexeev, Yuri

“… Constructing effective mixer Hamiltonians is essential for enhancing the performance of the quantum approximate optimization algorithm (QAOA) in solving …”
Volltext

Theoretical approximation ratios for Warm-Started QAOA on 3-regular max-cut instances at depth p=1 von Tate, Reuben, Eidenbenz, Stephan

“… We generalize Farhi et al.’s 0.6924-approximation result technique of the Max-Cut Quantum Approximate Optimization Algorithm (QAOA) on 3-regular graphs to …”
Volltext

Classical symmetries and the Quantum Approximate Optimization Algorithm von Shaydulin, Ruslan, Hadfield, Stuart, Hogg, Tad, Safro, Ilya

“… We study the relationship between the Quantum Approximate Optimization Algorithm (QAOA) and the underlying symmetries of the objective function to be …”
Volltext

Max-flow min-cut theorem in quantum computing von Singh, Nongmeikapam Brajabidhu, Roy, Arnab, Saha, Anish Kumar

“… The max-flow min-cut theorem in graph theory states that the maximum flow of a network is equal to the minimum cut of edges of the flow network. Max-flow and …”
Volltext

Quantum Approximate Optimization Algorithm applied to multi-objective routing for large scale 6G networks von Bouchmal, Oumayma, Cimoli, Bruno, Stabile, Ripalta, Vegas Olmos, Juan Jose, Tafur Monroy, Idelfonso

“… A multi-objective optimization problem involves optimizing two or more conflicting objectives simultaneously. This type of problem arises in many scientific …”
Volltext

Improved Performance of Multi-Angle Quantum Approximate Optimization Algorithm (ma-QAOA) Compared to QAOA On Simulation and Experimental Hardware Platforms von Srivastava, Vandit, P, Rohith, Singhal, Sanyam, Bhowmik, Debanjan

“… Multi-angle quantum approximate optimization algorithm (ma-QAOA) has been proposed as an alternative to regular QAOA for solving optimization problems using …”
Volltext

Advances in Quantum Computing

“… The field of quantum information science has seen tremendous progress over the last several years, with advances in both hardware development and novel …”
Volltext

Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry von Sun, Zheng-Hang, Wang, Yong-Yi, Cui, Jian, Fan, Heng

“… The variational preparation of complex quantum states using the quantum approximate optimization algorithm (QAOA) is of fundamental interest, and becomes a …”
Volltext

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem von Qian, Wenyang, Basili, Robert A. M., Eshaghian-Wilner, Mary Mehrnoosh, Khokhar, Ashfaq, Luecke, Glenn, Vary, James P.

“… The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and …”
Volltext