相关论文: Tailoring Many-Body Interactions to Solve Hard Com…
When solving propositional logic satisfiability (specifically 3SAT) using quantum annealing, we analyze the effect the difficulty of different instances of the problem has on the quality of the answer returned by the quantum annealer. A…
3SAT instances need to be transformed into instances of Quadratic Unconstrained Binary Optimization (QUBO) to be solved on a quantum annealer. Although it has been shown that the choice of the 3SAT-to-QUBO transformation can impact the…
In signed k-SAT problems, one fixes a set M and a set $\mathcal S$ of subsets of M, and is given a formula consisting of a disjunction of m clauses, each of which is a conjunction of k literals. Each literal is of the form "$x \in S$",…
Inspired by biological molecular machines we explore the idea of an active quantum robot whose purpose is delaying decoherence. A conceptual model capable of partially protecting arbitrary logical qubit states against single physical qubit…
A deep-learning approach to optimize the selection of Slater determinants in configuration interaction calculations for condensed-matter quantum many-body systems is developed. We exemplify our algorithm on the discrete version of the…
Suppose we have a small quantum computer with only M qubits. Can such a device genuinely speed up certain algorithms, even when the problem size is much larger than M? Here we answer this question to the affirmative. We present a hybrid…
A solution to a 3-satisfiability (3-SAT) formula can be expanded into a cluster, all other solutions of which are reachable from this one through a sequence of single-spin flips. Some variables in the solution cluster are frozen to the same…
Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of the SAT problem, as it is known, require efficient solution…
We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA). Our approach…
Three-body systems of scalar bosons are described in the framework of relativistic constraint dynamics. With help of a change of variables followed by a change of wave function, two redundant degrees of freedom get eliminated and the…
An algorithm is given for finding the solutions to 3SAT problems. The algorithm uses Bienstock's reduction from 3SAT to existence of induced odd cycle of length greater than three, passing through a prescribed node in the constructed graph.…
We introduce a highly structured family of hard satisfiable 3-SAT formulas corresponding to an ordered spin-glass model from statistical physics. This model has provably "glassy" behavior; that is, it has many local optima with large energy…
The regular structures obtained by optical lattice technology and their behaviour are analysed from the quantum information perspective. Initially, we demonstrate that a triangular optical lattice of two atomic species, bosonic or…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
The Boolean satisfiability problem (SAT), in particular 3SAT with its bounded clause size, is a well-studied problem since a wide range of decision problems can be reduced to it. Due to its high complexity, examining potentials of quantum…
The solution space of many classical optimization problems breaks up into clusters which are extensively distant from one another in the Hamming metric. Here, we show that an analogous quantum clustering phenomenon takes place in the ground…
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satisfiability problems for…
A generic procedure is proposed to construct many-body quantum Hamiltonians with partial dynamical symmetry. It is based on a tensor decomposition of the Hamiltonian and allows the construction of a hierarchy of interactions that have…
The quantum mechanics formalism introduced new revolutionary concepts challenging our everyday perceptions. Arguably, quantum entanglement, which explains correlations that cannot be reproduced classically, is the most notable of them.…
We explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large scale classical diagonalization of the nuclear shell model have reached sizes of $10^9 - 10^{10}$ basis states, but are…