Results 61 to 70 of about 548 (174)

Enhancing Distributed State Estimation of Power Grid With a Simplified Quantum Algorithm

IET Generation, Transmission &Distribution, Volume 20, Issue 1, January/December 2026.
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, Po‐Wei Yang, Shen‐Kun Yen, Yong‐Tai Li   +3 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

Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm [PDF]

Quantum
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

A Structured Lifecycle Model for Quantum Software Engineering: Bridging Technical Challenges and Future Directions

IET Software, Volume 2026, Issue 1, 2026.
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, Islam Zada, Mahmoud Ahmed, Sara Shahzad, Siwar Rekik, Abdullah Alshahrani, Nguyen Phi, Zahid Akhtar   +7 more
wiley   +1 more source

Quantifying the Efficiency of State Preparation via Quantum Variational Eigensolvers

PRX Quantum, 2021
Recently, there has been much interest in the efficient preparation of complex quantum states using low-depth quantum circuits, such as the quantum approximate optimization algorithm (QAOA).
Gabriel Matos, Sonika Johri, Zlatko Papić   +2 more
doaj   +1 more source

Quantum‐Enhanced Distributed Fiber‐Optic Sensing: Current State and Future Perspectives

Quantum Engineering, Volume 2026, Issue 1, 2026.
The integration of quantum science with optical fiber technology is redefining the limits of precision measurement and distributed sensing. This review provides a comprehensive overview of recent advances in quantum‐enhanced fiber‐optic sensing, focusing on how quantum light sources, quantum materials, and quantum algorithms are converging to improve ...
Clement Afagwu, Hayden Gemeinhardt, Jyotsna Sharma, Yu-Bo Sheng   +3 more
wiley   +1 more source

Enhancing Quantum Approximate Optimization Algorithm Through Manifold Optimization

Quantum Engineering, Volume 2026, Issue 1, 2026.
We propose the models of Riemannian manifold optimization techniques to enhance the performance of the quantum approximate optimization algorithm (QAOA) for combinatorial optimization problems on near‐term quantum devices. The approach leverages the intrinsic geometric structure of the problem domain, addressing the nonconvexity of the QAOA objective ...
Qingqing Yu, Yinhui Yu, Rong Jin, Srijoni Sengupta   +3 more
wiley   +1 more source

Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm

PRX Quantum
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

Dynamic programming in economics on a quantum annealer

Quantitative Economics, Volume 17, Issue 1, Page 1-37, January 2026.
We introduce novel algorithms for solving dynamic programming problems in economics on a quantum annealer, a specialized quantum computer used for combinatorial optimization. Quantum annealers begin in a superposition of all states and generate candidate global solutions in milliseconds, regardless of problem size.
Jesús Fernández‐Villaverde, Isaiah Hull   +1 more
wiley   +1 more source

Evaluating the limits of Quantum Approximate Optimization Algorithm parameter transfer at high rounds on sparse Ising models with geometrically local cubic terms

Physical Review Research
The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest.
Elijah Pelofske, Marek M. Rams, Andreas Bärtschi, Piotr Czarnik, Paolo Braccia, Lukasz Cincio, Stephan Eidenbenz   +6 more
doaj   +1 more source