Results 131 to 140 of about 7,825 (160)

Approximate quantum circuit compilation for proton-transfer kinetics on quantum processors.

Phys Chem Chem Phys
Kovyrshin A, Manawadu D, Altamura E, Pennington G, Jaderberg B, Brandhofer S, Nykänen A, Miller A, Talarico W, Knecht S, Pavošević F, Baiardi A, Tacchino F, Tavernelli I, Mensa S, Crain J, Tornberg L, Broo A.   +17 more
europepmc   +1 more source

Rovibrational Analysis of the <i>ν</i>₁, <i>ν</i>₄, <i>ν</i>₁ + <i>ν</i>₄ and <i>ν</i>₁ - <i>ν</i>₄ Bands of ¹³CF₄. [PDF]

Molecules
Ben Fathallah O, Terrier R, Manceron L, Richard C, Boudon V.   +4 more
europepmc   +1 more source

Theoretical determination of electronic properties of resorcinol and hydroquinone as building blocks of molecular wires. [PDF]

RSC Adv
Martínez JS, Gallego D, Ojeda S JH.
europepmc   +1 more source

Microscopic Theory of Polaron-Polariton Dispersion and Propagation. [PDF]

Nano Lett
Blackham L, Manjalingal A, Koshkaki SR, Mandal A.   +3 more
europepmc   +1 more source

Quantum circuit simulation with a local time-dependent variational principle

Eisert J, Sander A, Fröhlich M, Ali M, Eigel M, Hintermüller M, Mendl C, Milbradt R, Wille R.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Hamiltonian Path-Integral Methods

Reviews of Modern Physics, 1966
A path-integral formulation of quantum mechanics is investigated which is closely related to that of Feynman. It differs from Feynman's formulation in that it involves the Hamiltonian function of the canonically conjugate coordinates and momenta.
Claude Garrod
openaire   +3 more sources

Hamiltonian path graphs

Journal of Graph Theory, 1983
AbstractThe Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u‐v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.
Chartrand, Gary, Kapoor, S. F., Nordhaus, E. A.   +2 more
openaire   +1 more source

On Hamiltonian cycles and Hamiltonian paths

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rahman, M. Sohel, Kaykobad, M.
openaire   +1 more source

Hamiltonian Paths and Cycles

2013
In this chapter, the concepts of Hamiltonian paths and Hamiltonian cycles are discussed. In the first section, the history of Hamiltonian graphs is described, and then some concepts such as Hamiltonian paths, Hamiltonian cycles, traceable graphs, and Hamiltonian graphs are defined.
Mahtab Hosseininia, Faraz Dadgostari
openaire   +1 more source

Hamiltonian and Eulerian Paths

1983
March 14. Hamiltonian and Eulerian paths and cycles come under the general heading of “de Bruijn sequences”. The specific terms “Hamiltonian” and “Eulerian” are somewhat better known; hence this chapter has been named after them rather than de Bruijn.
George Pólya, Robert E. Tarjan, Donald R. Woods   +2 more
openaire   +1 more source