Related papers: Two Slightly-Entangled NP-Complete Problems
Entanglement is a fascinating feature of quantum mechanics and a key ingredient in most quantum information processing tasks. Yet the generation of entanglement is usually hampered by undesired dissipation owing to the inevitable coupling…
We characterize the multipartite entanglement of a system of n qubits in terms of the distribution function of the bipartite purity over balanced bipartitions. We search for maximally multipartite entangled states, whose average purity is…
We investigate the behavior of genuine multipartite entanglement of paradigmatic frustrated quantum spin systems. We consider six different spin models, whose frustration ranges from being very high to very low. We find that the highly…
One of the crucial differences between mathematical models of classical and quantum mechanics is the use of the tensor product of the state spaces of subsystems as the state space of the corresponding composite system. (To describe an…
Neutron scattering is frequently used to look for evidence of features indicative of quantum-entangled phases of matter such as continua from fractionalisation or quantised excitations. However, the non-specificity of these features and…
An accurate calculation of the properties of quantum many-body systems is one of the most important yet intricate challenges of modern physics and computer science. In recent years, the tensor network ansatz has established itself as one of…
The spin of a single electron confined in a semiconductor quantum dot is a natural qubit candidate. Fundamental building blocks of spin-based quantum computing have been demonstrated in double quantum dots with significant spin-orbit…
Is entanglement an exclusive feature of quantum systems, or is it common to all non-classical theories? And if this is the case, how strong is quantum mechanical entanglement as compared to that exhibited by other theories? The first part…
Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
Going as far as possible at SAT problem solving is the main aim of our work. For this sake we have made use of quantum computing from its two, on practice, main models of computation. They have required some reformulations over the former…
There is currently a tremendous interest in developing practical applications of NISQ processors without the overhead required by full error correction. Quantum information processing is especially challenging within the gate model, as…
In this paper the reason why entropy reduction (negentropy) can be used to measure the complexity of any computation was first elaborated both in the aspect of mathematics and informational physics. In the same time the equivalence of…
A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems…
Realizable spin models are investigated in a two superconducting flux qubit system. It is shown that a specific adjustment of system parameters in the two flux qubit system makes it possible to realize an artificial two-spin system that…
Identical particles and entanglement are both fundamental components of quantum mechanics. However, when identical particles are condensed in a single spatial mode, the standard notions of entanglement, based on clearly identifiable…
In this thesis, we study about three subjects 1- Classical simulation of two spin-$s$ singlet correlations for all $s$ involving spin measurements, 2- Quantum correlations in successive single spin measurements, 3- Non locality without…
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite program ofvpolynomial size (unless P=NP), a method that has been successful in more restricted quantum games. More precisely, we show that…
The electron spin state of a singly charged semiconductor quantum dot has been shown to form a suitable single qubit for quantum computing architectures with fast gate times. A key challenge in realizing a useful quantum dot quantum…
We present an analysis of the entangling quantum kicked top focusing on the few qubit case and the initial condition dependence of the time-averaged entanglement $S_Q$ for spin-coherent states. We show a very strong connection between the…