Results 131 to 140 of about 6,645,845 (367)

Ultrahigh‐Yield, Multifunctional, and High‐Performance Organic Memory for Seamless In‐Sensor Computing Operation

open access: yesAdvanced Functional Materials, EarlyView.
Molecular engineering of a nonconjugated radical polymer enables a significant enhancement of the glass transition temperature. The amorphous nature and tunability of the polymer, arising from its nonconjugated backbone, facilitates the fabrication of organic memristive devices with an exceptionally high yield (>95%), as well as substantial ...
Daeun Kim   +14 more
wiley   +1 more source

Exponential Gain in Quantum Computing of Quantum Chaos and Localization

open access: yes, 2001
We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization and Anderson transition can be modelled efficiently
A. Eckert   +28 more
core   +1 more source

Two‐Dimensional Materials as a Multiproperty Sensing Platform

open access: yesAdvanced Functional Materials, EarlyView.
Various sensing modalities enabled and/or enhanced by two‐dimensional (2D) materials are reviewed. The domains considered for sensing include: 1) optoelectronics, 2) quantum defects, 3) scanning probe microscopy, 4) nanomechanics, and 5) bio‐ and chemosensing.
Dipankar Jana   +11 more
wiley   +1 more source

Thickness‐Dependent Skyrmion Evolution in Fe3GeTe2 During Magnetization Reversal

open access: yesAdvanced Functional Materials, EarlyView.
Thickness‐ and field‐dependent magnetic domain behavior in 2D van der Waals Fe3GeTe2 is studied using Lorentz TEM and micromagnetic simulations. A patch‐like domain phase evolves from skyrmions during magnetization reversal, and step edges between thickness regions act as pinning sites.
Jennifer Garland   +9 more
wiley   +1 more source

A quantum active learning algorithm for sampling against adversarial attacks

open access: yesNew Journal of Physics, 2020
Adversarial attacks represent a serious menace for learning algorithms and may compromise the security of future autonomous systems. A theorem by Khoury and Hadfield-Menell (KH), provides sufficient conditions to guarantee the robustness of active ...
P A M Casares, M A Martin-Delgado
doaj   +1 more source

Optical Realization of Wave-Based Analog Computing with Metamaterials

open access: yesApplied Sciences, 2020
Recently, the study of analog optical computing raised renewed interest due to its natural advantages of parallel, high speed and low energy consumption over conventional digital counterpart, particularly in applications of big data and high-throughput ...
Kaiyang Cheng   +5 more
doaj   +1 more source

Quantum Computers and Quantum Algorithms. Part 2. Quantum Algorithms

open access: yesIzvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics, 2016
The paper discusses principles of construction for quantum algorithms and their main features. Distinction of quantum parallelism from classical methods of high-performance computing is shown. Quantum algorithms design strategy is presented based on quantum circuits.
openaire   +1 more source

A Van der Waals Optoelectronic Synapse with Tunable Positive and Negative Post‐Synaptic Current for Highly Accurate Spiking Neural Networks

open access: yesAdvanced Functional Materials, EarlyView.
A van der Waals optoelectronic synaptic device based on a ReS2/WSe2 heterostructure and oxygen‐treated h‐BN is presented, which enables both positive and negative PSCs through photocarrier polarity reversal. Bidirectional plasticity arises from gate‐tunable band bending and charge trapping‐induced quasi‐doping.
Hyejin Yoon   +9 more
wiley   +1 more source

Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers

open access: yesIEEE Transactions on Quantum Engineering
Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts.
Vahideh Eshaghian   +3 more
doaj   +1 more source

Universality of Entanglement and Quantum Computation Complexity

open access: yes, 2003
We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NP-complete Exact Cover problem as well as the Grover's problem. The analytic result for
José I. Latorre   +9 more
core   +1 more source

Home - About - Disclaimer - Privacy