Results 31 to 40 of about 3,582,160 (261)
Parity Quantum Optimization: Benchmarks [PDF]
We present benchmarks of the parity transformation for the Quantum Approximate Optimization Algorithm (QAOA). We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios.
Kilian Ender +7 more
core +1 more source
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor’s algorithm through experiments to the era of noisy intermediate scale quantum devices (NISQ) for solving real-world problems.
Rhonda Au-Yeung +2 more
doaj +1 more source
QGOpt: Riemannian optimization for quantum technologies
Many theoretical problems in quantum technology can be formulated and addressed as constrained optimization problems. The most common quantum mechanical constraints such as, e.g., orthogonality of isometric and unitary matrices, CPTP property of ...
Ilia A. Luchnikov, Alexander Ryzhov, Sergey N. Filippov, Henni Ouerdane
doaj +1 more source
Quantum computing in assistance to solve combinatorial optimization problems
Quantum computing as emerging technology is considered promising to provide more efficient or faster solutions to combinatorial optimization challenges. Such tasks appear in many different industrial settings, as e.g. in the logistics sector. However, in
Lorenz, Jeanette Miriam
core +1 more source
Bayesian Optimization for QAOA
The quantum approximate optimization algorithm (QAOA) adopts a hybrid quantum-classical approach to find approximate solutions to variational optimization problems.
Simone Tibaldi +3 more
doaj +1 more source
Reconstructing enzyme evolution by protein engineering
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection [PDF]
We introduce a variational quantum algorithm to solve unconstrained black box binary optimization problems, i.e., problems in which the objective function is given as black box.
Deshmukh, Amol +18 more
core +1 more source
Emerging experimental and computational methods for studying redox‐regulated structural transitions
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
A comprehensive benchmark of an Ising machine on the Max-Cut problem
Quadratic unconstrained binary optimization (QUBO) formulations of combinatorial optimization problems allow for solving them using various quantum heuristics.
Salwa Shaglel +6 more
doaj +1 more source
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
In this article, we extend variational quantum optimization algorithms for quadratic unconstrained binary optimization problems to the class of mixed binary optimization problems.
Lee Braine +3 more
doaj +1 more source

