Results 31 to 40 of about 429 (149)
Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) is a promising method for solving certain classical combinatorial optimization problems on near-term quantum devices. When employing the QAOA to 3-SAT and Max-3-SAT problems, the quantum cost exhibits
Yunlong Yu +4 more
doaj +1 more source
Modularity‐Preserving Hamiltonian Compression for QAOA‐Based Community Detection
This work explores several quantum methods to community detection in networks by simplifying modularity‐based Hamiltonians. By reducing circuit complexity through sparsification, spectral projection, and penalty techniques, the methods retain key structural information while improving efficiency.
Danilo Cavaliere +2 more
wiley +1 more source
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
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 +5 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
Quantum biology: From mechanisms to medicine
Quantum biology across systems: from mechanisms to medicine. This graphical abstract highlights how quantum phenomena‐coherence, tunnelling and spin dynamics‐shape fundamental biological processes and point towards quantum‐informed medicine. In photosynthesis, quantum coherence supports near‐lossless exciton transport across pigment–protein complexes ...
Ji‐Yong Sung, Jae‐Ho Cheong
wiley +1 more source
Elementary proof of QAOA convergence
The quantum alternating operator ansatz (QAOA) and its predecessor, the quantum approximate optimization algorithm, are one of the most widely used quantum algorithms for solving combinatorial optimization problems.
Lennart Binkowski +3 more
doaj +1 more source
Iterative Quantum Feature Maps
We propose Iterative Quantum Feature Maps (IQFMs), a hybrid quantum–classical framework that constructs a deep architecture by iteratively connecting shallow quantum feature maps with classically computed augmentation weights. By incorporating contrastive learning and a layer‐wise training mechanism, the IQFMs framework effectively reduces quantum ...
Nasa Matsumoto +4 more
wiley +1 more source
Quantifying the impact of precision errors on quantum approximate optimization algorithms
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 +6 more
doaj +1 more source
In this paper, we present the implementation of the Quantum Approximate Optimization Algorithm (QAOA) for the Max-Cut problem using the JavaScript programming language.
Dmytro Sapozhnyk
doaj +1 more source
End‐to‐End Portfolio Optimization with Hybrid Quantum Annealing
This works presents a hybrid quantum‐classical framework for portfolio optimization that combines quantum assisted asset selection and rebalancing with classical weight allocation. The approach processes real market data, embeds it into Quadratic Unconstrained Binary Optimization formulations, and evaluates performance within a unified workflow ...
Sai Nandan Morapakula +5 more
wiley +1 more source

