arXiv subjects

Gerard Anglès Munné

Publications and source records attributed to Gerard Anglès Munné.

8 recordsLinked to original sources

arXiv2026

Entangling a quantum system to disentangle its parts

In quantum systems, correlations are subject to monogamy relations between the whole and its parts. In particular, entanglement between two sets of particles constrains the entanglement within each set and viceversa. This raises the following question: In a multipartite quantum system, can global correlations disentangle all subsystems of certain size? By exploiting unitary symmetries, we formulate this question as a spectral marginal problem, namely the existence of $n$-qubit pure states whose marginals below a threshold cannot be entangled by any unitary evolution. We call such states threshold entanglement sharing (TES) states. We provide constructive existence proofs and bound the marginal sizes for up to 200 qubits. Further, we show that TES states contain both entanglement and magic, the main resources for quantum computing. Our proof strategy bridges techniques that were treated separately up to date, and independently resolves two open problems in quantum information theory: maximal multipartite entanglement and maximum purity of absolutely separable states.

quant-ph↗

arXiv2026

Holographic quantum codes with trapped ions

Holography is a central concept at the intersection of gravity, condensed matter theory, and quantum information, linking the interior bulk of a system to its boundary. A model realizing key features of holographic systems is the holographic pentagon code by Pastawski et al. Here we experimentally implement instances of the holographic pentagon and heptagon codes with trapped ions and test their properties: For the pentagon code, we recover logical bulk qubits from their nearby boundary and test the Ryu-Takayanagi entanglement area law. For the heptagon code, we show that the transversal Hadamard gate native to the constituent Steane codes induces a single-qubit, correctable error in the holographic code. Our implementation paves the way towards the use of holographic quantum codes for quantum information processing.

quant-ph↗

arXiv2026

Typicality of Steering for Two-qubit States

Phenomena that slip beyond the grasp of our classical intuition reveal uniquely quantum effects that deepen our understanding of the physical world and enable advances in information processing, particularly in quantum communication and computation. One such phenomenon is quantum steering, whereby measurements performed by one party influence the conditional states of another when the two share an entangled quantum system. If the observed correlations cannot be explained by a local hidden state model, the state is said to be steerable. In this work, we investigate the typicality of this behavior: given a generic two-qubit state and $m$ Haar-random projective measurements, what is the probability of observing steering? We derive analytical expressions for the steering probability $\mathcal{P}_S$ of Werner states in two- and three-setting scenarios, the latter restricted to coplanar projective measurements on the Bloch sphere. For larger numbers of settings and various random states ensembles, we perform numerical analyses showing that $\mathcal{P}_S$ increases systematically with the number of measurements and substantially exceeds the corresponding probabilities associated with Bell nonlocality. Our results demonstrate that random states with minimal environmental coupling exhibit a high probability of steering for finite $m$ and approach genuine typicality, $\mathcal{P}_S=100\%$, as the number of settings increases. We provide a detailed characterization of $\mathcal{P}_S$ across different state ensembles and specific families, including Bell-diagonal and Werner states, identifying those with the greatest non-classical potential and highlighting their relevance for protocols in which steering serves as a key resource.

quant-ph↗

arXiv2026

Combining moment matrices, symmetric extension, and Lovász theta: $Φ_{\text{E8}}$ is entangled

We solve an open problem in entanglement theory posed by Yu et al., {\it Nature Communications 12, 1012 (2021)}. The problem is to show, via an entanglement witness, that the $14$-qubit state $Φ_{\text{E8}}$ is entangled. Inspired by a method from quantum codes, we combine symmetric extension with moment matrices to prove that $Φ_{\text{E8}}$ is entangled. The proof has the form of a rational infeasibility certificate for a semidefinite program, yielding an explicit entanglement witness. Our approach unifies and extends several earlier methods that involve the Lovász theta number of the Pauli anti-commutativity graph, promising scalability and flexibility in further applications.

quant-ph↗

arXiv2026

The Richness of Bell Nonlocality: Generalized Bell Polygamy and Hyper-Polygamy

Non-classical quantum correlations underpin both the foundations of quantum mechanics and modern quantum technologies. Among them, Bell nonlocality is a central example. For bipartite Bell inequalities, nonlocal correlations obey strict monogamy: a violation of one inequality precludes violations of other inequalities on the overlapping subsystems. In the multipartite setting, however, Bell nonlocality becomes inherently polygamous. This was previously shown for subsystems obtained by removing a single particle from an $N$-partite system. Here, we generalize this result to arbitrary $(N-k)$-partite subsystems. We demonstrate that a single $N$-qubit state can violate all $\binom{N}{k}$ relevant Bell inequalities simultaneously. We further construct an $N$-qubit Bell inequality, obtained by symmetrizing the $(N-k)$-qubit ones, that is maximally violated by states exhibiting this generalized polygamy. We compare these violations with those achievable by GHZ states and show that polygamy offers an advantage in multipartite scenarios, providing new insights into scalable certification of non-classicality in quantum devices. Our analysis relies on symmetry properties of the MABK inequalities. Finally, we show that this behavior can occur across multiple subsystem sizes, a phenomenon we call hyper-polygamy. These structures reveal the remarkable abundance of nonlocality present in multipartite quantum states and offer perspectives for their applications in quantum technologies.

quant-ph↗

arXiv2026

SDP bounds on quantum codes: rational certificates

A fundamental problem in quantum coding theory is to determine the maximum size of quantum codes of given block length and distance. A recent work introduced bounds based on semidefinite programming, strengthening the well-known quantum linear programming bounds. However, floating-point inaccuracies prevent the extraction of rigorous non-existence proofs from the numerical methods. Here, we address this by providing rational infeasibility certificates for a range of quantum codes. Using a clustered low-rank solver with heuristic rounding to algebraic expressions, we can improve upon $18$ upper bounds on the maximum size of $n$-qubit codes with $6 \leq n \leq 19$. Our work highlights the practicality and scalability of semidefinite programming for quantum coding bounds.

quant-ph↗

arXiv2025

SDP bounds on quantum codes

This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\!(n, K, δ)\!)_2$ code exists if and only if every level of the hierarchy is feasible. It is not limited to stabilizer codes and thus is applicable generally. While the machinery is formally dimension-free, we restrict it to qubit codes through quasi-Clifford algebras. We derive the quantum analog of a range of classical results: first, from an intermediate level a Lovász bound for self-dual quantum codes is recovered. Second, a symmetrization of a minor variation of this Lovász bound recovers the quantum Delsarte bound. Third, a symmetry reduction using the Terwilliger algebra leads to semidefinite programming bounds of size $O(n^4)$. With this we give an alternative proof that there is no $(\!(7, 1, 4)\!)_2$ quantum code, and show that $(\!(8, 9, 3)\!)_2$ and $(\!(10, 5, 4)\!)_2$ codes do not exist.

quant-ph↗

arXiv2024

Engineering holography with stabilizer graph codes

The discovery of holographic codes established a surprising connection between quantum error correction and the anti-de Sitter-conformal field theory correspondence. Recent technological progress in artificial quantum systems renders the experimental realization of such holographic codes now within reach. Formulating the hyperbolic pentagon code in terms of a stabilizer graph code, we give gate sequences that are tailored to systems with long-range interactions. We show how to obtain encoding and decoding circuits for the hyperbolic pentagon code, before focusing on a small instance of the holographic code on twelve qubits. Our approach allows to verify holographic properties by partial decoding operations, recovering bulk degrees of freedom from their nearby boundary.

quant-ph↗