Related papers: Canonical Decompositions of n-qubit Quantum Comput…
We introduce the discording power of a unitary transformation, which assesses its capability to produce quantum discord, and analyze in detail the generation of discord by relevant classes of two-qubit gates. Our measure is based on the…
A method allowing to increase a computational efficiency of evaluation of non-local characteristics of a pair of qubits is described. The method is based on the construction of coordinates on a generic section of 2-qubit's entanglement…
We consider the possibility of performing linear optical quantum computation making use of extra photonic degrees of freedom. In particular we focus on the case where we use photons as quadbits. The basic 2-quadbit cluster state is a…
We provide several applications of a previously introduced isomorphism between physical operations acting on two systems and entangled states [1]. We show: (i) how to implement (weakly) non-local two qubit unitary operations with a small…
Quantum error correction (QEC) is an essential step towards realising scalable quantum computers. Theoretically, it is possible to achieve arbitrarily long protection of quantum information from corruption due to decoherence or imperfect…
We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates…
We study the relative strength of classical and quantum correlations, as measured by discord, for two-qubit states. Quantum correlations appear only in the presence of classical correlations, while the reverse is not always true. We…
In this work, we study the computational complexity of quantum determinants, a $q$-deformation of matrix permanents: Given a complex number $q$ on the unit circle in the complex plane and an $n\times n$ matrix $X$, the $q$-permanent of $X$…
Quantum phases of naturally-occurring systems exhibit distinctive collective phenomena as manifestation of their many-body correlations, in contrast to our persistent technological challenge to engineer at will such strong correlations…
We study the derived category of the moduli space $SU_C(2)$ of rank $2$ vector bundles on a smooth projective curve $C$ of genus $g\ge 2$ with trivial determinant. This generalizes the recent work by Tevelev and Torres on the case with…
We analyze, from a quantum information theory perspective, the possibility of realizing a SU(4) entangled Kondo regime in semiconductor double quantum dot devices. We focus our analysis on the ground state properties and consider the…
Recently de La Torre et al. [1] reconstructed Quantum Theory from its local structure on the basis of local discriminability and the existence of a one-parameter group of bipartite transformations containing an entangling gate. This result…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
We prove a generalization of the quantum de Finetti theorem when the local space is an infinite-dimensional Fock space. In particular, instead of considering the action of the permutation group on $n$ copies of that space, we consider the…
We study the entanglement of unitary operators on $d_1\times d_2$ quantum systems. This quantity is closely related to the entangling power of the associated quantum evolutions. The entanglement of a class of unitary operators is quantified…
We propose a general scheme to measure the concurrence of an arbitrary two-qubit pure state in atomic systems. The protocol is based on one- and two-qubit operations acting on two available copies of the bipartite system, and followed by a…
In this paper, we build upon the model of two-party quantum computation introduced by Salvail et al. [SSS09] and show that in this model, only trivial correct two-party quantum protocols are weakly self-composable. We do so by defining a…
We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with $8 \leq d \leq 32$. Each system serves to store one logical qubit…
We discuss the role of the broken symmetries in the connection of the shell, collective and cluster models. The cluster-shell competition is described in terms of cold quantum phases. Stable quasi-dynamical U(3) symmetry is found for…
We ask whether there are fundamental limits on storing quantum information reliably in a bounded volume of space. To investigate this question, we study quantum error correcting codes specified by geometrically local commuting constraints…