Results 281 to 290 of about 3,095,070 (339)

The role of electronic excited states in the spin-lattice relaxation of spin-1/2 molecules. [PDF]

Sci Adv
Mariano LA, Nguyen VHA, Petersen JB, Björnsson M, Bendix J, Eaton GR, Eaton SS, Lunghi A.   +7 more
europepmc   +1 more source

Maximizing Free Energy Gain. [PDF]

Entropy (Basel)
Kolchinsky A, Marvian I, Gokler C, Liu ZW, Shor P, Shtanko O, Thompson K, Wolpert D, Lloyd S.   +8 more
europepmc   +1 more source

Thermalization and criticality on an analogue-digital quantum simulator. [PDF]

Nature
Andersen TI, Astrakhantsev N, Karamlou AH, Berndtsson J, Motruk J, Szasz A, Gross JA, Schuckert A, Westerhout T, Zhang Y, Forati E, Rossi D, Kobrin B, Paolo AD, Klots AR, Drozdov I, Kurilovich V, Petukhov A, Ioffe LB, Elben A, Rath A, Vitale V, Vermersch B, Acharya R, Beni LA, Anderson K, Ansmann M, Arute F, Arya K, Asfaw A, Atalaya J, Ballard B, Bardin JC, Bengtsson A, Bilmes A, Bortoli G, Bourassa A, Bovaird J, Brill L, Broughton M, Browne DA, Buchea B, Buckley BB, Buell DA, Burger T, Burkett B, Bushnell N, Cabrera A, Campero J, Chang HS, Chen Z, Chiaro B, Claes J, Cleland AY, Cogan J, Collins R, Conner P, Courtney W, Crook AL, Das S, Debroy DM, Lorenzo L, Barba ADT, Demura S, Donohoe P, Dunsworth A, Earle C, Eickbusch A, Elbag AM, Elzouka M, Erickson C, Faoro L, Fatemi R, Ferreira VS, Burgos LF, Fowler AG, Foxen B, Ganjam S, Gasca R, Giang W, Gidney C, Gilboa D, Giustina M, Gosula R, Dau AG, Graumann D, Greene A, Habegger S, Hamilton MC, Hansen M, Harrigan MP, Harrington SD, Heslin S, Heu P, Hill G, Hoffmann MR, Huang HY, Huang T, Huff A, Huggins WJ, Isakov SV, Jeffrey E, Jiang Z, Jones C, Jordan S, Joshi C, Juhas P, Kafri D, Kang H, Kechedzhi K, Khaire T, Khattar T, Khezri M, Kieferová M, Kim S, Kitaev A, Klimov P, Korotkov AN, Kostritsa F, Kreikebaum JM, Landhuis D, Langley BW, Laptev P, Lau KM, Guevel LL, Ledford J, Lee J, Lee KW, Lensky YD, Lester BJ, Li WY, Lill AT, Liu W, Livingston WP, Locharla A, Lundahl D, Lunt A, Madhuk S, Maloney A, Mandrà S, Martin LS, Martin O, Martin S, Maxfield C, McClean JR, McEwen M, Meeks S, Miao KC, Mieszala A, Molina S, Montazeri S, Morvan A, Movassagh R, Neill C, Nersisyan A, Newman M, Nguyen A, Nguyen M, Ni CH, Niu MY, Oliver WD, Ottosson K, Pizzuto A, Potter R, Pritchard O, Pryadko LP, Quintana C, Reagor MJ, Rhodes DM, Roberts G, Rocque C, Rosenberg E, Rubin NC, Saei N, Sankaragomathi K, Satzinger KJ, Schurkus HF, Schuster C, Shearn MJ, Shorter A, Shutty N, Shvarts V, Sivak V, Skruzny J, Small S, Smith WC, Springer S, Sterling G, Suchard J, Szalay M, Sztein A, Thor D, Torres A, Torunbalci MM, Vaishnav A, Vdovichev S, Villalonga B, Heidweiller CV, Waltman S, Wang SX, White T, Wong K, Woo BWK, Xing C, Yao ZJ, Yeh P, Ying B, Yoo J, Yosri N, Young G, Zalcman A, Zhu N, Zobrist N, Neven H, Babbush R, Boixo S, Hilton J, Lucero E, Megrant A, Kelly J, Chen Y, Smelyanskiy V, Vidal G, Roushan P, Läuchli AM, Abanin DA, Mi X.   +226 more
europepmc   +1 more source

Coupling a single spin to the motion of a carbon nanotube

Ares N, Fedele F, Cerisola F, Bresque L, Vigneau F, Monsel J, Tabanera-Bravo J, Aggarwal K, Dexter J, Sevitz S, Dunlop J, Auffeves A, Parrondo JM, Palyi A, Anders J.   +14 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quantum Circuit Based on Grover Algorithm to Solve Hamiltonian Cycle Problem

2022 IEEE 4th Eurasia Conference on IOT, Communication and Engineering (ECICE), 2022
We propose the concepts of the explicit oracle and the implicit oracle for realizing quantum algorithms. Then, the quantum circuit of the well-known Grover algorithm is constructed with the explicit oracle to solve the Hamiltonian cycle problem for the ...
Jehn-Ruey Jiang
semanticscholar   +1 more source

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

International Workshop on Graph-Theoretic Concepts in Computer Science, 2020
For many algorithmic problems on graphs of treewidth $t$, a standard dynamic programming approach gives an algorithm with time and space complexity $2^{\mathcal{O}(t)}\cdot n^{\mathcal{O}(1)}$.
Jesper Nederlof, Michał Pilipczuk, C. Swennenhuis, Karol Wegrzycki   +3 more
semanticscholar   +1 more source

Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph

Journal of Combinatorial Designs, 2013
Francesca Merola, Marco Buratti
exaly   +2 more sources

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths.
Mohammad Kaykobad, M. Sohel Rahman
openaire   +1 more source