Related papers: Tripartite entanglement and matrix inversion quant…
Entanglement is one of important resources for quantum communication tasks. Most of results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We firstly derive an…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement is explored for bi-partite and multi-partite pure and mixed states.…
We propose how to generate genuine multipartite entanglement of electron spin qubits in a chain of quantum dots using the naturally available single-qubit rotations and two-qubit Heisenberg exchange interaction in the system. We show that…
Maximally entangled states are of utmost importance to quantum communication, dense coding, and quantum teleportation. With a trapped ion placed inside a high finesse optical cavity, interacting with field of an external laser and quantized…
The Harrow-Hassidim-Lloyd (HHL) algorithm offers exponential speedup for solving the quantum linear-system problem. But some caveats for the speedup could be hard to met. One of the difficulties is the encoding bottleneck, i.e., the…
In this paper, we explore using the Harrow-Hassidim-Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing, utilizing the NWQSim simulation package on a high-performance computing platform. Focusing…
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…
Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…
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…
We investigate three superconducting flux qubits coupled in a loop. In this setup, tripartite entanglement can be created in a natural, controllable, and stable way. Both generic kinds of tripartite entanglement -the W type as well as the…
Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing. In a quantum network, photons interact with…
The entanglement among scattering particles in an exemplary quantum electrodynamics (QED) process is studied perturbatively. To increase the computational accuracy, we need to consider virtual photon loop diagrams, which lead to infrared…
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable -- a task referred to as the separability problem -- poses a…
A key problem in quantum information science is to determine optimal protocols for the interconversion of entangled states shared between remote parties. While for two parties a large number of results in this direction is available, the…
We calculate the topological entanglement entropy in bilayer quantum Hall systems, dividing the set of quantum numbers into four parts. This topological entanglement entropy allows us to draw a phase diagram in the parameter space of layer…
We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all…
Harrow-Hassidim-Lloyd algorithm (HHL) allows for the exponentially faster solution of a system of linear equations. However, this algorithm requires the postselection of an ancilla qubit to obtain the solution. This postselection makes the…
We consider quantum entanglement of three accelerating qubits, each of which is locally coupled with a real scalar field, without causal influence among the qubits or among the fields. The initial states are assumed to be the GHZ and W…
The degree of entanglement is determined for an arbitrary state of a broad class of PT-symmetric bipartite composite systems. Subsequently we quantify the rate with which entangled states are generated and show that this rate can be…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…