Results 61 to 70 of about 4,386 (222)

A Resource Efficient Ising Model‐Based Quantum Sudoku Solver

Software: Practice and Experience, EarlyView.
ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang, Mei‐Huei Tang, Kevin Wang, Muhammad Abdul Basit, Yuan Tian, Md. Sanaul Haque   +5 more
wiley   +1 more source

Multistart Methods for Quantum Approximate Optimization

, 2019
Hybrid quantum-classical algorithms such as the quantum approximate optimization algorithm (QAOA) are considered one of the most promising approaches for leveraging near-term quantum computers for practical applications.
Larson, Jeffrey, Safro, Ilya, Shaydulin, Ruslan   +2 more
core   +1 more source

Qubit‐Efficient Quantum Local Search for Combinatorial Optimization

Advanced Quantum Technologies, Volume 9, Issue 3, March 2026.
We introduce a qubit‐efficient variational quantum algorithm for combinatorial optimization that adaptively uses from logarithmic to a linear number of qubits to implement quantum local search. The method encodes flip probabilities of spin groups into quantum amplitudes, enabling exploration of classically intractable neighborhoods while maintaining ...
Mikhail Podobrii, Viacheslav Kuzmin, Vladimir Voloshinov, Margarita Veshchezerova, Michael R. Perelshtein   +4 more
wiley   +1 more source

Improved Qubit Routing for QAOA Circuits

, 2023
We develop a qubit routing algorithm with polynomial classical run time for the Quantum Approximate Optimization Algorithm (QAOA). The algorithm follows a two step process. First, it obtains a near-optimal solution, based on Vizing's theorem for the edge coloring problem, consisting of subsets of the interaction gates that can be executed in parallel ...
Kotil, Ayse, Simkovic, Fedor, Leib, Martin   +2 more
openaire   +2 more sources

Addressing ecological challenges from a quantum computing perspective

Methods in Ecology and Evolution, Volume 17, Issue 3, Page 632-649, March 2026.
Abstract With increased access to data and the advent of computers, the use of statistical tools and numerical simulations is becoming commonplace for ecologists. These approaches help improve our understanding of ecological phenomena and their underlying mechanisms in increasingly complex environments.
Maxime Clenet, Maxime Dion, F. Guillaume Blanchet   +2 more
wiley   +1 more source

Quantifying the impact of precision errors on quantum approximate optimization algorithms

Physical Review Research
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution.
Gregory Quiroz, Paraj Titum, Phillip Lotshaw, Pavel Lougovski, Kevin Schultz, Eugene Dumitrescu, Itay Hen   +6 more
doaj   +1 more source

Synchrotron Radiation for Quantum Technology

Advanced Functional Materials, Volume 36, Issue 15, 19 February 2026.
Materials and interfaces underpin quantum technologies, with synchrotron and FEL methods key to understanding and optimizing them. Advances span superconducting and semiconducting qubits, 2D materials, and topological systems, where strain, defects, and interfaces govern performance.
Oliver Rader, Sakura Pascarelli, Klaus Attenkofer, Anna A. Makarova, Karsten Holldack, Kai Rossnagel, Kristiaan Temst, George Kourousias, Stefano Carretta, Caterina Biscari, Helmut Dosch   +10 more
wiley   +1 more source

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm

npj Quantum Information, 2023
We compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers Gurobi and MQLib to solve the MaxCut problem on 3-regular graphs. We identify the minimum noiseless sampling frequency and depth p
Danylo Lykov, Jonathan Wurtz, Cody Poole, Mark Saffman, Tom Noel, Yuri Alexeev   +5 more
doaj   +1 more source

A Quantum Framework for Protein Binding‐Site Structure Prediction on Utility‐Level Quantum Processors

Advanced Science, Volume 13, Issue 12, 27 February 2026.
This study presents a hybrid quantum‐classical framework for accurate prediction of protein structures on utility‐level quantum processors. We evaluate the practical application of the Variational Quantum Eigen‐solver (VQE) in protein structure prediction and demonstrate its superiority over state‐of‐the‐art deep learning methods in molecular docking ...
Yuqi Zhang, Yuxin Yang, William Martin, Kingsten Lin, Zixu Wang, Cheng‐Chang Lu, Weiwen Jiang, Ruth Nussinov, Joseph Loscalzo, Qiang Guan, Feixiong Cheng   +10 more
wiley   +1 more source

Short-depth QAOA circuits and quantum annealing on higher-order ising models

npj Quantum Information
We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances.
Elijah Pelofske, Andreas Bärtschi, Stephan Eidenbenz   +2 more
doaj   +1 more source