arXiv subjects

Daniel Alsina

Publications and source records attributed to Daniel Alsina.

7 recordsLinked to original sources

arXiv2023

Local hidden variable values without optimization procedures

The problem of computing the local hidden variable (LHV) value of a Bell inequality plays a central role in the study of quantum nonlocality. In particular, this problem is the first step towards characterizing the LHV polytope of a given scenario. In this work, we establish a relation between the LHV value of bipartite Bell inequalities and the mathematical notion of excess of a matrix. Inspired by the well developed theory of excess, we derive several results that directly impact the field of quantum nonlocality. We show infinite families of bipartite Bell inequalities for which the LHV value can be computed exactly, without needing to solve any optimization problem, for any number of measurement settings. We also find tight Bell inequalities for a large number of measurement settings.

quant-ph↗

arXiv2020

Absolutely maximally entangled states, quantum maximum distance separable codes, and quantum repeaters

We extend the relation between absolutely maximally entangled (AME) states and quantum maximum distance separable (QMDS) codes by constructing whole families of QMDS codes from their parent AME states. We introduce a reduction-friendly form for the generator set of the stabilizer representation of an AME state, from which the stabilizer form for children codes, all QMDS, can be obtained. We then relate this to optimal codes for one-way quantum repeaters, by minimizing the short-term infrastructure cost as well as the long-term running cost of such quantum repeaters. We establish that AME states provide a framework for a class of QMDS codes that can be used in quantum repeaters.

quant-ph↗

arXiv2017

PhD thesis: Multipartite entanglement and quantum algorithms

PhD thesis dealing with various aspects of multipartite entanglement, such as entanglement measures, absolutely maximally entangled states, bell inequalities, entanglement spectrum and quantum frustration. Also some quantum algorithms run with the IBM quantum computer are covered, together with others applied to adiabatic quantum computation and quantum thermodynamics.

quant-ph↗

arXiv2016

Operational approach to Bell inequalities: applications to qutrits

Bell inequalities can be studied both as constraints in the space of probability distributions and as expectation values of multipartite operators. The latter approach is particularly useful when considering outcomes as eigenvalues of unitary operators. This brings the possibility of exploiting the complex structure of the coefficients in the Bell operators. We investigate this avenue of though in the known case of two outcomes, and find new Bell inequalities for the cases of three outcomes and $n=3,4,5$ and $6$ parties. We find their corresponding classical bounds and their maximum violation in the case of qutrits. We further propose a novel way to generate Bell inequalities based on a mapping from maximally entangled states to Bell operators and produce examples for different outcomes and number of parties.

quant-ph↗

arXiv2016

Experimental test of Mermin inequalities on a 5-qubit quantum computer

Violation of Mermin inequalities is tested on the 5-qubit IBM quantum computer. For 3, 4 and 5 parties, quantum states that violate the corresponding Mermin inequalities are constructed using quantum circuits on superconducting qubits. Measurements on different basis are included as additional final gates in the circuits. The experimental results obtained using the quantum computer show violation of all Mermin inequalitites, with a clear degradation of the results in the 5 qubit case. Though this quantum computer is not competitive to test Mermin inequalities as compared to other techniques when applied to few qubits, it does offer the opportunity to explore multipartite entanglement for four and five qubits beyond the reach of other alternative technologies.

quant-ph↗

arXiv2015

Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices

Absolutely Maximally Entangled (AME) states are those multipartite quantum states that carry absolute maximum entanglement in all possible partitions. AME states are known to play a relevant role in multipartite teleportation, in quantum secret sharing and they provide the basis novel tensor networks related to holography. We present alternative constructions of AME states and show their link with combinatorial designs. We also analyze a key property of AME, namely their relation to tensors that can be understood as unitary transformations in every of its bi-partitions. We call this property multi-unitarity.

quant-ph↗

arXiv2013

Tensor networks for frustrated systems: emergence of order from simplex entanglement

We consider a frustrated anti-ferromagnetic triangular lattice Hamiltonian and show that the properties of the manifold of its degenerated ground state are represented by a novel type of tensor networks. These tensor networks are not based on ancillary maximally entangled pairs, but rather on triangular W-like simplices. Anti-ferromagnetic triangular frustration is then related to ancillary W-states in contrast to ferromagnetic order which emerges from the contraction of GHZ-like triangular simplices. We further discuss the outwards entangling power of various simplices. This analysis suggests the emergence of distinct macroscopic types of order from the classification of entanglement residing on the simplices that define a tensor network.

quant-ph↗