Results 41 to 50 of about 1,865,243 (219)
De-Signing Hamiltonians for Quantum Adiabatic Optimization [PDF]
Quantum, 2020 Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization.
Elizabeth Crosson +3 more
doaj +1 more source
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
AIMS Mathematics, 2021 In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs ...
Suliman Khan +4 more
doaj +1 more source
Graphs with many hamiltonian paths
Involve, a Journal of MathematicsA graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio of pairs of vertices connected by hamiltonian paths to all pairs of vertices approaches 1. We then consider minimal
Carlson, Erik +5 more
openaire +3 more sources
Triangle-different Hamiltonian paths
Journal of Combinatorial Theory, Series B, 2018 Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different Hamiltonian paths is equal to the number of balanced bipartitions of the ground set, answering a question of K ...
István Kovács, Daniel Soltész
openaire +4 more sources
Hamiltonian Properties of DCell Networks
, 2015 DCell has been proposed for data centers as a server centric interconnection network structure. DCell can support millions of servers with high network capacity by only using commodity switches.
Erickson, Alejandro +3 more
core +1 more source
DNA Computing the Hamiltonian Path Problem
Molecules and Cells, 1999 The directed Hamiltonian path (DHP) problem is one of the hard computational problems for which there is no practical algorithm on a conventional computer available. Many problems, including the traveling sales person problem and the longest path problem, can be translated into the DHP problem, which implies that an algorithm for DHP can also solve all
C M, Lee, S W, Kim, S M, Kim, U, Sohn
openaire +2 more sources
Path Integral for non-relativistic Generalized Uncertainty Principle corrected Hamiltonian
, 2012 Generalized Uncertainty Principle (GUP) has brought the idea of existence of minimum measurable length in Quantum physics. Depending on this GUP, non-relativistic Hamiltonian at the Planck scale is modified.
das, Sudipta, Pramanik, Souvik
core +1 more source
Measurement + Control, 2019 Wheeled mobile robots are widely utilized for environment-exploring tasks both on earth and in space. As a basis for global path planning tasks for wheeled mobile robots, in this study we propose a method for establishing an energy-based cost map.
Bo You +4 more
doaj +1 more source
SU(2) QCD in the Path Representation: General Formalism and Mandelstam Indentities
, 1993 We introduce a path-dependent hamiltonian representation (the path representation) for SU(2) with fermions in 3 + 1 dimensions. The gauge-invariant operators and hamiltonian are realized in a Hilbert space of open path and loop functionals. We obtain two
Aroca +29 more
core +2 more sources
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Journal of Mathematical and Fundamental Sciences, 2014 The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih +2 more
doaj +1 more source