SearcharxivSearch

arXiv subjects

Albert Rico

Publications and source records attributed to Albert Rico.

14 recordsLinked to original sources

Robust certification of high-dimensional quantum devices

Certifying quantum behavior from classically accessible data is essential for secure communication and scalable quantum technologies. While powerful certification methods such as Bell nonlocality and quantum steering exist, their implementation typically requires entanglement or additional assumptions, and experimental demonstrations mainly focus on low-dimensional systems. In minimal prepare-and-measure scenarios, where a sender encodes information into quantum states and a receiver performs a single measurement, robust certification becomes particularly challenging, especially in the presence of noise and in higher-dimensional Hilbert spaces. Here, we propose, design, and experimentally implement a protocol that certifies quantumness between two distant parties without the need for preshared resources or measurement incompatibility. The experiments are carried out using the orbital angular momentum degrees of freedom of single photons, chosen for providing increased dimensionality that is scalable. We demonstrate the robustness of the protocol through rank-stability analysis of the observed correlations, which enables the certification of non-classicality even in the presence of noise. Our results provide a practical route to validate high-dimensional quantum communication systems and open new possibilities for secure and dimension-efficient quantum information processing.

quant-ph

Threshold entanglement sharing: quantum states with absolutely separable marginals

Motivated to understand how entanglement resources can be distributed in quantum networks, we introduce threshold entanglement (TE) states. These are multipartite quantum states whose entanglement across bipartitions forces all marginals of half or less local systems to be (absolutely) separable. First, in contrast to states used for quantum secret sharing, we demonstrate that TE states exist for four and seven qubits. Second, between four and nine qubits, we delimit the average entanglement that TE states must have by combining two semidefinite programming relaxations: (i) lower bounds on the minimal purity of pure state marginals, and (ii) upper bounds on the maximal purity of mixed absolutely separable states. Besides delimiting the existence regions of TE states, our approach independently improves the best known bounds on both of the above problems. Moreover, these improved bounds show that TE states of eight qubits cannot exist. Numerical evidence suggests that TE states accommodate significant amounts of entanglement and magic, which are resources needed for quantum advantage in quantum computing.

quant-ph

Bounding the entanglement of a state from its spectrum

We introduce a framework to upper bound the entanglement content of a bipartite quantum state from its spectrum alone. Using linear maps and their inverses, we derive rigorous constraints on the maximal entanglement that can be activated under global unitary transformations. We use as entanglement quantifiers the negativity and the Schmidt number; however, our framework is general and applies to any other entanglement measure. Our approach yields compact analytical sufficient criteria for bounding the entanglement of full-rank states in arbitrary dimensions and reveals new spectral constraints on Schmidt number witnesses.

quant-ph

Complete Hierarchies for the Geometric Measure of Entanglement

In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify entanglement by considering the distance of a quantum state to the set of product states. The underlying optimization problem occurs frequently in physics and beyond, for instance in the computation of the injective tensor norm in multilinear algebra. Here, we introduce a method to determine the maximal overlap of a pure multiparticle quantum state with product states based on considering several copies of the pure state. This leads to three types of hierarchical approximations to the problem, all of which we prove to converge to the actual value. Besides allowing for the computation of the geometric measure of entanglement, our results can be used to tackle optimizations over stochastic local transformations, to find entanglement witnesses for weakly entangled bipartite states, and to design strong separability tests for mixed multiparticle states. Finally, our approach sheds light on the complexity of separability tests.

quant-ph

Detection of many-body entanglement partitions in a quantum computer

We present a method to detect entanglement partitions of multipartite quantum systems, by exploiting their inherent symmetries. Structures like genuinely multipartite entanglement, $m$-separability and entanglement depth are detected as very special cases. This formulation enables us to characterize all the entanglement partitions of all three- and four- partite states and witnesses with unitary and permutation symmetry. In particular, we find and parametrize a complete set of bound entangled states therein. For larger systems, we provide a large family of analytical witnesses detecting many-body states of arbitrary size where none of the parties is separable from the rest. This method relies on weak Schur sampling with projective measurements, and thus can be implemented in a quantum computer. Beyond physics, our results extend to the mathematical literature: we establish new inequalities between matrix immanants, and characterize the set of such inequalities for matrices of size three and four.

quant-ph

Measuring multipartite entanglement efficiently by testing symmetries

Recently, a technique known as quantum symmetry test has gained increasing attention for detecting bipartite entanglement in pure quantum states. In this work we show that, beyond qualitative detection, a family of well-defined measures of bipartite and multipartite entanglement can be obtained with symmetry tests. We propose and benchmark several efficient methods to estimate these measures, and derive near-optimal sampling strategies for each. Despite the nonlinearity of the methods, we demonstrate that the sampling error scales no worse than $O(N_{\mathrm{tot}}^{-1/2})$ with the total number of copies $N_{\mathrm{tot}}$, which suggests experimental feasibility. By exploiting symmetries we compute our measures for large number of copies, and derive the asymptotic decay exponents for relevant states in many-body systems. Using these results we identify tradeoffs between estimation complexity and sensitivity of the presented entanglement measures, oriented to practical implementations.

quant-ph

Absolutely maximally entangled pure states of multipartite quantum systems

