Related papers: Parameterized Complexity of Weighted Local Hamilto…
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the…
We develop generalized bounds for quantum single-parameter estimation problems for which the coupling to the parameter is described by intrinsic multi-system interactions. For a Hamiltonian with $k$-system parameter-sensitive terms, the…
Ground states of local Hamiltonians can be generally highly entangled: any quantum circuit that generates them (even approximately) must be sufficiently deep to allow coupling (entanglement) between any pair of qubits. Until now this…
We present a new perturbation theory for quantum mechanical energy eigenstates when the potential equals the sum of two localized, but not necessarily weak potentials $V_{1}(\vec{r})$ and $V_{2}(\vec{r})$, with the distance $L$ between the…
In the canonical approach of loop quantum gravity, arguably the most important outstanding problem is finding and interpreting solutions to the Hamiltonian constraint. In this work, we demonstrate that methods of machine learning are in…
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivalently, the problem is to decide whether a particular type of…
Consider a linear autonomous Hamiltonian system with a time periodic bound state solution. In this paper we study the structural instability of this bound state ^M relative to time almost periodic perturbations which are small, localized…
In the usual formulation of quantum theory, time is a global classical evolution parameter, not a local quantum observable. On the other hand, both canonical quantum gravity (which lacks fundamental time-evolution parameter) and the…
We study parameterized and approximation algorithms for a variant of Set Cover, where the universe of elements to be covered consists of points in the plane and the sets with which the points should be covered are segments. We call this…
Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that there is no $f(k)\cdot n^{o(k/\log k)}$ time algorithm that can solve 2-CSPs with $k$ constraints (over a domain of arbitrary large size $n$) for any…
The quantum analogue of a constraint satisfaction problem is a sum of local Hamiltonians - each local Hamiltonian specifies a local constraint whose violation contributes to the energy of the given quantum state. Formalizing the intuitive…
We study the problem of Hamiltonian sparsification: given a parameter $\varepsilon \in (0,1)$ and an $n$-qubit Hamiltonian $H$ which is the sum of $r$-local positive semi-definite (PSD) terms $H_1, \dots H_m$, our goal is to compute a…
We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any approximation ratio function $\rho$, unless $FPT\neq W[1]$. In particular, not having such…
The breakdown of Ehrenfest's theorem imposes serious limitations on quaternionic quantum mechanics (QQM). In order to determine the conditions in which the theorem is valid, we examined the conservation of the probability density, the…
Quantum machine learning (QML) has become a promising area for real world applications of quantum computers, but near-term methods and their scalability are still important research topics. In this context, we analyze the trainability and…
An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, [Ambainis, CCC 2014] defined the complexity class P^QMA[log], and motivated its study by showing that the physical…
This work investigates the hardness of computing sparse solutions to systems of linear equations over F_2. Consider the k-EvenSet problem: given a homogeneous system of linear equations over F_2 on n variables, decide if there exists a…
We investigate the connection between local minima in the problem Hamiltonian and first order quantum phase transitions during an adiabatic quantum computation. We demonstrate how some properties of the local minima can lead to an extremely…
Time-periodic (Floquet) systems are one of the most interesting nonequilibrium systems. As the computation of energy eigenvalues and eigenstates of time-independent Hamiltonians is a central problem in both classical and quantum…
Standard quantum theory represents a composite system at a given time by a joint state, but it does not prescribe a joint state for a composite of systems at different times. If a more even-handed treatment of space and time is possible,…