相关论文: Two Slightly-Entangled NP-Complete Problems

We quantify the resources required for entangling two uncoupled spin qubits through an intermediate mesoscopic spin system (MSS) by indirect joint measurement. Indirect joint measurement benefits from coherent magnification of the target…

Projected entangled pair states (PEPS) constitute a variational family of quantum states with area-law entanglement. PEPS are particularly relevant and successful for studying ground states of spatially local Hamiltonians. However,…

We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability. In each case,…

Ising machines are emerging as a new technology for solving various classes of computationally hard problems of practical importance, yet their limits on structured SAT workloads, representative of numerous real-world applications, remain…

Complexity classes such as $\#\mathbf{P}$, $\oplus\mathbf{P}$, $\mathbf{GapP}$, $\mathbf{OptP}$, $\mathbf{NPMV}$, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in…

Quantum information theory is plagued by the problem of regularisations, which require the evaluation of formidable asymptotic quantities. This makes it computationally intractable to gain a precise quantitative understanding of the…

We discuss the representation of the $SO(3)$ group by two-qubit maximally entangled states (MES). We analyze the correspondence between $SO(3)$ and the set of two-qubit MES which are experimentally realizable. As a result, we offer a new…

A new formulation called as entanglement measure for simplification, is presented to characterize genuine tripartite entanglement of $(2\times 2\times n)-$dimensional quantum pure states. The formulation shows that the genuine tripartite…

A fundamental motif in frustrated magnetism is the fully mutually coupled cluster of $N$ spins, with each spin coupled to every other spin. Clusters with $N=2$ and $3$ have been extensively studied as building blocks of square and…

Using powerful Multicanonical Ensemble Monte Carlo methods from statistical physics we explore the realization space of random K satisfiability (KSAT) in search for computational hard problems, most likely the 'hardest problems'. We search…

This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. In the first area, we demonstrate a polynomial-time…

We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system, made up of three quantum spins with frustrated pair interactions and affected by a hard sign problem…

A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…

This paper considers the following problem. Two mixed-state quantum circuits Q and R are given, and the goal is to determine which of two possibilities holds: (i) Q and R act nearly identically on all possible quantum state inputs, or (ii)…

Complexity of a quantum analogue of the satisfiability problem is studied. Quantum k-SAT is a problem of verifying whether there exists n-qubit pure state such that its k-qubit reduced density matrices have support on prescribed subspaces.…

The apparent difficulty in recovering classical nonlinear dynamics and chaos from standard quantum mechanics has been the subject of a great deal of interest over the last twenty years. For open quantum systems - those coupled to a…

Satisfying spin-assignments in triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this…

This article discusses the important primitives of Superposition and Entanglement in Quantum Information Processing from physics point of view. System of spin-1/2 particles has been considered which presents itself as a logical and…

We clarify the microscopic structure of the entangling quantum measurement superoperators and examine their possible physical realization in a simple three-qubit model, which implements the entangling quantum measurement with an arbitrary…

Here a finite-Lieb-lattice quantum computing circuit consisting of spin-1/2 quantum bits (qubits) and triplet couplers is designed. Important gradient - quantum entanglement - is analysed. This type of design could be realised in a vast…