Absolutely maximally entangled (AME) pure states of a system composed of $N$ parties are distinguished by the property that for any splitting at least one partial trace is maximally mixed. Due to maximal possible correlations between any two selected subsystems these states have numerous applications in various fields of quantum information processing including multi-user teleportation, quantum error correction and secret sharing. We present an updated survey of various techniques to generate such strongly entangled states, including those going beyond the standard construction of graph and stabilizer states. Our contribution includes, in particular, analysis of the degree of entanglement of reduced states obtained by partial trace of AME projectors, states obtained by a symmetric superposition of GHZ states, an orthogonal frequency square representation of the "golden" AME state and an updated summary of the number of local unitary equivalence classes.

quant-ph

Quantum Advantage in Identifying the Parity of Permutations with Certainty

We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is limited to random guessing. Quantum mechanics does it with certainty with as few as $\lceil \sqrt{n}\, \rceil$ distinguishable states per particle, thanks to entanglement. Below this threshold, not even quantum mechanics helps: both classical and quantum success are limited to random guessing. For small $n$, we provide explicit expressions for states that ensure perfect parity identification. We also assess the minimum entanglement these states need to carry, finding it to be close to maximal, and even maximal in some cases. The task requires no oracles or contrived setups and provides a simple, rigorous example of genuine quantum advantage.

quant-ph

Entanglement and distillation from symmetric positive maps

Recently, a toolkit of highly symmetric techniques employing matrix inequalities has been developed to detect entanglement in various ways. Here we unifiedly explain in detail these methods, and expand them to a new family of positive maps with further detection capabilities. In the simplest case, we generalize the reduction map to detect more generic states using both multiple copies and local filters. Through the Choi-Jamio{\l}kowski isomorphism, this family of maps leads to a construction of multipartite entanglement witnesses. Discussions and examples are provided regarding the detection of states with local positive partial transposition and the use of multiple copies.

quant-ph

State-witness contraction

We construct both nonlinear and linear entanglement witnesses, by tensoring and partial tracing existing states and witnesses. We show that little shared quantum resources allow to employ decomposable witnesses to obtain larger ones detecting locally undistillable states, and find analytic witnesses for multipartite entangled states that are undistillable across all bipartitions. Crucially, we show how to efficiently optimize multicopy witnesses to desired states, which is a current challenge. As an example of both theoretical and experimental interest, existing trace polynomial witnesses are significantly improved while preserving their symmetries and implementability with randomized measurements. Besides detecting entanglement, we also find new witnesses detecting $k$-copy distillability. A recipe for the single-copy case is shown to be effective for generic and Werner states.

quant-ph

Channel nonlocality under decoherence

The implementation of realistic quantum devices requires a solid understanding of the nonlocal resources present in quantum channels, and the effects of decoherence on them. Here we quantify nonlocality of bipartite quantum channels and identify its component resisting the effects of dephasing noise. Despite its classical nature, we demonstrate that the latter plays a relevant role in performing quantum protocols, such as state transformations and quantum coding for noisy communication. In the converse direction, we show that simulating certain stochastic processes with quantum channels undergoing decoherence has a communication advantage with respect to their classical simulation.

quant-ph

Certifying nonlocal properties of noisy quantum operations

Certifying quantum properties from the probability distributions they induce is an important task for several purposes. While this framework has been largely explored and used for quantum states, its extrapolation to the level of channels started recently in a variety of approaches. In particular, little is known about to what extent noise can spoil certification methods for channels. In this work we provide a unified methodology to certify nonlocal properties of quantum channels from the correlations obtained in prepare-and-measurement protocols: our approach gathers fully and semi-device-independent existing methods for this purpose, and extends them to new certification criteria. In addition, the effect of different models of dephasing noise is analysed. Some noise models are shown to generate nonlocality and entanglement in special cases. In the extreme case of complete dephasing, the measurement protocols discussed yield particularly simple tests to certify nonlocality, which can be obtained from known criteria by fixing the dephasing basis. These are based on the relations between bipartite quantum channels and their classical analogues: bipartite stochastic matrices defining conditional distributions.

quant-ph

Discrete dynamics in the set of quantum measurements

A quantum measurement, often referred to as positive operator-valued measurement (POVM), is a set of positive operators $P_j=P_j^\dag\geq 0$ summing to identity, $\sum_jP_j=\mathbb{1}$. This can be seen as a generalization of a probability distribution of positive real numbers summing to unity, whose evolution is given by a stochastic matrix. We describe discrete transformations in the set of quantum measurements by {\em blockwise stochastic matrices}, composed of positive blocks that sum columnwise to identity, using the notion of {\em sequential product} of matrices. We show that such transformations correspond to a sequence of quantum measurements. Imposing additionally the dual condition that the sum of blocks in each row is equal to identity, we arrive at blockwise bistochastic matrices (also called {\em quantum magic squares}). Analyzing their dynamical properties, we formulate our main result: a quantum analog of the Ostrowski description of the classical Birkhoff polytope, which introduces the notion of majorization between quantum measurements. Our framework provides a dynamical characterization of the set of blockwise bistochastic matrices and establishes a resource theory in this set.

quant-ph

Entanglement detection with trace polynomials

We provide a systematic method for nonlinear entanglement detection based on trace polynomial inequalities. In particular, this allows to employ multi-partite witnesses for the detection of bipartite states, and vice versa. We identify witnesses for which linear detection of an entangled state fails, but for which nonlinear detection succeeds. With the trace polynomial formulation a great variety of witnesses arise from immamant inequalities, which can be implemented in the laboratory through randomized measurements.

quant-ph