Related papers: Clustering in Hilbert space of a quantum optimizat…
We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem $k$-QSAT on large random graphs. As an approximation strategy, we optimize the solution…
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivalently, the problem is to decide whether a particular type of…
In quantum many-body systems with kinetically constrained dynamics, the Hilbert space can split into exponentially many disconnected subsectors, a phenomenon known as Hilbert-space fragmentation. We study the interplay of such fragmentation…
We study the structure of the solution space and behavior of local search methods on random 3-SAT problems close to the SAT/UNSAT transition. Using the overlap measure of similarity between different solutions found on the same problem…
Quantum kinetically constrained models have recently attracted significant attention due to their anomalous dynamics and thermalization. In this work, we introduce a hitherto unexplored family of kinetically constrained models featuring a…
We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic…
We study the phenomenon of Hilbert space fragmentation in isolated Hamiltonian and Floquet quantum systems using the language of commutant algebras, the algebra of all operators that commute with each term of the Hamiltonian or each gate of…
Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ)…
The configuration space, i.e. the Hilbert space, of compound quantum systems grows exponentially with the number of its subsystems: its dimensionality is given by the product of the dimensions of its constituents. Therefore a full quantum…
The quantum many-body bound-state problem in its computationally successful coupled cluster method (CCM) representation is reconsidered. In conventional practice one factorizes the ground-state wave functions $|\Psi\rangle= e^S…
Clustering is grouping of data by the proximity of some properties. We report on the possibility of increasing the efficiency of clustering of points in a plane using artificial quantum neural networks after the replacement of the two-level…
The restrictions that nature places on the distribution of correlations in a multipartite quantum system play fundamental roles in the evolution of such systems, and yield vital insights into the design of protocols for the quantum control…
Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is…
The $k$-QSAT problem is a quantum analog of the famous $k$-SAT constraint satisfaction problem. We must determine the zero energy ground states of a Hamiltonian of $N$ qubits consisting of a sum of $M$ random $k$-local rank-one projectors.…
Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in…
Most states in the Hilbert space are maximally entangled. This fact has proven useful to investigate - among other things - the foundations of statistical mechanics. Unfortunately, most states in the Hilbert space of a quantum many body…
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify…
A symmetric measure of quantum correlation based on the Hilbert-Schmidt distance is presented in this paper. For two-qubit states, we simplify considerably the optimization procedure so that numerical evaluation can be performed…
Classical satisfiability (SAT) and quantum satisfiability (QSAT) are complete problems for the complexity classes NP and QMA which are believed to be intractable for classical and quantum computers, respectively. Statistical ensembles of…
Quantum annealing aims at finding optimal solutions to complex optimization problems using a suitable quantum many body Hamiltonian encoding the solution in its ground state. To find the solution one typically evolves the ground state of a…