Smeared d-Wave Anisotropy in a Monolayer Organic Superconductor

2018 ◽  
Vol 5 (1) ◽  
pp. 1800247 ◽  
Author(s):  
Abdou Hassanien
2021 ◽  
Vol 3 (2) ◽  
Author(s):  
Rina Tazai ◽  
Youichi Yamakawa ◽  
Masahisa Tsuchiizu ◽  
Hiroshi Kontani

2016 ◽  
Vol 85 (4) ◽  
pp. 043705 ◽  
Author(s):  
Shusaku Imajo ◽  
Naoki Kanda ◽  
Satoshi Yamashita ◽  
Hiroki Akutsu ◽  
Yasuhiro Nakazawa ◽  
...  

1993 ◽  
Vol 3 (3) ◽  
pp. 871-885 ◽  
Author(s):  
P. Auban-Senzier ◽  
C. Bourbonnais ◽  
D. Jérome ◽  
C. Lenoir ◽  
P. Batail ◽  
...  

1983 ◽  
Vol 44 (C3) ◽  
pp. C3-893-C3-901 ◽  
Author(s):  
M. Miljak ◽  
J. R. Cooper ◽  
K. Bechgaard

2020 ◽  
Vol 102 (11) ◽  
Author(s):  
Qi Wu ◽  
Dian-Yong Chen ◽  
Takayuki Matsuki
Keyword(s):  

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 187
Author(s):  
Aaron Barbosa ◽  
Elijah Pelofske ◽  
Georg Hahn ◽  
Hristo N. Djidjev

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters, such as the D-Wave’s chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.


1994 ◽  
Vol 49 (2) ◽  
pp. 1397-1402 ◽  
Author(s):  
Hyekyung Won ◽  
Kazumi Maki
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document