Related papers: Parameterized Complexity of Weighted Local Hamilto…
Finite dimensional models that mimic the constraint structure of Einstein's General Relativity are quantized in the framework of BRST and Dirac's canonical formalisms. The first system to be studied is one featuring a constraint quadratic…
Simulations of quantum matter rely mainly on Kohn-Sham density functional theory (DFT), which often fails for strongly correlated systems. Quantum embedding (QE) theories address this limitation by mapping the system onto an auxiliary…
Contextuality, one of the strongest forms of quantum correlations, delineates the quantum world and the classical one. It has been shown recently that some quantum models, in the form of infinite one-dimensional translation-invariant…
This paper creates and analyses a new quantum algorithm called the Amplified Quantum Fourier Transform (Amplified-QFT) for solving the following problem: The Local Period Problem: Let L = {0,1...N-1} be a set of N labels and let A be a…
It is a common belief that any relativistic nonlocal quantum field theory encounters either the problem of renormalizability or unitarity or both of them. It is also known that any local relativistic quantum field theory (QFT) possesses the…
Gurumukhani et al. (CCC'24) proposed the local enumeration problem Enum(k, t) as an approach to break the Super Strong Exponential Time Hypothesis (SSETH): for a natural number $k$ and a parameter $t$, given an $n$-variate $k$-CNF with no…
Recently, a class of PT-invariant quantum mechanical models described by the non-Hermitian Hamiltonian $H=p^2+x^2(ix)^\epsilon$ was studied. It was found that the energy levels for this theory are real for all $\epsilon\geq0$. Here, the…
The problem of the time is one of the open issues in the quantum gravity. This problem is particular problem in the canonical quantum gravity. Even in the loop gravity the problem of the time remain. Our work is concerning to the problem of…
I consider in this book a formulation of Quantum Mechanics. Usually QM is formulated based on the notion of time and space, both of which are thought a priori given quantities or notions. However, when we try to define the notion of…
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing…
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph $G= (A \cup P, E)$ with weights on the edges in $E$, and with lower and upper quotas on the vertices in $P$. We…
Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as an efficient back-end for solving NP-complete problems. However, many fundamental problems in knowledge representation and reasoning are located at…
We prove that recognizing the phase of matter of an unknown quantum state is quantum computationally hard. More specifically, we show that the quantum computational time of any phase recognition algorithm must grow exponentially in the…
A causal, non-Hermitian, renormalizable, local, unitary and Lorentz convariant formulation of Quantum Theory (QT) (= Quantum Mechanics (QM) and Quantum Field Theory (QFT)) is developed which is free of formalistic problems we face in the…
Understanding the mechanisms responsible for the equilibration of isolated quantum many-body systems is a long-standing open problem. In this work we obtain a statistical relationship between the equilibration properties of Hamiltonians and…
The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremacy"). In this work, we investigate whether quantum advantage…
We consider supersymmetric quantum mechanical models with both local and nonlocal potentials. We present a nonlocal deformation of exactly solvable local models. Its energy eigenfunctions and eigenvalues are determined exactly. We observe…
A century after the advent of Quantum Mechanics and General Relativity, both theories enjoy incredible empirical success, constituting the cornerstones of modern physics. Yet, paradoxically, they suffer from deep-rooted, so-far intractable,…
We prove that finding a $k$-edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial observations, Gauss' famous \emph{Eureka} theorem [Andrews,…
QMA (Quantum Merlin-Arthur) is the quantum analogue of the class NP. There are a few QMA-complete problems, most notably the ``Local Hamiltonian'' problem introduced by Kitaev. In this dissertation we show some new QMA-complete problems.…