Results 141 to 150 of about 6,219,411 (273)
A hybrid quantum-classical approach to warm-starting optimization
The Quantum Approximate Optimization Algorithm (QAOA) is a promising candidate for solving combinatorial optimization problems more efficiently than classical computers.
Wellens, Thomas, Dehn, Vanessa
core +1 more source
The ability of the quantum approximate optimization algorithm (QAOA) to deliver a quantum advantage on combinatorial optimization problems is still unclear. Recently, a scaling advantage over a classical solver was postulated to exist for random 8-SAT at
Thorge Müller +3 more
doaj +1 more source
Low‐dose electron holography is limited by shot noise, which buries weak phase signals. HoloDenoiser, a physics‐informed network that works simultaneously in the spatial and frequency domains, locates and protects the holographic sideband while suppressing noise in the hologram.
Ye Luo +10 more
wiley +1 more source
Optimization schedules for the quantum approximate optimization algorithm [PDF]
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm devised in 2014 in order to solve variational problems, typically in the field of quantum many body theory.
Grotti, Matteo
core
A Novel Magnetic Update Operator for Quantum Evolutionary Algorithms
Quantum Evolutionary Algorithms (QEA) are novel algorithms proposed for class of combinatorial optimization problems. The probabilistic representation of possible solutions in QEA helps the q-individuals to represent all the search space simultaneously ...
Tayarani Najaran, Mohammad +1 more
core +1 more source
Atomistic Kinetics of Dislocation‐Mediated Grain Growth in Monolayer MoS2
Atomic‐resolution in‐situ heating microscopy directly visualizes dislocation‐mediated grain boundary migration and grain growth in monolayer MoS2. Mobile grain boundaries migrate through collective motion of Mo 5|7 dislocations, whereas S 5|7 defects remain largely immobile.
Chang‐Won Choi +11 more
wiley +1 more source
Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent
Combinatorial optimization has wide and high-value applications in many fields of science and industry, but solving general combinatorial optimization problems is non-deterministic polynomial time (NP) hard.
Xin Yi +5 more
doaj +1 more source
Robots and Minimal, Physics‐Informed Features: A Hybrid Framework for Enzyme Catalysis
Robotic experimentation and physics‐informed machine learning combine to predict enzyme substrate scope. With a handful of interpretable features derived from docking and quantum mechanics calculations, our model rivals descriptor‐heavy AI approaches and extrapolates to unseen substrates and enzyme classes.
Natalia Onishchenko +8 more
wiley +1 more source
A Quantum Variational Approach to Phase-Only Pattern Synthesis
Phase-only pattern synthesis is a long-standing and hard to solve problem in antenna engineering. Due to its nonlinear nature, this kind of optimization problem is classically approached with iterative algorithms, where the convergence time depends on ...
Sigurd Huber, Michael Epping
doaj +1 more source
Probabilistic Computing via Gate‐Tunable Random Telegraph Noise
Intrinsic random telegraph noise in metal–oxide–semiconductor field‐effect transistors is harnessed to create gate‐tunable probabilistic bits. By modulating carrier‐trapping dynamics, the device produces stochastic binary outputs with a continuous bias‐to‐probability transfer.
Gyungwon Yun +8 more
wiley +1 more source

