Results 71 to 80 of about 5,709 (252)

Self‐Assembled Monolayers in p–i–n Perovskite Solar Cells: Molecular Design, Interfacial Engineering, and Machine Learning–Accelerated Material Discovery

Advanced Materials, EarlyView.
This review highlights the role of self‐assembled monolayers (SAMs) in perovskite solar cells, covering molecular engineering, multifunctional interface regulation, machine learning (ML) accelerated discovery, advanced device architectures, and pathways toward scalable fabrication and commercialization for high‐efficiency and stable single‐junction and
Asmat Ullah, Ying Luo, Stefaan De Wolf
wiley   +1 more source

Photonic counterdiabatic quantum optimization algorithm

Communications Physics
One of the key applications of near-term quantum computers has been the development of quantum optimization algorithms. However, these algorithms have largely been focused on qubit-based technologies.
Pranav Chandarana, Koushik Paul, Mikel Garcia-de-Andoin, Yue Ban, Mikel Sanz, Xi Chen   +5 more
doaj   +1 more source

Quantum Algorithms for Scientific Computing and Approximate Optimization

, 2018
264 pages, 20 figures. PhD Dissertation in Computer Science, Columbia University (2018).
openaire   +3 more sources

Quantum Approximate Optimization Algorithms for Molecular Docking

CoRR
15 ...
Christos Papalitsas, Yanfei Guan, Shreyas Waghe, Athanasios Liakos, Ioannis Balatsos, Vassilios Pantazopoulos   +5 more
openaire   +2 more sources

Turning Unpredictable Biomolecule Adsorption to Controlled Corona Formation: Focus on Carbon Nanomaterials

Advanced Materials, EarlyView.
Controlling the protein corona formation onto carbon nanomaterials (CNMs) enhances their functionalities as platforms for cancer theranostics. Here, we reviewed the effects of the intrinsic and acquired properties of CNMs on protein corona formation, the consequent biological and toxicological outcomes, and the strategies to reshape corona formation ...
Yajuan Zou, Yalei Hu, Jie Yu, Naoki Komatsu, Yuta Nishina, Alberto Bianco   +5 more
wiley   +1 more source

Approximate quadratization of high-order Hamiltonians for combinatorial quantum optimization

Physical Review Research
Combinatorial optimization problems have wide-ranging applications in industry and academia. Quantum computers may help solve them by sampling from appropriately prepared Ansatz quantum circuits.
Sabina Drăgoi, Alberto Baiardi, Daniel J. Egger   +2 more
doaj   +1 more source

Organic Materials of Tomorrow: Horizons of Artificial Intelligence

Advanced Materials, EarlyView.
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena, J. Terence Blaskovits, Kun‐Han Lin, Denis Andrienko   +3 more
wiley   +1 more source

A Quantum Variational Approach to Phase-Only Pattern Synthesis

IEEE Transactions on Quantum Engineering
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

Optoelectronic Nanofluidic Neural Networks for Ionic Computing

Advanced Materials, EarlyView.
An ion‐based optoelectronic nanofluidic memristor enables neuromorphic computing in aqueous environments. With tunable ionic memory and multimodal synaptic plasticity, it realizes densely connected ionic neural networks capable of image classification, motion prediction, logic computation, and real‐time in‐sensor computing, advancing fully connected ...
Yaxin Huang, Zhiyuan Du, Changjin Wu, Binglin Zeng, Yingnan Cao, Mingliang Li, Liren Zhang, Qingxin Guo, Chao Huang, Can Li, Jinyao Tang   +10 more
wiley   +1 more source

An upper bound on the Universality of the Quantum Approximate Optimization Algorithm

CoRR, 2021
Using lie algebra, this brief text provides an upper bound on the universality of QAOA. That is, we prove that the upper bound for the number of alterations of QAOA required to approximate a universal gate set is within O(n)
openaire   +2 more sources