Results 91 to 100 of about 4,386 (222)

Leveraging Quantum Annealing for Layout Optimization

open access: yesAdvanced Quantum Technologies, Volume 8, Issue 11, November 2025.
The authors address wind farm layout optimization by formulating it as a QUBO problem using the Jensen wake model. They compare quantum annealing, Gurobi, and QAOA, highlighting trade‐offs between solution quality and computational time. Results show that quantum annealing offers rapid, near‐optimal solutions, making it suitable for fast approximations
Luca Nigro   +3 more
wiley   +1 more source

Quantum machine learning [PDF]

open access: yes, 2019
We use reinforcement learning techniques to optimize the Quantum Approximate Optimization Algorithm when applied to the MaxCut problem. We explore Q-learning based techniques both for continuous and discrete action environments with regular and irregular
Riu I Vicente, Jordi
core  

Q‐fid: Quantum Circuit Fidelity Improvement with LSTM Networks

open access: yesAdvanced Quantum Technologies, Volume 8, Issue 10, October 2025.
Q‐fid is introduced, an LSTM‐based fidelity prediction system accompanied by a novel metric designed to quantify the fidelity of quantum circuits. This approach frames fidelity prediction as a Time Series Forecasting problem to analyze the tokenized circuits, capturing the causal dependence of the gate sequences and their impact on overall fidelity ...
Yikai Mao   +2 more
wiley   +1 more source

Quantum Algorithm Implementations for Beginners

open access: yes, 2020
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers.
Adedoyin, Adetokunbo   +33 more
core  

Quantum Computing in Industrial Internet of Things (IIoT) Forensics: Framework, Implications, Opportunities, and Future Directions

open access: yesWIREs Forensic Science, Volume 7, Issue 3, September 2025.
Generic Quantum‐Safe IIoT Forensics Framework (QS‐IIoT‐F) ABSTRACT The continuous evolution of quantum computing has shown novel and transformative possibilities and critical implications for the Industrial Internet of Things (IIoT) forensic processes.
Victor R. Kebande
wiley   +1 more source

Universal resources for quantum approximate optimization algorithm and quantum annealing

open access: yesPhysical Review Research
The quantum approximate optimization algorithm (QAOA) is a variational ansatz that resembles the Trotterized dynamics of a quantum annealing (QA) protocol.
Pablo Díez-Valle   +3 more
doaj   +1 more source

Quantum Computing: Foundations, Architecture and Applications

open access: yesEngineering Reports, Volume 7, Issue 8, August 2025.
This paper presents a study on quantum computing's theoretical foundations and applications, illustrated by a quantum circuit diagram featuring gates and measurements that demonstrate qubit manipulation and entanglement. ABSTRACT Quantum computing exploits the principles of quantum mechanics to address computational problems that are intractable to ...
Christopher Columbus Chinnappan   +4 more
wiley   +1 more source

What can we Learn from Quantum Convolutional Neural Networks?

open access: yesAdvanced Quantum Technologies, Volume 8, Issue 7, July 2025.
Quantum Convolutional Neural Networks have been long touted as one of the premium architectures for quantum machine learning (QML). But what exactly makes them so successful for tasks involving quantum data? This study unlocks some of these mysteries; particularly highlighting how quantum data embedding provides a basis for superior performance in ...
Chukwudubem Umeano   +3 more
wiley   +1 more source

Qoolchain: A QUBO Preprocessing Toolchain for Enhancing Quantum Optimization

open access: yesAdvanced Quantum Technologies, Volume 8, Issue 5, May 2025.
This study introduces Qoolchain, a QUBO preprocessing toolchain developed in Cython to reduce problem size and enhance optimization solvers' performance, particularly for Grover Adaptive Search (GAS). Qoolchain includes persistency identification, decomposition, and probing to estimate function bounds, all with polynomial complexity and applies Grover ...
Giacomo Orlandi   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy