1,754 research outputs found
On Efficiently Solvable Cases of Quantum k-SAT
The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a "matching" or "dimer covering"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open.
Our results fall into three directions, all of which relate to the "matching" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a "matching". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere
The quantum measurement problem and physical reality: a computation theoretic perspective
Is the universe computable? If yes, is it computationally a polynomial place?
In standard quantum mechanics, which permits infinite parallelism and the
infinitely precise specification of states, a negative answer to both questions
is not ruled out. On the other hand, empirical evidence suggests that
NP-complete problems are intractable in the physical world. Likewise,
computational problems known to be algorithmically uncomputable do not seem to
be computable by any physical means. We suggest that this close correspondence
between the efficiency and power of abstract algorithms on the one hand, and
physical computers on the other, finds a natural explanation if the universe is
assumed to be algorithmic; that is, that physical reality is the product of
discrete sub-physical information processing equivalent to the actions of a
probabilistic Turing machine. This assumption can be reconciled with the
observed exponentiality of quantum systems at microscopic scales, and the
consequent possibility of implementing Shor's quantum polynomial time algorithm
at that scale, provided the degree of superposition is intrinsically, finitely
upper-bounded. If this bound is associated with the quantum-classical divide
(the Heisenberg cut), a natural resolution to the quantum measurement problem
arises. From this viewpoint, macroscopic classicality is an evidence that the
universe is in BPP, and both questions raised above receive affirmative
answers. A recently proposed computational model of quantum measurement, which
relates the Heisenberg cut to the discreteness of Hilbert space, is briefly
discussed. A connection to quantum gravity is noted. Our results are compatible
with the philosophy that mathematical truths are independent of the laws of
physics.Comment: Talk presented at "Quantum Computing: Back Action 2006", IIT Kanpur,
India, March 200
Entanglement, intractability and no-signaling
We consider the problem of deriving the no-signaling condition from the
assumption that, as seen from a complexity theoretic perspective, the universe
is not an exponential place. A fact that disallows such a derivation is the
existence of {\em polynomial superluminal} gates, hypothetical primitive
operations that enable superluminal signaling but not the efficient solution of
intractable problems. It therefore follows, if this assumption is a basic
principle of physics, either that it must be supplemented with additional
assumptions to prohibit such gates, or, improbably, that no-signaling is not a
universal condition. Yet, a gate of this kind is possibly implicit, though not
recognized as such, in a decade-old quantum optical experiment involving
position-momentum entangled photons. Here we describe a feasible modified
version of the experiment that appears to explicitly demonstrate the action of
this gate. Some obvious counter-claims are shown to be invalid. We believe that
the unexpected possibility of polynomial superluminal operations arises because
some practically measured quantum optical quantities are not describable as
standard quantum mechanical observables.Comment: 17 pages, 2 figures (REVTeX 4
Solution to Satisfiability problem by a complete Grover search with trapped ions
The main idea in the original Grover search (Phys. Rev. Lett. 79, 325 (1997))
is to single out a target state containing the solution to a search problem by
amplifying the amplitude of the state, following the Oracle's job, i.e., a
black box giving us information about the target state. We design quantum
circuits to accomplish a complete Grover search involving both the Oracle's job
and the amplification of the target state, which are employed to solve
Satisfiability (SAT) problems. We explore how to carry out the quantum circuits
by currently available ion-trap quantum computing technology.Comment: 14 pages, 6 figure
Computational Complexity for Physicists
These lecture notes are an informal introduction to the theory of
computational complexity and its links to quantum computing and statistical
mechanics.Comment: references updated, reprint available from
http://itp.nat.uni-magdeburg.de/~mertens/papers/complexity.shtm
- …