arXiv subjects

B. De Moor

Publications and source records attributed to B. De Moor.

8 recordsLinked to original sources

arXiv2005

Local unitary versus local Clifford equivalence of stabilizer states

We study the relation between local unitary (LU) equivalence and local Clifford (LC) equivalence of stabilizer states. We introduce a large subclass of stabilizer states, such that every two LU equivalent states in this class are necessarily LC equivalent. Together with earlier results, this shows that LC, LU and SLOCC equivalence are the same notions for this class of stabilizer states. Moreover, recognizing whether two given stabilizer states in the present subclass are locally equivalent only requires a polynomial number of operations in the number of qubits.

quant-ph↗

arXiv2005

Finite set of invariants to characterize local Clifford equivalence of stabilizer states

The classification of stabilizer states under local Clifford (LC) equivalence is of particular importance in quantum error-correction and measurement-based quantum computation. Two stabilizer states are called LC equivalent if there exists a local Clifford operation which maps the first state to the second. We present a finite set of invariants which completely characterizes the LC equivalence class of any stabilizer state. Our invariants have simple descriptions within the binary framework in which stabilizer states are usually described.

quant-ph↗

arXiv2002

Intelligence and Cooperative Search by Coupled Local Minimizers

We show how coupling of local optimization processes can lead to better solutions than multi-start local optimization consisting of independent runs. This is achieved by minimizing the average energy cost of the ensemble, subject to synchronization constraints between the state vectors of the individual local minimizers. From an augmented Lagrangian which incorporates the synchronization constraints both as soft and hard constraints, a network is derived wherein the local minimizers interact and exchange information through the synchronization constraints. From the viewpoint of neural networks, the array can be considered as a Lagrange programming network for continuous optimization and as a cellular neural network (CNN). The penalty weights associated with the soft state synchronization constraints follow from the solution to a linear program. This expresses that the energy cost of the ensemble should maximally decrease. In this way successful local minimizers can implicitly impose their state to the others through a mechanism of master-slave dynamics resulting into a cooperative search mechanism. Improved information spreading within the ensemble is obtained by applying the concept of small-world networks. This work suggests, in an interdisciplinary context, the importance of information exchange and state synchronization within ensembles, towards issues as evolution, collective behaviour, optimality and intelligence.

cs.AI↗

arXiv2002

Asymptotic Relative Entropy of Entanglement for Orthogonally Invariant States

For a special class of bipartite states we calculate explicitly the asymptotic relative entropy of entanglement $E_R^\infty$ with respect to states having a positive partial transpose (PPT). This quantity is an upper bound to distillable entanglement. The states considered are invariant under rotations of the form $O\otimes O$, where $O$ is any orthogonal matrix. We show that in this case $E_R^\infty$ is equal to another upper bound on distillable entanglement, constructed by Rains. To perform these calculations, we have introduced a number of new results that are interesting in their own right: (i) the Rains bound is convex and continuous; (ii) under some weak assumption, the Rains bound is an upper bound to $E_R^\infty$; (iii) for states for which the relative entropy of entanglement $E_R$ is additive, the Rains bound is equal to $E_R$.

quant-ph↗

arXiv2002

Four qubits can be entangled in nine different ways

We consider a single copy of a pure four-partite state of qubits and investigate its behaviour under the action of stochastic local quantum operations assisted by classical communication (SLOCC). This leads to a complete classification of all different classes of pure states of four-qubits. It is shown that there exist nine families of states corresponding to nine different ways of entangling four qubits. The states in the generic family give rise to GHZ-like entanglement. The other ones contain essentially 2- or 3-qubit entanglement distributed among the four parties. The concept of concurrence and 3-tangle is generalized to the case of mixed states of 4 qubits, giving rise to a seven parameter family of entanglement monotones. Finally, the SLOCC operations maximizing all these entanglement monotones are derived, yielding the optimal single copy distillation protocol.

quant-ph↗

arXiv2001

Optimizing Completely Positive Maps using Semidefinite Programming

Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc. Mathematically, this problem boils down to finding a completely positive trace-preserving (CPTP) linear map that maximizes the (mean) fidelity between the map itself and the desired transformation. In this note we want to draw attention to the fact that this problem belongs to the class of so-called semidefinite programming (SDP) problems. As SDP problems are convex, it immediately follows that they do not suffer from local optima. Furthermore, this implies that the numerical optimization of the CPTP map can, and should, be done using methods from the well-established SDP field, as these methods exploit convexity and are guaranteed to converge to the real solution. Finally, we show how the duality inherent to convex and SDP problems can be exploited to prove analytically the optimality of a proposed solution. We give an example of how to apply this proof method by proving the optimality of Hardy and Song's proposed solution for the universal qubit $θ$-shifter (quant-ph/0102100).

quant-ph↗

arXiv2001

The asymptotic relative entropy of entanglement

We present an analytical formula for the asymptotic relative entropy of entanglement for Werner states of arbitrary dimension. We then demonstrate its validity using methods from convex optimization. To our knowledge, this is the first case in which the value of a subadditive entanglement measure has been obtained in the asymptotic limit.

quant-ph↗

arXiv2000

Variational Characterisations of Separability and Entanglement of Formation

In this paper we develop a mathematical framework for the characterisation of separability and entanglement of formation (EoF) of general bipartite states. These characterisations are of the variational kind, meaning that separability and EoF are given in terms of a function which is to be minimized over the manifold of unitary matrices. A major benefit of such a characterisation is that it directly leads to a numerical procedure for calculating EoF. We present an efficient minimisation algorithm and an apply it to the bound entangled 3X3 Horodecki states; we show that their EoF is very low and that their distance to the set of separable states is also very low. Within the same variational framework we rephrase the results by Wootters (W. Wootters, Phys. Rev. Lett. 80, 2245 (1998)) on EoF for 2X2 states and present progress in generalising these results to higher dimensional systems.

quant-ph↗