English
Related papers

Related papers: Two Slightly-Entangled NP-Complete Problems

200 papers

The operation of a source of entangled electron spins, based on a superconductor and two quantum dots in parallel\cite{loss}, is described in detail with the help of quantum master equations. These are derived including the main parasitic…

Mesoscale and Nanoscale Physics · Physics 2009-11-10 Olivier Sauret , Denis Feinberg , Thierry Martin

It is a fundamental, but still elusive question whether the schemes based on quantum mechanics, in particular on quantum entanglement, can be used for classical information processing and machine learning. Even partial answer to this…

Machine Learning · Statistics 2022-06-24 Yuhan Liu , Xiao Zhang , Maciej Lewenstein , Shi-Ju Ran

We compare the performance of randomized classical and quantum neural networks (NNs) as well as classical and quantum-classical hybrid convolutional neural networks (CNNs) for the task of supervised binary image classification. We keep the…

Quantum Physics · Physics 2025-11-24 Daniel Basilewitsch , João F. Bravo , Christian Tutschku , Frederick Struckmeier

Theoretical complexity is a vital subfield of computer science that enables us to mathematically investigate computation and answer many interesting queries about the nature of computational problems. It provides theoretical tools to assess…

Computational Complexity · Computer Science 2021-12-23 Mohamed Ghanem , Dauod Siniora

We present a general description of separable states in Quantum Mechanics. In particular, our result gives an easy proof that inseparabitity (or entanglement) is a pure quantum (noncommutative) notion. This implies that distinction between…

Quantum Physics · Physics 2007-05-23 Adam W. Majewski

In recent years, the entanglement spectra of quantum states have been identified to be highly valuable for improving our understanding on many problems in quantum physics, such as classification of topological phases, symmetry-breaking…

Quantum Physics · Physics 2019-06-04 Bin Cheng , Man-Hong Yung

The question of whether the complexity class P is equal to the complexity class NP has been a seemingly intractable problem for over 4 decades. It has been clear that if an algorithm existed that would solve the problems in the NP class in…

Computational Complexity · Computer Science 2015-06-04 Jason W. Steinmetz

We lay the foundations of a new theory for algorithms and computational complexity by parameterizing the instances of a computational problem as a moduli scheme. Considering the geometry of the scheme associated to 3-SAT, we separate P and…

Computational Complexity · Computer Science 2024-02-20 Ali Çivril

The detection and classification of entanglement properties in a two-qubit and a multi-qubit system is a topic of great interest. This topic has been extensively studied, and as a result, we discovered various approaches for detecting and…

Quantum Physics · Physics 2023-05-29 Anu Kumari

We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…

Quantum Physics · Physics 2021-11-30 Miguel Navascues , Flavio Baccari , Antonio Acin

Quantum entanglement reflects itself through non-local correlations among the subsystems of a quantum system. This thesis focuses on constructing a complete set of local invariants characterizing symmetric two qubit systems and analyzing…

Quantum Physics · Physics 2009-07-14 M. S. Uma

We introduce a purely geometric formulation for two different measures addressed to quantify the entanglement between different parts of a tripartite qubit system. Our approach considers the entanglement-polytope defined by the smallest…

Quantum Physics · Physics 2024-10-29 Salvio Luna-Hernandez , Marco Enriquez , Oscar Rosas-Ortiz

The behavior of any physical system is governed by its underlying dynamical equations. Much of physics is concerned with discovering these dynamical equations and understanding their consequences. In this work, we show that, remarkably,…

Quantum Physics · Physics 2015-05-18 Toby S. Cubitt , Jens Eisert , Michael M. Wolf

Entanglement measures quantify nonclassical correlations present in a quantum system, but can be extremely difficult to calculate, even more so, when information on its state is limited. Here, we consider broad families of entanglement…

Quantum Physics · Physics 2021-07-07 Matteo Fadel , Ayaka Usui , Marcus Huber , Nicolai Friis , Giuseppe Vitagliano

Entanglement is the quintessential quantum phenomenon and a necessary ingredient in most emerging quantum technologies, including quantum repeaters, quantum information processing (QIP) and the strongest forms of quantum cryptography. Spin…

Our investigation aims to study the specific role played by entanglement in the quantum computation process, by elaborating an entangled spin model developed within the 'hidden measurement approach' to quantum mechanics. We show that an…

Quantum Physics · Physics 2007-05-23 Diederik Aerts , Ellie D'Hondt , Bart D'Hooghe

Entanglement properties of driven quantum systems can potentially differ from the equilibrium situation due to long range coherences. We confirm this observation by studying a suitable toy model for mesoscopic transport~: the open quantum…

Statistical Mechanics · Physics 2023-10-24 Denis Bernard , Ludwig Hruza

Quantum entanglement lies at the heart of quantum mechanics in both fundamental and practical aspects. The entanglement of quantum states has been studied widely, however, the entanglement of operators has not been studied much in spite of…

We determine the computational power of preparing Projected Entangled Pair States (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks. While creating PEPS allows to…

Quantum Physics · Physics 2013-05-29 Norbert Schuch , Michael M. Wolf , Frank Verstraete , J. Ignacio Cirac

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…

Statistical Mechanics · Physics 2013-06-27 B. Hsu , C. R. Laumann , A. Laeuchli , R. Moessner , S. L. Sondhi