Related papers: NP in BQP with Nonlinearity
We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…
These lecture notes provide a basic introduction to the framework of generalized probabilistic theories (GPTs) and a sketch of a reconstruction of quantum theory (QT) from simple operational principles. To build some intuition for how…
We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an N x N…
The notion of "closed systems" in Quantum Mechanics is discussed. For this purpose, we study two models of a quantum-mechanical system $P$ spatially far separated from the "rest of the universe" $Q$. Under reasonable assumptions on the…
Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…
This letter examines the consequences of a recently proposed modification of the postulate of equal {\it a priori} probability in quantum statistical mechanics. This modification, called the {\it quantum microcanonical postulate} (QMP),…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…
I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of the clauses forming the 3-SAT proposition using a…
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.…
We explore the space "just above" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to an oracle. The class is defined by imagining that quantum…
Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…
The problem 2-quantum-satisfiability (2-QSAT) is the generalisation of the 2-CNF-SAT problem to quantum bits, and is equivalent to determining whether or not a spin-1/2 Hamiltonian with two-body terms is frustration-free. Similarly to the…
While prior work established a verifier-based polynomial-time framework for NP, explicit deterministic machines for concrete NP-complete problems have remained elusive. In this paper, we construct fully specified deterministic Turing…
In this work, we present a multi-layer quantum search method that generates an exponential speedup of the standard Grover's algorithm. As direct applications, any NP problems can be solved efficiently on a quantum circuit with only…
Standard techniques of canonical gravity quantization on the superspace of 3--metrics are known to cause insurmountable difficulties in the description of time evolution. We forward a new quantization procedure on the superspace of true…
Frauchiger and Renner recently cast doubt on the universal applicability of Quantum Mechanics [1]. In the following, it is pointed out that their conclusion of one of three common-sense conditions, demanded for Quantum Mechanics, being…
In this paper, we give random matrix theory approach to the quantum mechanics using the quantum Hamilton-Jacobi formalism. We show that the bound state problems in quantum mechanics are analogous to solving Gaussian unitary ensemble of…
We introduce techniques for proving superlinear conditional lower bounds for polynomial time problems. In particular, we show that CircuitSAT for circuits with m gates and log(m) inputs (denoted by log-CircuitSAT) is not decidable in…
In this paper, we provide a deterministic polynomial time algorithm that determines satisfiability of 3-SAT. The complexity analysis for the algorithm takes into account no efficiency and yet provides a low enough bound, that efficient…
The strong exponential-time hypothesis (SETH) is a commonly used conjecture in the field of complexity theory. It states that CNF formulas cannot be analyzed for satisfiability with a speedup over exhaustive search. This hypothesis and its…