Related papers: Q-curvature and Path Integral Complexity
Varying the curvature, quantum phase transitions are investigated in holographic confining QFTs defined on a fixed constant positive curvature background. We find a competition between two branches of solutions and a phase transition as one…
Nielsen, et al. [1, 2] proposed a view of quantum computation where determining optimal algorithms is equivalent to extremizing a geodesic length or cost functional. This view of optimization is highly suggestive of an action principle of…
Motivated by recent studies of quantum computational complexity in quantum field theory and holography, we discuss how weighting certain classes of gates building up a quantum circuit more heavily than others does affect the complexity.…
Background: Path integrals are a powerful tool for solving problems in quantum theory that are not amenable to a treatment by perturbation theory. Most path integral computations require an analytic continuation to imaginary time. While…
For description of the quantum dynamics on a curved group manifold the path integrals in a space of the group parameters is offered. The formalism is illustrated by the $H$-atom problem.
In this work, we study the Quantum Field Theory version of the higher derivative Pais-Uhlenbeck oscillator. We quantize canonically this system and construct its Fock space, as well as study its path integral. We demonstrate that the…
We consider Euclidean path integrals with higher derivative actions, including those that depend quadratically on acceleration, velocity and position. Such path integrals arise naturally in the study of stiff polymers, membranes with…
We discuss how one calculates the coherent path integrals for locally interacting systems, where some inconsistencies with exact results have been reported previously. It is shown that the operator ordering subtlety that is hidden in the…
We present a new method for the consistent construction of time-continuous coherent-state path integrals using the theory of half-form quantization. Through the inversion of the quantization procedure we construct a de-quantization map…
We have developed a proper path integral formalism consistent with the deformed version of the quantum mechanics which contains a maximum observable length scale at the order of the Cosmological particle horizon, existing in cosmology.…
Major players in the global aerospace industry are shifting their focus toward achieving net carbon-neutral operations by 2050. A considerable portion of the overall carbon emission reduction is expected to come from new aircraft…
Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
We consider the problem of optimal path planning in different homotopy classes in a given environment. Though important in robotics applications, path-planning with reasoning about homotopy classes of trajectories has typically focused on…
In this contribution a path integral approach for the quantum motion on three-dimensional spaces according to Koenigs, for short``Koenigs-Spaces'', is discussed. Their construction is simple: One takes a Hamiltonian from three-dimensional…
We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures. The method introduces a decomposition of the…
Topology optimization (TO) can be viewed as seeking an optimal solution in the design space of a given TO problem. For weakly non-linear TO problems, e.g., compliance minimization, sensitivity-based methods typically converge well, whereas…
We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the…
Recently, quantum computing has gained attention in urban studies as a tool for complex transport planning problems, but its role remains unclear. This paper reviews quantum computing research in urban transport planning and highlights…