Results 71 to 80 of about 605 (179)
Quantum approximate optimization algorithms for maximum cut on low-girth graphs
Maximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the quantum approximate optimization algorithm (QAOA) for solving the MaxCut problem.
Tongyang Li +3 more
doaj +1 more source
Synchrotron Radiation for Quantum Technology
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 +10 more
wiley +1 more source
Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm [PDF]
We consider the maximum cut and maximum independent set problems on random regular graphs in the infinite-size limit, and calculate the energy densities achieved by QAOA for high degrees up to $d=100$.
Elisabeth Wybo, Martin Leib
doaj +1 more source
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 +10 more
wiley +1 more source
Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs
We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5 ...
Elijah Pelofske +4 more
doaj +1 more source
Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source
Enhancing Distributed State Estimation of Power Grid With a Simplified Quantum Algorithm
This paper presents the application of the Harrow‐Hassidim‐Lloyd (HHL) algorithm and its simplified quantum circuit to distributed state estimation in power grids. The results show that the proposed approach successfully tackles distributed state estimation in a power grid, underscoring its potential as a practical quantum computing solution for this ...
Shyh‐Jier Huang +3 more
wiley +1 more source
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
One of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses of the complexity of standard quantum algorithms have suggested that outperforming classical ...
Sami Boulebnane, Ashley Montanaro
doaj +1 more source
Quantum computing is one of the research areas progressing rapidly toward practical deployment, yet the engineering of scalable and reliable quantum software remains underdeveloped. Current quantum software engineering (QSE) practices are largely tools‐driven and ad hoc that providing limited support for managing probabilistic execution, hybrid quantum–
Hessa Alfraihi +7 more
wiley +1 more source
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs [PDF]
Current state-of-the-art quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device.
Bence Bakó +3 more
doaj +1 more source

