Related papers: Solving k-SAT problems with generalized quantum me…
A line of work initiated by Fortnow in 1997 has proven model-independent time-space lower bounds for the $\mathsf{SAT}$ problem and related problems within the polynomial-time hierarchy. For example, for the $\mathsf{SAT}$ problem, the…
We investigate the Quantum Zeno Effect in spin 1/2, spin 1 and spin 3/2 open quantum systems undergoing Rabi oscillations, revealing unexplored features for the spin 1 and spin 3/2 systems. The systems interact with an environment designed…
We propose a general, fully gate-based quantum algorithm for counterdiabatic driving. The algorithm does not depend on heuristics as in previous variational methods, and exploits regularisation of the adiabatic gauge potential to suppress…
Quantum advantage requires overcoming noise-induced degradation of quantum systems. Conventional methods for reducing noise such as error mitigation face scalability issues in deep circuits. Specifically, noise hampers the extraction of…
A general scheme is presented for controlling quantum systems using evolution driven by non-selective von Neumann measurements, with or without an additional tailored electromagnetic field. As an example, a 2-level quantum system controlled…
We present an algorithm for the generalized search problem (searching $k$ marked items among $N$ items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity $O(\sqrt{N/k})$ as the…
Optimizing over separable quantum objects is challenging for two key reasons: determining separability is NP-hard, and the dimensionality of the problem grows exponentially with the number of qubits. We address both challenges by…
We study and solve some variations of the random K-satisfiability problem - balanced K-SAT and biased random K-SAT - on a regular tree, using techniques we have developed earlier(arXiv:1110.2065). In both these problems, as well as…
In the quantum Zeno effect, quantum measurements can block the coherent oscillation of a two level system by freezing its state to one of the measurement eigenstates. The effect is conventionally controlled by the measurement frequency.…
In this paper, we show that the quantum Zeno effect occurs for any frequent quantum measurements or operations. As a result of the Zeno effect, for non-selective measurements (or trace preserving completely positive maps), the evolution of…
We investigate some examples of quantum Zeno dynamics, when a system undergoes very frequent (projective) measurements that ascertain whether it is within a given spatial region. In agreement with previously obtained results, the evolution…
Optimization problems such as the NP-complete 3-SAT provide an important benchmark for the difficult task of finding ground-states in strongly correlated many-body systems with rugged energy landscapes. The study of random 3-SAT problems as…
Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of F with high probability for constraint densities m/n<(1-eps_k)2^k\ln(k)/k,…
When tackling binary optimization problems using quantum algorithms, the conventional Ising representation and Quantum Approximate Optimization Algorithm (QAOA) encounter difficulties in efficiently handling errors for large-scale problems…
We introduce and explore a one-dimensional "hybrid" quantum circuit model consisting of both unitary gates and projective measurements. While the unitary gates are drawn from a random distribution and act uniformly in the circuit, the…
In the $k$-Cut problem, we are given an edge-weighted graph $G$ and an integer $k$, and have to remove a set of edges with minimum total weight so that $G$ has at least $k$ connected components. Prior work on this problem gives, for all $h…
While quantum simulation is one of the most promising applications of modern quantum devices, accessible simulation times are fundamentally limited by finite coherence times due to omnipresent noise. Based on the ideas of relational…
An extremely scalable linear-algebraic algorithm was developed for quantum material simulation (electronic state calculation) with 10$^8$ atoms or 100-nm-scale materials. The mathematical foundation is generalized shifted linear equations…
Satellite mission planning for Earth observation satellites is a combinatorial optimization problem that consists of selecting the optimal subset of imaging requests, subject to constraints, to be fulfilled during an orbit pass of a…
Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random $K$-satisfiability problem, generalizing the previous results to…