<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Marco Túlio Quintino | LIP6 - Équipe QI</title><link>https://qi.lip6.fr/fr/people/marco-tulio-quintino/</link><atom:link href="https://qi.lip6.fr/fr/people/marco-tulio-quintino/index.xml" rel="self" type="application/rss+xml"/><description>Marco Túlio Quintino</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>fr</language><copyright>© 2022 LIP6 Quantum Information Team</copyright><lastBuildDate>Fri, 03 Jul 2026 00:00:00 +0000</lastBuildDate><image><url>https://qi.lip6.fr/fr/people/marco-tulio-quintino/avatar_hu_60928c55f397a9c.jpg</url><title>Marco Túlio Quintino</title><link>https://qi.lip6.fr/fr/people/marco-tulio-quintino/</link></image><item><title>Can every set of incompatible measurements lead to genuine multipartite steering?</title><link>https://qi.lip6.fr/fr/publication/5679738-can-every-set-of-incompatible-measurements-lead-to-genuine-multipartite-steering/</link><pubDate>Fri, 03 Jul 2026 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5679738-can-every-set-of-incompatible-measurements-lead-to-genuine-multipartite-steering/</guid><description>&lt;p&gt;Measurement incompatibility and bipartite quantum steering are known to display a strong connection: a set of measurements is incompatible if and only if it can lead to bipartite steering. Despite such a close link between these concepts in bipartite scenarios, little is known in the multipartite setting, where notions of genuine multipartite correlations play major roles. In this work we prove that, as in the bipartite case, incompatibility is also necessary and sufficient for genuine multipartite steering in any multipartite scenario with a single uncharacterised party. Interestingly, genuine multipartite steering can be extracted from any set of incompatible measurements using states which are not SLOCC equivalent, such as GHZ and W states. In contrast, we prove that this result does not hold in scenarios with more than one uncharacterised party, by presenting a set of incompatible measurements that can never lead to genuine multipartite steering in these cases. In order to obtain our main results, we introduce methods tailored for multipartite correlations, paving the way to understanding the role of measurement incompatibility beyond bipartite scenarios.&lt;/p&gt;</description></item><item><title>Composable simultaneous purification: when all communication scenarios reduce to spatial correlations</title><link>https://qi.lip6.fr/fr/publication/5543334-composable-simultaneous-purification-when-all-communication-scenarios-reduce-to-spatial-correlations/</link><pubDate>Mon, 09 Mar 2026 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5543334-composable-simultaneous-purification-when-all-communication-scenarios-reduce-to-spatial-correlations/</guid><description>&lt;p&gt;Bell non-locality is a powerful framework to distinguish classical, quantum and post-quantum resources, which relies on non-communicating players. Under which restriction can we have the same separations, if we allow for communication? Non-signalling state assemblages, and the fact that they can always be simultaneously purified, turned out to be the key element to restrict the simplest bipartite communication scenario, the prepare-and-measure, to the standard bipartite Bell scenario. Yet, many distinctive features of quantum theory are genuinely multipartite and cannot be reduced to two-party behaviour. In this work we are interested in extending this simultaneous purification inspired result to all multipartite communication schemes. As a first step, we unify and extend the simultaneous purification result from states to instruments and super-instruments, which are composable structures, and open up the possibility to explore more complex communication scenarios. Our main contribution is to establish that arbitrary compositions of non-signalling assemblages cannot escape the standard spatial quantum Bell correlations set. As a consequence, any interactive quantum realization of correlations outside of this set must involve at least one signalling assemblage of quantum operations, even when the resulting correlations are non-signalling.&lt;/p&gt;</description></item><item><title>Higher-order quantum computing with known input states</title><link>https://qi.lip6.fr/fr/publication/5416562-higher-order-quantum-computing-with-known-input-states/</link><pubDate>Mon, 15 Dec 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5416562-higher-order-quantum-computing-with-known-input-states/</guid><description>&lt;p&gt;88 pages, 27 figures. A concise overview of the main results is provided in the Sec. 2 (Summary of main results) for a quick read&lt;/p&gt;</description></item><item><title>Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits</title><link>https://qi.lip6.fr/fr/publication/5409958-exponential-separation-in-quantum-query-complexity-of-the-quantum-switch-with-respect-to-simulations-with-standard-quantum-circuits/</link><pubDate>Wed, 10 Dec 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5409958-exponential-separation-in-quantum-query-complexity-of-the-quantum-switch-with-respect-to-simulations-with-standard-quantum-circuits/</guid><description>&lt;p&gt;Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch &amp;ndash; the simplest such example &amp;ndash; has been shown to provide numerous information-processing advantages. Here, we prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically and exactly by any causally ordered quantum circuit that uses $M$ calls to one channel and one call to the other, if $M \leq \max(2, 2^n-1)$. This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits.&lt;/p&gt;</description></item><item><title>Simulating the quantum switch with quantum circuits is computationally hard</title><link>https://qi.lip6.fr/fr/publication/5409308-simulating-the-quantum-switch-with-quantum-circuits-is-computationally-hard/</link><pubDate>Thu, 20 Nov 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5409308-simulating-the-quantum-switch-with-quantum-circuits-is-computationally-hard/</guid><description>&lt;p&gt;Higher-order transformations acting on input quantum channels in an indefinite causal order—such as the quantum switch—cannot be described by quantum circuits using the same number of calls to the input channels. A natural question is whether they can be simulated, i.e., whether their action can be exactly and deterministically reproduced by a quantum circuit with more calls to the input channels. Here, we prove that the quantum switch acting on two n-qubit channels cannot be simulated by any quantum circuit using k calls to one channel and one to the other, if k &amp;lt; 2^n. This establishes an exponential separation in quantum query complexity between processes with indefinite causal order and quantum circuits. Moreover, even with one extra call to both input channels, such a simulation remains impossible. We further demonstrate the robustness of this separation by extending the result to probabilistic and approximate simulations scenarios.&lt;/p&gt;</description></item><item><title>Strict hierarchy between $n$-wise measurement simulability, compatibility structures, and multi-copy compatibility</title><link>https://qi.lip6.fr/fr/publication/5240149-strict-hierarchy-between-n-wise-measurement-simulability-compatibility-structures-and-multi-copy-compatibility/</link><pubDate>Thu, 04 Sep 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5240149-strict-hierarchy-between-n-wise-measurement-simulability-compatibility-structures-and-multi-copy-compatibility/</guid><description>&lt;p&gt;The incompatibility of quantum measurements, i.e. the fact that certain observable quantities cannot be measured jointly is widely regarded as a distinctive quantum feature with important implications for the foundations and the applications of quantum information theory. While the standard incompatibility of multiple measurements has been the focus of attention since the inception of quantum theory, its generalizations, such as measurement simulability, $n$-wise incompatibility, and mulit-copy incompatibility have only been proposed recently. Here, we point out that all these generalizations are differing notions of the question of how many measurements are genuinely contained in a measurement device. We then show, that all notions do differ not only in their operational meaning but also mathematically in the set of measurement assemblages they describe. We then fully resolve the relations between these different generalizations, by showing a strict hierarchy between these notions. Hence, we provide a general framework for generalized measurement incompatibility. Finally, we consider the implications our results have for recent works using these different notions.&lt;/p&gt;</description></item><item><title>All Incompatible Measurements on Qubits Lead to Multiparticle Bell Nonlocality</title><link>https://qi.lip6.fr/fr/publication/4652108-all-incompatible-measurements-on-qubits-lead-to-multiparticle-bell-nonlocality/</link><pubDate>Wed, 21 May 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4652108-all-incompatible-measurements-on-qubits-lead-to-multiparticle-bell-nonlocality/</guid><description>&lt;p&gt;Bell nonlocality is a fundamental phenomenon of quantum physics as well as an essential resource for various tasks in quantum information processing. It is known that for the observation of nonlocality the measurements on a quantum system have to be incompatible, but the question which incompatible measurements are useful, remained open. Here we prove that any set of incompatible measurements on qubits leads to a violation of a suitable Bell inequality in a multiparticle scenario, where all parties perform the same set of measurements. Since there exists incompatible measurements on qubits which do not lead to Bell nonlocality for two particles, our results demonstrate a fundamental difference between two-particle and multi-particle nonlocality, pointing at the superactivation of measurement incompatibility as a resource. In addition, our results imply that measurement incompatibility for qubits can always be certified in a device-independent manner.&lt;/p&gt;</description></item><item><title>Characterising memory in quantum channel discrimination via constrained separability problems</title><link>https://qi.lip6.fr/fr/publication/4994619-characterising-memory-in-quantum-channel-discrimination-via-constrained-separability-problems/</link><pubDate>Mon, 17 Mar 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4994619-characterising-memory-in-quantum-channel-discrimination-via-constrained-separability-problems/</guid><description>&lt;p&gt;Quantum memories are a crucial precondition in many protocols for processing quantum information. A fundamental problem that illustrates this statement is given by the task of channel discrimination, in which an unknown channel drawn from a known random ensemble should be determined by applying it for a single time. In this paper, we characterise the quality of channel discrimination protocols when the quantum memory, quantified by the auxiliary dimension, is limited. This is achieved by formulating the problem in terms of separable quantum states with additional affine constraints that all of their factors in each separable decomposition obey. We discuss the computation of upper and lower bounds to the solutions of such problems which allow for new insights into the role of memory in channel discrimination. In addition to the single-copy scenario, this methodological insight allows to systematically characterise quantum and classical memories in adaptive channel discrimination protocols. Especially, our methods enabled us to identify channel discrimination scenarios where classical or quantum memory is required, and to identify the hierarchical and non-hierarchical relationships within adaptive channel discrimination protocols.&lt;/p&gt;</description></item><item><title>Experimental quantum randomness enhanced by a quantum network</title><link>https://qi.lip6.fr/fr/publication/4994615-experimental-quantum-randomness-enhanced-by-a-quantum-network/</link><pubDate>Mon, 17 Mar 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4994615-experimental-quantum-randomness-enhanced-by-a-quantum-network/</guid><description>&lt;p&gt;The certification of randomness is essential for both fundamental science and information technologies. Unlike traditional random number generators, randomness obtained from nonlocal correlations is fundamentally guaranteed to be unpredictable. However, it is also highly susceptible to noise. Here, we show that extending the conventional bipartite Bell scenario to hybrid quantum networks &amp;ndash; which incorporate both quantum channels and entanglement sources &amp;ndash; enhances the robustness of certifiable randomness. Our protocol even enables randomness to be certified from Bell-local states, broadening the range of quantum states useful for this task. Through both theoretical analysis and experimental validation in a photonic network, we demonstrate enhanced performance and improved noise resilience.&lt;/p&gt;</description></item><item><title>Higher-Order Quantum Operations</title><link>https://qi.lip6.fr/fr/publication/4994613-higher-order-quantum-operations/</link><pubDate>Mon, 17 Mar 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4994613-higher-order-quantum-operations/</guid><description>&lt;p&gt;An operational description of quantum phenomena concerns developing models that describe experimentally observed behaviour. $\textit{Higher-order quantum operations}\unicode{x2014}$quantum operations that transform quantum operations$\unicode{x2014}$are fundamental to modern quantum theory, extending beyond basic state preparations, evolutions, and measurements described by the Born rule. These operations naturally emerge in quantum circuit architectures, correlated open dynamics, and investigations of quantum causality, to name but a few fields of application. This Review Article provides both a pedagogical introduction to the framework of higher-order quantum operations and a comprehensive survey of current literature, illustrated through physical examples. We conclude by identifying open problems and future research directions in this rapidly evolving field.&lt;/p&gt;</description></item><item><title>Certifying measurement incompatibility in prepare-and-measure and Bell scenarios</title><link>https://qi.lip6.fr/fr/publication/4652109-certifying-measurement-incompatibility-in-prepare-and-measure-and-bell-scenarios/</link><pubDate>Mon, 03 Mar 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4652109-certifying-measurement-incompatibility-in-prepare-and-measure-and-bell-scenarios/</guid><description>&lt;p&gt;We consider the problem of certifying measurement incompatibility in a prepare-and-measure (PM) scenario. We present different families of sets of qubit measurements which are incompatible, but cannot lead to any quantum over classical advantage in PM scenarios. Our examples are obtained via a general theorem which proves a set of qubit dichotomic measurements can have their incompatibility certified in a PM scenario if and only if their incompatibility can be certified in a bipartite Bell scenario where the parties share a maximally entangled state. Our framework naturally suggests a hierarchy of increasingly stronger notions of incompatibility, in which more power is given to the classical simulation by increasing its dimensionality. For qubits, we give an example of measurements whose incompatibility can be certified against trit simulations, which we show is the strongest possible notion for qubits in this framework.&lt;/p&gt;</description></item><item><title>Can outcome communication explain Bell nonlocality?</title><link>https://qi.lip6.fr/fr/publication/5326156-can-outcome-communication-explain-bell-nonlocality/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5326156-can-outcome-communication-explain-bell-nonlocality/</guid><description>&lt;p&gt;A central aspect of quantum information is that correlations between spacelike separated observers sharing entangled states cannot be reproduced by local hidden variable (LHV) models, a phenomenon known as Bell nonlocality. If one wishes to explain such correlations by classical means, a natural possibility is to allow communication between the parties. In particular, LHV models augmented with two bits of classical communication can explain the correlations of any two-qubit state. Would this still hold if communication is restricted to measurement outcomes? While in certain scenarios with a finite number of inputs the answer is yes, we prove that if a model must reproduce all projective measurements, then for any qubit-qudit state the answer is no. In fact, a qubit-qudit under projective measurements admits an LHV model with outcome communication if and only if it already admits an LHV model without communication. On the other hand, we also show that when restricted sets of measurements are considered (for instance, when the qubit measurements are in the upper hemisphere of the Bloch ball), outcome communication does offer an advantage. This exemplifies that trivial properties in standard LHV scenarios, such as deterministic measurements and outcome-relabelling, play a crucial role in the outcome communication scenario.&lt;/p&gt;</description></item><item><title>Measurement incompatibility and quantum steering via linear programming</title><link>https://qi.lip6.fr/fr/publication/5241520-measurement-incompatibility-and-quantum-steering-via-linear-programming/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/5241520-measurement-incompatibility-and-quantum-steering-via-linear-programming/</guid><description>&lt;p&gt;The problem of deciding whether a set of quantum measurements is jointly measurable is known to be equivalent to determining whether a quantum assemblage is unsteerable. This problem can be formulated as a semidefinite program (SDP). However, the number of variables and constraints in such a formulation grows exponentially with the number of measurements, rendering it intractable for large measurement sets. In this work, we circumvent this problem by transforming the SDP into a hierarchy of linear programs that compute upper and lower bounds on the incompatibility robustness with a complexity that grows polynomially in the number of measurements. The hierarchy is guaranteed to converge and it can be applied to arbitrary measurements &amp;ndash; including non-projective POVMs &amp;ndash; in arbitrary dimensions. While convergence becomes impractical in high dimensions, in the case of qubits our method reliably provides accurate upper and lower bounds for the incompatibility robustness of sets with several hundred measurements in a short time using a standard laptop. We also apply our methods to qutrits, obtaining non-trivial upper and lower bounds in scenarios that are otherwise intractable using the standard SDP approach. Finally, we show how our methods can be used to construct local hidden state models for states, or conversely, to certify that a given state exhibits steering; for two-qubit quantum states, our approach is comparable to, and in some cases outperforms, the current best methods.&lt;/p&gt;</description></item><item><title>Can the quantum switch be deterministically simulated?</title><link>https://qi.lip6.fr/fr/publication/4722809-can-the-quantum-switch-be-deterministically-simulated/</link><pubDate>Sun, 06 Oct 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4722809-can-the-quantum-switch-be-deterministically-simulated/</guid><description>&lt;p&gt;Higher-order transformations that act on a certain number of input quantum channels in an indefinite causal order - such as the quantum switch - cannot be described by standard quantum circuits that use the same number of calls of the input quantum channels. However, the question remains whether they can be simulated, i.e., whether their action on their input channels can be deterministically reproduced, for all arbitrary inputs, by a quantum circuit that uses a larger number of calls of the input channels. Here, we prove that when only one extra call of each input channel is available, the quantum switch cannot be simulated by any quantum circuit. We demonstrate that this result is robust by showing that, even when probabilistic and approximate simulations are considered, higher-order transformations that are close to the quantum switch can be at best simulated with a probability strictly less than one. This result stands in stark contrast with the known fact that, when the quantum switch acts exclusively on unitary channels, its action can be simulated.&lt;/p&gt;</description></item><item><title>Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits</title><link>https://qi.lip6.fr/fr/publication/4722807-exponential-separation-in-quantum-query-complexity-of-the-quantum-switch-with-respect-to-simulations-with-standard-quantum-circuits/</link><pubDate>Sun, 06 Oct 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4722807-exponential-separation-in-quantum-query-complexity-of-the-quantum-switch-with-respect-to-simulations-with-standard-quantum-circuits/</guid><description>&lt;p&gt;Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch &amp;ndash; the simplest such example &amp;ndash; has been shown to provide numerous information-processing advantages. Here, we prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically and exactly by any causally ordered quantum circuit that uses $M$ calls to one channel and one call to the other, if $M \leq \max(2, 2^n-1)$. This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits.&lt;/p&gt;</description></item><item><title>Multicopy quantum state teleportation with application to storage and retrieval of quantum programs</title><link>https://qi.lip6.fr/fr/publication/4704752-multicopy-quantum-state-teleportation-with-application-to-storage-and-retrieval-of-quantum-programs/</link><pubDate>Sat, 21 Sep 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4704752-multicopy-quantum-state-teleportation-with-application-to-storage-and-retrieval-of-quantum-programs/</guid><description>&lt;p&gt;This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of \textit{multicopy state teleportation}, where Alice has $k$ identical copies of an arbitrary unknown $d$-dimensional qudit state $\vert\psi\rangle$ to teleport a single copy of $\vert\psi\rangle$ to Bob using a maximally entangled two-qudit state shared between Alice and Bob without Bob&amp;rsquo;s correction. Alice may perform a joint measurement on her half of the entangled state and the $k$ copies of $\vert\psi\rangle$. We prove that the maximal probability of success for teleporting the exact state $\vert\psi\rangle$ to Bob is $p(d,k)=\frac{k}{d(k-1+d)}$ and present an explicit protocol to attain this performance. Then, by utilising $k$ copies of an arbitrary target state $\vert\psi\rangle$, we show how the multicopy state teleportation protocol can be employed to enhance the success probability of storage and retrieval of quantum programs, which aims to universally retrieve the action of an arbitrary quantum channel that is stored in a state. Our proofs make use of group representation theory methods, which may find applications beyond the problems addressed in this work.&lt;/p&gt;</description></item><item><title>Characterising transformations between quantum objects, ‘completeness’ of quantum properties, and transformations without a fixed causal order</title><link>https://qi.lip6.fr/fr/publication/4088152-characterising-transformations-between-quantum-objects-completeness-of-quantum-properties-and-transformations-without-a-fixed-causal-order/</link><pubDate>Wed, 17 Jul 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4088152-characterising-transformations-between-quantum-objects-completeness-of-quantum-properties-and-transformations-without-a-fixed-causal-order/</guid><description>&lt;p&gt;Many fundamental and key objects in quantum mechanics are linear mappings between particular affine/linear spaces. This structure includes basic quantum elements such as states, measurements, channels, instruments, non-signalling channels and channels with memory, and also higher-order operations such as superchannels, quantum combs, n-time processes, testers, and process matrices which may not respect a definite causal order. Deducing and characterising their structural properties in terms of linear and semidefinite constraints is not only of foundational relevance, but plays an important role in enabling the numerical optimization over sets of quantum objects and allowing simpler connections between different concepts and objects. Here, we provide a general framework to deduce these properties in a direct and easy to use way. Additionally, while primarily guided by practical quantum mechanical considerations, we extend our analysis to mappings between \textit{general} linear/affine spaces and derive their properties, opening the possibility for analysing sets which are not explicitly forbidden by quantum theory, but are still not much explored. Together, these results yield versatile and readily applicable tools for all tasks that require the characterization of linear transformations, in quantum mechanics and beyond. As an application of our methods, we discuss the emergence of indefinite causality in higher-order quantum transformation.&lt;/p&gt;</description></item><item><title>Experimental superposition of a quantum evolution with its time reverse</title><link>https://qi.lip6.fr/fr/publication/3858633-experimental-superposition-of-a-quantum-evolution-with-its-time-reverse/</link><pubDate>Fri, 19 Apr 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/3858633-experimental-superposition-of-a-quantum-evolution-with-its-time-reverse/</guid><description>&lt;p&gt;In the macroscopic world, time is intrinsically asymmetric, flowing in a specific direction, from past to future. However, the same is not necessarily true for quantum systems, as some quantum processes produce valid quantum evolutions under time reversal. Supposing that such processes can be probed in both time directions, we can also consider quantum processes probed in a coherent superposition of forwards and backwards time directions. This yields a broader class of quantum processes than the ones considered so far in the literature, including those with indefinite causal order. In this work, we demonstrate for the first time an operation belonging to this new class: the quantum time flip. Using a photonic realisation of this operation, we apply it to a game formulated as a discrimination task between two sets of operators. This game not only serves as a witness of an indefinite time direction, but also allows for a computational advantage over strategies using a fixed time direction, and even those with an indefinite causal order.&lt;/p&gt;</description></item><item><title>Nonlocality activation in a photonic quantum network</title><link>https://qi.lip6.fr/fr/publication/4994446-nonlocality-activation-in-a-photonic-quantum-network/</link><pubDate>Wed, 10 Apr 2024 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4994446-nonlocality-activation-in-a-photonic-quantum-network/</guid><description>&lt;p&gt;Bell nonlocality refers to correlations between two distant, entangled particles that challenge classical notions of local causality. Beyond its foundational significance, nonlocality is crucial for device-independent technologies like quantum key distribution and randomness generation. Nonlocality quickly deteriorates in the presence of noise, and restoring nonlocal correlations requires additional resources. These often come in the form of many instances of the input state and joint measurements, incurring a significant resource overhead. Here, we experimentally demonstrate that single copies of Bell-local states, incapable of violating any standard Bell inequality, can give rise to nonlocality after being embedded into a quantum network of multiple parties. We subject the initial entangled state to a quantum channel that broadcasts part of the state to two independent receivers and certify the nonlocality in the resulting network by violating a tailored Bell-like inequality. We obtain these results without making any assumptions about the prepared states, the quantum channel, or the validity of quantum theory. Our findings have fundamental implications for nonlocality and enable the practical use of nonlocal correlations in real-world applications, even in scenarios dominated by noise.&lt;/p&gt;</description></item><item><title>The quantum switch is uniquely defined by its action on unitary operations</title><link>https://qi.lip6.fr/fr/publication/4384693-the-quantum-switch-is-uniquely-defined-by-its-action-on-unitary-operations/</link><pubDate>Tue, 07 Nov 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4384693-the-quantum-switch-is-uniquely-defined-by-its-action-on-unitary-operations/</guid><description>&lt;p&gt;The quantum switch is a quantum process that creates a coherent control between different unitary operations, which is often described as a quantum process which transforms a pair of unitary operations ( U 1 , U 2 ) into a controlled unitary operation that coherently applies them in different orders as |0&amp;gt;&amp;lt;0| \otimes U_1U_2 + |1&amp;gt;&amp;lt;1| \otimes U_2U_1 . This description, however, does not directly define its action on non-unitary operations. The action of the quantum switch on non-unitary operations is then chosen to be a ``natural&amp;rsquo;&amp;rsquo; extension of its action on unitary operations. In general, the action of a process on non-unitary operations is not uniquely determined by its action on unitary operations. It may be that there could be a set of inequivalent extensions of the quantum switch for non-unitary operations. We prove, however, that the natural extension is the only possibility for the quantum switch for the 2-slot case. In other words, contrary to the general case, the action of the quantum switch on non-unitary operations (as a linear and completely CP preserving supermap) is completely determined by its action on unitary operations. We also discuss the general problem of when the complete description of a quantum process is uniquely determined by its action on unitary operations and identify a set of single-slot processes which are completely defined by their action on unitary operations.&lt;/p&gt;</description></item><item><title>The minimal communication cost for simulating entangled qubits</title><link>https://qi.lip6.fr/fr/publication/4257418-the-minimal-communication-cost-for-simulating-entangled-qubits/</link><pubDate>Tue, 24 Oct 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4257418-the-minimal-communication-cost-for-simulating-entangled-qubits/</guid><description>&lt;p&gt;We analyze the amount of classical communication required to reproduce the statistics of local projective measurements on a general pair of entangled qubits, |Ψ&amp;gt;=sqrt(p) |00&amp;gt;+sqrt(1−p) |11&amp;gt; (with 1/2≤p≤1). We construct a classical protocol that perfectly simulates local projective measurements on all entangled qubit pairs by communicating one classical trit. Additionally, when 2p(1−p)2p−1log(p1−p)+2(1−p)≤1, approximately 0.835≤p≤1, we present a classical protocol that requires only a single bit of communication. The latter model even allows a perfect classical simulation with an average communication cost that approaches zero in the limit where the degree of entanglement approaches zero (p→1). This proves that the communication cost for simulating weakly entangled qubit pairs is strictly smaller than for the maximally entangled one.&lt;/p&gt;</description></item><item><title>Logical possibilities for physics after MIP*=RE</title><link>https://qi.lip6.fr/fr/publication/4209371-logical-possibilities-for-physics-after-mip-re/</link><pubDate>Sun, 17 Sep 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4209371-logical-possibilities-for-physics-after-mip-re/</guid><description>&lt;p&gt;MIP*=RE implies that C_{qa} (the closure of the set of tensor product correlations) and C_{qc} (the set of commuting correlations) can be separated by a hyperplane (i.e., a Bell-like inequality) and that there are correlations produced by commuting measurements (a finite number of them and with a finite number of outcomes) on an infinite-dimensional quantum system which cannot be approximated by sequences of finite-dimensional tensor product correlations. We point out that there are four logically possible universes after this result. Each possibility is interesting because it reveals either limitations in accepted physical theories or opportunities to test crucial aspects of nature. We list some open problems that may help us to design a road map to learn in which of these universes we are.&lt;/p&gt;</description></item><item><title>Nonlocality activation in a photonic quantum network</title><link>https://qi.lip6.fr/fr/publication/4209369-nonlocality-activation-in-a-photonic-quantum-network/</link><pubDate>Tue, 12 Sep 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4209369-nonlocality-activation-in-a-photonic-quantum-network/</guid><description>&lt;p&gt;Bell nonlocality refers to correlations between two distant, entangled particles that challenge classical notions of local causality. Beyond its foundational significance, nonlocality is crucial for device-independent technologies like quantum key distribution and randomness generation. Nonlocality quickly deteriorates in the presence of noise, and restoring nonlocal correlations requires additional resources. These often come in the form of many instances of the input state and joint measurements, incurring a significant resource overhead. Here, we experimentally demonstrate that single copies of Bell-local states, incapable of violating any standard Bell inequality, can give rise to nonlocality after being embedded into a quantum network of multiple parties. We subject the initial entangled state to a quantum channel that broadcasts part of the state to two independent receivers and certify the nonlocality in the resulting network by violating a tailored Bell-like inequality. We obtain these results without making any assumptions about the prepared states, the quantum channel, or the validity of quantum theory. Our findings have fundamental implications for nonlocality and enable the practical use of nonlocal correlations in real-world applications, even in scenarios dominated by noise.&lt;/p&gt;</description></item><item><title>Characterising the Hierarchy of Multi-time Quantum Processes with Classical Memory</title><link>https://qi.lip6.fr/fr/publication/4209370-characterising-the-hierarchy-of-multi-time-quantum-processes-with-classical-memory/</link><pubDate>Fri, 21 Jul 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4209370-characterising-the-hierarchy-of-multi-time-quantum-processes-with-classical-memory/</guid><description>&lt;p&gt;Memory is the fundamental form of temporal complexity: when present but uncontrollable, it manifests as non-Markovian noise; conversely, if controllable, memory can be a powerful resource for information processing. Memory effects arise from/are transmitted via interactions between a system and its environment; as such, they can be either classical or quantum in nature. From a practical standpoint, quantum processes with classical memory promise near-term applicability: they are more powerful than their memoryless counterpart, yet at the same time can be controlled over significant timeframes without being spoiled by decoherence. However, despite practical and foundational value, apart from simple two-time scenarios, the distinction between quantum and classical memory remains unexplored. We first analyse various physically-motivated candidates regarding a suitable definition for classical memory that lead to remarkably distinct phenomena in the multi-time setting. Subsequently, we systematically characterise the hierarchy of multi-time memory effects in quantum mechanics, many levels of which collapse in the two-time setting, thereby making our results genuinely multi-time phenomena.&lt;/p&gt;</description></item><item><title>Higher-order Process Matrix Tomography of a passively-stable Quantum SWITCH</title><link>https://qi.lip6.fr/fr/publication/4116459-higher-order-process-matrix-tomography-of-a-passively-stable-quantum-switch/</link><pubDate>Tue, 30 May 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4116459-higher-order-process-matrix-tomography-of-a-passively-stable-quantum-switch/</guid><description>&lt;p&gt;The field of indefinite causal order (ICO) has seen a recent surge in interest. Much of this research has focused on the quantum SWITCH, wherein multiple parties act in a superposition of different orders in a manner transcending the quantum circuit model. This results in a new resource for quantum protocols, and is exciting for its relation to issues in foundational physics. The quantum SWITCH is also an example of a higher-order quantum operation, in that it not only transforms quantum states, but also other quantum operations. To date, no higher-order quantum operation has been completely experimentally characterized. Indeed, past work on the quantum SWITCH has confirmed its ICO by measuring causal witnesses or demonstrating resource advantages, but the complete process matrix has only been described theoretically. Here, we perform higher-order quantum process tomography. However, doing so requires exponentially many measurements with a scaling worse than standard process tomography. We overcome this challenge by creating a new passively-stable fiber-based quantum SWITCH using active optical elements to deterministically generate and manipulate time-bin encoded qubits. Moreover, our new architecture for the quantum SWITCH can be readily scaled to multiple parties. By reconstructing the process matrix, we estimate its fidelity and tailor different causal witnesses directly for our experiment. To achieve this, we measure a set of tomographically complete settings, that also spans the input operation space. Our tomography protocol allows for the characterization and debugging of higher-order quantum operations with and without an ICO, while our experimental time-bin techniques could enable the creation of a new realm of higher-order quantum operations with an ICO.&lt;/p&gt;</description></item><item><title>Optimal universal quantum circuits for unitary complex conjugation</title><link>https://qi.lip6.fr/fr/publication/4055434-optimal-universal-quantum-circuits-for-unitary-complex-conjugation/</link><pubDate>Fri, 31 Mar 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4055434-optimal-universal-quantum-circuits-for-unitary-complex-conjugation/</guid><description/></item><item><title>Classical Cost of Transmitting a Qubit</title><link>https://qi.lip6.fr/fr/publication/4046684-classical-cost-of-transmitting-a-qubit/</link><pubDate>Wed, 01 Mar 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4046684-classical-cost-of-transmitting-a-qubit/</guid><description>&lt;p&gt;We consider general prepare-and-measure scenarios in which Alice can transmit qubit states to Bob, who can perform general measurements in the form of positive operator-valued measures (POVMs). We show that the statistics obtained in any such quantum protocol can be simulated by the purely classical means of shared randomness and two bits of communication. Furthermore, we prove that two bits of communication is the minimal cost of a perfect classical simulation. In addition, we apply our methods to Bell scenarios, which extends the well-known Toner and Bacon protocol. In particular, two bits of communication are enough to simulate all quantum correlations associated to arbitrary local POVMs applied to any entangled two-qubit state.&lt;/p&gt;</description></item><item><title>Device-independent and semi-device-independent entanglement certification in broadcast Bell scenarios</title><link>https://qi.lip6.fr/fr/publication/4070451-device-independent-and-semi-device-independent-entanglement-certification-in-broadcast-bell-scenarios/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4070451-device-independent-and-semi-device-independent-entanglement-certification-in-broadcast-bell-scenarios/</guid><description>&lt;p&gt;It has recently been shown that by broadcasting the subsystems of a bipartite quantum state, one can activate Bell nonlocality and significantly improve noise tolerance bounds for device-independent entanglement certification. In this work we strengthen these results and explore new aspects of this phenomenon. First, we prove new results related to the activation of Bell nonlocality. We construct Bell inequalities tailored to the broadcast scenario, and show how broadcasting can lead to even stronger notions of Bell nonlocality activation. In particular, we exploit these ideas to show that bipartite states admitting a local hidden-variable model for general measurements can lead to genuine tripartite nonlocal correlations. We then study device-independent entanglement certification in the broadcast scenario, and show through semidefinite programming techniques that device-independent entanglement certification is possible for the two-qubit Werner state in essentially the entire range of entanglement. Finally, we extend the concept of EPR steering to the broadcast scenario, and present novel examples of activation of the two-qubit isotropic state. Our results pave the way for broadcast-based device-independent and semi-device-independent protocols.&lt;/p&gt;</description></item><item><title>Demonstration of a quantum SWITCH in a Sagnac configuration</title><link>https://qi.lip6.fr/fr/publication/4029186-demonstration-of-a-quantum-switch-in-a-sagnac-configuration/</link><pubDate>Tue, 22 Nov 2022 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/4029186-demonstration-of-a-quantum-switch-in-a-sagnac-configuration/</guid><description>&lt;p&gt;The quantum SWITCH is an example of a process with an indefinite causal structure, and has attracted attention for its ability to outperform causally ordered computations within the quantum circuit model. To date, realisations of the quantum SWITCH have relied on optical interferometers susceptible to minute path length fluctuations, complicating their design, limiting their performance and posing an obstacle to extending the quantum SWITCH to multiple parties. In this Letter we overcome these limitations by demonstrating an intrinsically stable quantum SWITCH utilizing a common-path geometry facilitated by a novel reciprocal and universal $\mathrm{SU}(2)$ polarization gadget. We certify our design by successfully performing a channel discrimination task with near unity success probability.&lt;/p&gt;</description></item><item><title>Certifying dimension of quantum systems by sequential projective measurements</title><link>https://qi.lip6.fr/fr/publication/3270658-certifying-dimension-of-quantum-systems-by-sequential-projective-measurements/</link><pubDate>Thu, 10 Jun 2021 00:00:00 +0000</pubDate><guid>https://qi.lip6.fr/fr/publication/3270658-certifying-dimension-of-quantum-systems-by-sequential-projective-measurements/</guid><description>&lt;p&gt;This work analyzes correlations arising from quantum systems subject to sequential projective measurements to certify that the system in question has a quantum dimension greater than some d. We refine previous known methods and show that dimension greater than two can be certified in scenarios which are considerably simpler than the ones presented before and, for the first time in this sequential projective scenario, we certify quantum systems with dimension strictly greater than three. We also perform a systematic numerical analysis in terms of robustness and conclude that performing random projective measurements on random pure qutrit states allows a robust certification of quantum dimensions with very high probability.&lt;/p&gt;</description></item></channel></rss>