相关论文: Computational complexity of the quantum separabili…
Tensor network states constitute an important variational set of quantum states for numerical studies of strongly correlated systems in condensed-matter physics, as well as in mathematical physics. This is specifically true for finitely…
Detection of entanglement through partial knowledge of the quantum state is a challenge to implement efficiently. Here we propose a separability criterion for detecting bipartite entanglement in arbitrary dimensional quantum states using…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
Parameterized complexity enables the practical solution of generally intractable NP-hard problems when certain parameters are small, making it particularly useful in real-world applications. The study of string problems in this framework…
Separability and entanglement for n-qubits systems are quantified by using Hilbert-Schmidt (HS) decompositions in which the density matrices are decomposed into various terms representing certain one qubit, two-qubits,and larger qubits…
We explore the set of unitary matrices characterized by a given structure in the context of their applications in the field of Quantum Information. In the first part of the Thesis we focus on classification of special classes of unitary…
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…
Physical transformations are described by linear maps that are completely positive and trace preserving (CPTP). However, maps that are positive (P) but not completely positive (CP) are instrumental to derive separability/entanglement…
Quantum mechanics is already 100 years old, but remains alive and full of challenging open problems. On one hand, the problems encountered at the frontiers of modern theoretical physics like Quantum Gravity, String Theories, etc. concern…
Identifying the $k$-partite entanglement and $k$-nonseparability of general $N$-partite quantum states are fundamental issues in quantum information theory. By use of computable inequalities of nonlinear operators, we present some simple…
An extension to computational mechanics complexity measure is proposed in order to tackle quantum states complexity quantification. The method is applicable to any $n-$partite state of qudits through some simple modifications. A Werner…
Quantum entanglement has been regarded as one of the key physical resources in quantum information sciences. However, the determination of whether a mixed state is entangled or not is generally a hard issue, even for the bipartite system.…
We revisit the relationship between quantum separability and the sign of the relative q-entropies of composite quantum systems. The q-entropies depend on the density matrix eigenvalues p_i through the quantity omega_q = sum_i p_i^q. Renyi's…
Separability is an important problem in theory of quantum entanglement. By using the Bloch representation of quantum states in terms of the Heisenberg-Weyl observable basis, we present a new separability criterion for bipartite quantum…
Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algorithms, notably tensor network algorithms, explicitly depends…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
Quantum computing is among the most far-reaching technologies of the 21st century, tackling challenges at the cutting edge of physics. This new paradigm in computer science harnesses quantum entanglement, one striking non-intuitive feature…
We discuss the problem of determining whether the state of several quantum mechanical subsystems is entangled. As in previous work on two subsystems we introduce a procedure for checking separability that is based on finding state…
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work…
Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles, like the superposition principle, entanglement, and interference. In this review we study the…