Related papers: Matrix realignment and partial transpose approach …
The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We first consider Grover's quantum search algorithm, noticing…
We present a framework for deciding whether a quantum state is separable or entangled using covariance matrices of locally measurable observables. This leads to the covariance matrix criterion as a general separability criterion. We…
We introduce a simple, experimentally realisable, entanglement manipulation protocol for exploring mixed state entanglement. We show that for both non-maximally entangled pure, and mixed polarisation-entangled two qubit states, an increase…
We study quantum entanglements induced on product states by the action of 8-vertex braid matrices, rendered unitary with purely imaginary spectral parameters (rapidity). The unitarity is displayed via the "canonical factorization" of the…
Multipartite entanglement is indispensable in the implementation of quantum technologies and the fundamental test of quantum mechanics. Here we study how the W state and W-like state may be generated in a quantum-dot array by controlling…
We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…
Quantum entanglement is a key resource for quantum technologies, including emerging ground-to-satellite quantum communication. In such a scenario, an important challenge to be overcome is to consider entanglement between two or more quantum…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
The partial transpose (PT) is an important function for entanglement testing and quantification and also for the study of geometrical aspects of the quantum state space. In this article, considering general bipartite and multipartite…
The relations of antilinear maps, bipartite states and quantum channels is summarized. Antilinear maps are applied to describe bipartite states and entanglement. Teleportation is treated in this general formalism with an emphasis on…
The characterization of a unitary gate is experimentally accomplished via Quantum Process Tomography, which combines the outcomes of different projective measurements to reconstruct the underlying operator. The process matrix is typically…
To any complex Hadamard matrix we associate a quantum permutation group. The correspondence is not one-to-one, but the quantum group encapsulates a number of subtle properties of the matrix. We investigate various aspects of the…
The advent of hybrid computing platforms consisting of quantum processing units integrated with conventional high-performance computing brings new opportunities for algorithm design. By strategically offloading select portions of the…
Given a unitary operator $U$ acting on a composite quantum system what is the entangling capacity of $U$? This question is investigated using a geometric approach. The entangling capacity, defined via metrics on the unitary groups, leads to…
Quantum entanglement is an enigmatic and powerful property that has attracted much attention due to its usefulness in new ways of communications, like quantum teleportation and quantum key distribution. Much effort has been done to quantify…
The partial oracles framework is a quantum search algorithm that has the potential to exceed the quadratic speedup of Grover's algorithm, up to a theoretical maximum of an exponential speedup. Until now, however, the framework has lacked an…
The partial scaling transform of the density matrix for multiqubit states is introduced to detect entanglement of quantum states. The transform contains partial transposition as a special case. The scaling transform corresponds to partial…
We investigate the genuine entanglement in tripartite systems based on partial transposition and the norm of correlation tensors of the density matrices. We first derive an analytical sufficient criterion to detect genuine entanglement of…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quadratic Unconstrained Binary Optimization (QUBO) is a general-purpose modeling framework for combinatorial optimization problems and is a requirement for quantum annealers. This paper utilizes the eigenvalue decomposition of the…