Related papers: Parameterized Complexity of Weighted Local Hamilto…
The eigenstate thermalization hypothesis (ETH) explains why chaotic quantum many-body systems thermalize internally if the Hamiltonian lacks symmetries. If the Hamiltonian conserves one quantity ("charge"), the ETH implies thermalization…
Strongly-coupled Quantum Field Theories (QFTs) are ubiquitous in high energy physics and many-body physics, yet our ability to do precise computations in such systems remains limited. Hamiltonian Truncation is a method for doing…
Quantum k-SAT (the problem of determining whether a k-local Hamiltonian is frustration-free) is known to be QMA_1-complete for k >= 3, and hence likely hard for quantum computers to solve. Building on a classical result of Alon and Shapira,…
To admit a canonically conjugate time operator, the Hamiltonian has to be a generator of translations (like the momentum operator generates translations in space), so its spectrum must be unbounded. But the Hamiltonian governing our world…
We study the following general stabbing problem from a parameterized complexity point of view: Given a set $\mathcal S$ of $n$ translates of an object in $\Rd$, find a set of $k$ lines with the property that every object in $\mathcal S$ is…
We study the complexity of finding the ground state energy density of a local Hamiltonian on a lattice in the thermodynamic limit of infinite lattice size. We formulate this rigorously as a function problem, in which we request an estimate…
It is shown that the standard formulation of quantum mechanics in terms of Hermitian Hamiltonians is overly restrictive. A consistent physical theory of quantum mechanics can be built on a complex Hamiltonian that is not Hermitian but…
The Set Packing problem is, given a collection of sets $\mathcal{S}$ over a ground set $\mathcal{U}$, to find a maximum collection of sets that are pairwise disjoint. The problem is among the most fundamental NP-hard optimization problems…
A central problem in quantum computing is to identify computational tasks which can be solved substantially faster on a quantum computer than on any classical computer. By studying the hardest such tasks, known as BQP-complete problems, we…
In this paper I raise a worry about the most extended resolutions of the problem of time of canonical quantizations of general relativity. The reason for this is that these resolutions are based on analogies with deparametrizable models for…
This paper investigates symmetric composite binary quantum hypothesis testing (QHT), where the goal is to determine which of two uncertainty sets contains an unknown quantum state. While asymptotic error exponents for this problem are…
In this paper we develop a classical algorithm of complexity $O(K \, 2^n)$ to simulate parametrized quantum circuits (PQCs) of $n$ qubits, where $K$ is the total number of one-qubit and two-qubit control gates. The algorithm is developed by…
In a former paper we proposed a model for the quantization of gravity by working in a bundle $E$ where we realized the Hamilton constraint as the Wheeler-DeWitt equation. However, the corresponding operator only acts in the fibers and not…
This is the second of the two related papers analysing origins and possible explanations of a paradoxical phenomenon of the quantum potential (QP). It arises in quantum mechanics'(QM) of a particle in the Riemannian $n$-dimensional…
In this essay, we argue that the problem of time should not be regarded as an issue to be resolved within the prevailing framework for studying quantum gravity, but rather as an indication that there is an issue within the framework itself.…
The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has heuristics which work well, while the 13-state qudit case has…
Understanding the entanglement structure of local Hamiltonian ground spaces is a physically motivated problem, with applications ranging from tensor network design to quantum error-correcting codes. To this end, we study the complexity of…
Hamiltonian truncation is a non-perturbative numerical method for calculating observables of a quantum field theory. The starting point for this method is to truncate the interacting Hamiltonian to a finite-dimensional space of states…
The $k$-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over $\mathbb F_2$, which can be stated as follows: given a generator matrix $\mathbf A$ and an integer $k$, determine whether the code…
Update: A time-independent $n\times n$ PT-symmetric (and symmetric) Hamiltonian is diagonalizable since it has all distinct real eigenvalues and the resulting diagonal matrix is a real symmetric matrix. The diagonalization results an…