Related papers: The Quantum Strong Exponential-Time Hypothesis
For almost half of the one hundred year history of Einstein's theory of general relativity, Strong Cosmic Censorship has been one of its most intriguing conjectures. The SCC conjecture addresses the issue of the nature of the singularities…
Let $P:\{0,1\}^k \to \{0,1\}$ be a nontrivial $k$-ary predicate. Consider a random instance of the constraint satisfaction problem $\mathrm{CSP}(P)$ on $n$ variables with $\Delta n$ constraints, each being $P$ applied to $k$ randomly chosen…
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
In this dissertation, I introduce the principles and methods of effective field theory and describe my work in three EFTs: First, in the perturbative QCD region, I use soft collinear effective theory (SCET) to prove that strong interaction…
Classic similarity measures of strings are longest common subsequence and Levenshtein distance (i.e., the classic edit distance). A classic similarity measure of curves is dynamic time warping. These measures can be computed by simple…
We revisit the classic combinatorial pattern matching problem of finding a longest common subsequence (LCS). For strings $x$ and $y$ of length $n$, a textbook algorithm solves LCS in time $O(n^2)$, but although much effort has been spent,…
In this study, a distinctive feature of quantum computation (QC) is characterized. To this end, a seemingly-powerful classical computing model, called "stochastic ensemble machine (SEnM)," is considered. The SEnM runs with an ensemble…
In a recent article entitled "A simple explanation of the quantum violation of a fundamental inequality," Cabello proposes a condition on a class of probabilistic models that, he claims, gives the same bound on contextuality for the KCBS…
We consider quantum quench in large-N singlet sector quantum mechanics of a single hermitian matrix in the double scaling limit. The time dependent parameter is the self-coupling of the matrix. We find exact classical solutions of the…
Matrix evolution equations occur in many applications, such as dynamical Lyapunov/Sylvester systems or Riccati equations in optimization and stochastic control, machine learning or data assimilation. In many such problems, the dominant…
In this paper, we propose a method for bounding the probability that a stochastic differential equation (SDE) system violates a safety specification over the infinite time horizon. SDEs are mathematical models of stochastic processes that…
Quantum error correction (QEC) is one of the central concepts in quantum information science and also has wide applications in fundamental physics. The capacity theorems provide solid foundations of QEC. We here provide a general and highly…
In this paper, we study the effective field theory (EFT) of dark energy for the $k$-essence model beyond linear order. Using particle-mesh $N$-body simulations that consistently solve the dark energy evolution on a grid, we find that the…
A key issue of current quantum advantage experiments is that their verification requires a full classical simulation of the ideal computation. This limits the regime in which the experiments can be verified to precisely the regime in which…
The rate of complexification of a quantum state is conjectured to be bounded from above by the average energy of the state. A different conjecture relates the complexity of a holographic CFT state to the on-shell gravitational action of a…
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
We obtain the strongest separation between quantum and classical query complexity known to date -- specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved…
Quantum computing offers the potential of exponential speedups for certain classical computations. Over the last decade, many quantum machine learning (QML) algorithms have been proposed as candidates for such exponential improvements.…
Quantum defect embedding theory (QDET) is a many-body embedding method designed to describe condensed systems with correlated electrons localized within a given region of space, for example spin defects in semiconductors and insulators.…