Results 71 to 80 of about 6,219,411 (273)
Here, we develop a high‐throughput algorithm that accelerates the elucidation of phase diagrams of topological spin textures using limited computational resources at high numerical accuracy. Applying this framework to the van der Waals magnet CrSBr, we unveiled a hierarchy of previously unknown topological textures (domain‐wall bimerons, bimeron chains,
Andrew Lyall +4 more
wiley +1 more source
Classically Optimal Variational Quantum Algorithms
Hybrid quantum-classical algorithms, such as variational quantum algorithms (VQAs), are suitable for implementation on noisy intermediate-scale quantum computers.
Jonathan Wurtz, Peter Love
doaj +1 more source
A Quantum Approximate Optimization Algorithm
We introduce a quantum algorithm that produces approximate solutions for combinatorial optimization problems. The algorithm depends on a positive integer p and the quality of the approximation improves as p is increased. The quantum circuit that implements the algorithm consists of unitary gates whose locality is at most the locality of the objective ...
Farhi, Edward +2 more
openaire +2 more sources
Quantum approximate optimization algorithms and applications
Σε αυτή τη διατριβή ξεκινάμε καθορίζοντας τα βασικά συστατικά που υλοποιούν ένα κβαντικό κύκλωμα. Εξηγούμε τις βασικές πύλες, την έννοια του εναγκαλισμού (entanglement) και γιατί αυτές είναι σημαντικές για την κατασκευή κβαντικών αλγορίθμων. Στη συνέχεια, προχωρούμε αναλύοντας δύο βασικούς κβαντικούς αλγόριθμους (αλγόριθμοι Deutsch-Josza και Grover ...
Leonidas Ioannis, Leonidas Ioannis
openaire +1 more source
Here, we establish a low‐dose liquid‐phase electron microscopy workflow for real‐time observation of biological processes in hydrated conditions. Beam damage is reduced by imaging only 20% of the pixels and reconstructing the complete image using an inpainting algorithm.
Luco Rutten +7 more
wiley +1 more source
Improving the Quantum Approximate Optimization Algorithm with postselection
Combinatorial optimization is among the main applications envisioned for near-term and fault-tolerant quantum computers. In this work, we consider a well-studied quantum algorithm for combinatorial optimization: the Quantum Approximate Optimization Algorithm (QAOA) applied to the MaxCut problem on 3-regular graphs.
openaire +3 more sources
This study reports a self‐powered InGaAs nanowire photodetector achieving single‐photon‐level sensitivity in the shortwave infrared at non‐cryogenic temperatures. The device demonstrates high‐speed imaging capabilities even under extremely low‐flux conditions.
Kosala Dhanawansha +10 more
wiley +1 more source
Evaluating Quantum Approximate Optimization Algorithm: A Case Study [PDF]
Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum algorithms for the Noisy Intermediate-Scale Quantum (NISQ) era. Quantifying the performance of QAOA in the near-term regime is of utmost importance. We perform a large-scale numerical study of the approximation ratios attainable by QAOA is the low- to medium-depth ...
Ruslan Shaydulin, Yuri Alexeev
openaire +4 more sources
Indirect Quantum Approximate Optimization Algorithms: application to the TSP
We propose an Indirect Quantum Approximate Optimization Algorithm (referred to as IQAOA) where the Quantum Alternating Operator Ansatz takes into consideration a general parameterized family of unitary operators to efficiently model the Hamiltonian describing the set of string vectors.
Eric Bourreau +2 more
openaire +3 more sources
Neuromorphic devices for extreme environments are interpreted through the physical states that store and process information. Radiation, temperature extremes, and vacuum can perturb vacancies, filaments, trapped charges, polarization, interfaces, and readout signals.
Taehyun Park +7 more
wiley +1 more source

