arXiv subjects

Martin J. Renner

Publications and source records attributed to Martin J. Renner.

11 recordsLinked to original sources

arXiv2026

A lower bound on the classical simulation cost of star-network correlations

It is well established that quantum strategies outperform classical ones in several communication tasks. We study the quantum communication complexity of correlations arising from joint measurements on quantum systems distributed across a star network, where several parties each send a quantum system to a central node. We introduce an exclusion task that can be solved perfectly when each party sends a quantum $d$-level system, but would require a large classical message otherwise. In fact, the task cannot be solved with certainty if each of the $n$ parties sends a classical message with less than $n^{(d-1)}$ symbols. This implies an advantage of using quantum over classical messages in that scenario that scales with both, the dimension of the quantum system and the number of systems measured simultaneously. As an application, this shows that no finite-size classical description of a qubit suffices to reproduce the statistics of a joint measurement on sufficiently many qubits.

quant-ph↗

arXiv2026

Almost all pure entangled states enable unbounded nonlocality sharing

We establish a connection between Hardy's paradox and nonlocality sharing in sequential bipartite scenarios, where each subsystem is measured in turn by a chain of observers. We show that any correlations exhibiting a Hardy paradox in the two-input two-output scenario enable sequential violations of the CHSH inequality between arbitrarily many pairs of observers, using only projective measurements and the assistance of a small local ancilla system. Since almost all pure entangled states, with the only exception of the maximally entangled one, admit Hardy correlations, our protocol applies generically: almost all pure entangled states, if assisted by a local ancilla, allow for nonlocality sharing between arbitrarily many observer pairs using only projective measurements.

quant-ph↗

arXiv2026

All pure entangled states can lead to fully nonlocal correlations

It is a well-established fact that some quantum correlations can be nonlocal, meaning that they cannot be described by a local hidden variable model. Certain quantum correlations have a form of nonlocality so strong that they cannot be reproduced even by models having an arbitrarily small local hidden variable component. These correlations are called fully nonlocal and lead to Bell inequalities in which the maximum quantum value saturates the non-signaling bound. A well-known example of this effect, which is also referred to as quantum pseudo-telepathy or all-versus-nothing proofs of nonlocality, is the quantum distribution fulfilling the Peres-Mermin square, in which the underlying state is a $4\times4$ dimensional maximally entangled state. Other examples of full nonlocality are known but, so far, all of them are for maximally entangled states and it is an open question whether maximal entanglement is necessary for full nonlocality. In this work, we first establish a link between full nonlocality and the concept of antidistinguishability of quantum states. We use this connection to show that in every bipartite $d\times d$ Hilbert space, with $d\geq3$, there are non-maximally entangled states that are fully nonlocal. In fact, we derive simple sufficient conditions for full nonlocality that are only based on the smallest and largest Schmidt coefficients. We also show that in every dimension there exist pure entangled states that do not exhibit full nonlocality. Finally, we show that all pure entangled states can be activated to show full nonlocality in the many-copy scenario.

quant-ph↗

arXiv2026

Operationally classical simulation of quantum states

A classical state-preparation device cannot generate states in relative superposition. We introduce classical models in which devices that are individually unable to generate states with relative superposition can be stochastically coordinated to simulate sets of quantum states. These models have natural operational interpretation in prepare-and-measure scenarios and they can account for many non-commuting quantum state sets. We develop systematic methods both for classically simulating quantum sets and for showing that no such simulation exists, thereby certifying quantum coherence. In particular, we determine the exact noise rates required to classically simulate the entire state space of quantum theory. We also reveal connections between the operational classicality of sets and the well-known fundamental concepts of joint measurability and Einstein-Podolsky-Rosen steering. Here, we present an avenue to understand how and to what extent quantum states defy generic models based on classical devices, which also has relevant implications for quantum information applications.

quant-ph↗

arXiv2026

Compatibility of Generalized Noisy Qubit Measurements

It is a crucial feature of quantum mechanics that not all measurements are compatible with each other. However, if measurements suffer from noise they may lose their incompatibility. Here, we consider the effect of white noise and determine the critical visibility such that all qubit measurements, i.e. all positive operator-valued measures (POVMs), become compatible, i.e. jointly measurable. In addition, we apply our methods to quantum steering and Bell nonlocality. We obtain a tight local hidden state model for two-qubit Werner states of visibility $1/2$. This determines the exact steering bound for two-qubit Werner states and also provides a local hidden variable model that improves on previously known models. Interestingly, this proves that POVMs are not more powerful than projective measurements to demonstrate quantum steering for these states.

quant-ph↗

arXiv2024

Absolute dimensionality of quantum ensembles

The dimension of a quantum state is traditionally seen as the number of superposed distinguishable states in a given basis. We propose an absolute, i.e.~basis-independent, notion of dimensionality for ensembles of quantum states. It is based on whether a quantum ensemble can be simulated with states confined to arbitrary lower-dimensional subspaces and classical postprocessing. In order to determine the absolute dimension of quantum ensembles, we develop both analytical witness criteria and a semidefinite programming criterion based on the ensemble's information capacity. Furthermore, we construct explicit simulation models for arbitrary ensembles of pure quantum states subject to white noise, and in natural cases we prove their optimality. Also, efficient numerical methods are provided for simulating generic ensembles. Finally, we discuss the role of absolute dimensionality in high-dimensional quantum information processing.

quant-ph↗

arXiv2023

The minimal communication cost for simulating entangled qubits

We analyze the amount of classical communication required to reproduce the statistics of local projective measurements on a general pair of entangled qubits, $|Ψ_{AB}>=\sqrt{p}\ |00>+\sqrt{1-p}\ |11>$ (with $1/2\leq p \leq 1$). We construct a classical protocol that perfectly simulates local projective measurements on all entangled qubit pairs by communicating one classical trit. Additionally, when $\frac{2p(1-p)}{2p-1} \log{\left(\frac{p}{1-p}\right)}+2(1-p)\leq1$, approximately $0.835 \leq p \leq 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 \to 1$). This proves that the communication cost for simulating weakly entangled qubit pairs is strictly smaller than for the maximally entangled one.

quant-ph↗

arXiv2023

Correspondence between entangled states and entangled bases under local transformations

We investigate whether pure entangled states can be associated to a measurement basis in which all vectors are local unitary transformations of the original state. We prove that for bipartite states with a local dimension that is either $2, 4$ or $8$, every state corresponds to a basis. Via numerics we strongly evidence the same conclusion also for two qutrits and three qubits. However, for some states of four qubits we are unable to find a basis, leading us to conjecture that not all quantum states admit a corresponding measurement. Furthermore, we investigate whether there can exist a set of local unitaries that transform \textit{any} state into a basis. While we show that such a state-independent construction cannot exist for general quantum states, we prove that it does exist for real-valued $n$-qubit states if and only if $n=2,3$, and that such constructions are impossible for any multipartite system of an odd local dimension. Our results suggest a rich relationship between entangled states and iso-entangled measurements with a strong dependence on both particle numbers and dimension.

quant-ph↗

arXiv2023

Classical Cost of Transmitting a Qubit

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.

quant-ph↗

arXiv2021

Experimentally feasible computational advantage from quantum superposition of gate orders

In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It is known that this quantum-controlled ordering of gates can reduce the query complexity in deciding a property of black-box unitaries with respect to the best algorithm in which the gates are applied in a fixed order. However, all tasks explicitly found so far require unitaries that either act on unbounded dimensional quantum systems in the asymptotic limit (the limiting case of a large number of black-box gates) or act on qubits, but then involve only a few unitaries. Here we introduce tasks (1) for which there is a provable computational advantage of a quantum-controlled ordering of gates in the asymptotic case and (2) that require only qubit gates and are therefore suitable to demonstrate this advantage experimentally. We study their solutions with the quantum-$n$-switch and within the quantum circuit model and find that while the $n$-switch requires to call each gate only once, a causal algorithm has to call at least $2n-1$ gates. Furthermore, the best known solution with a fixed gate ordering calls $O(n\log_2{(n)})$ gates.

quant-ph↗

arXiv2021

Reassessing the computational advantage of quantum-controlled ordering of gates

Research on indefinite causal structures is a rapidly evolving field that has a potential not only to make a radical revision of the classical understanding of space-time but also to achieve enhanced functionalities of quantum information processing. For example, it is known that indefinite causal structures provide exponential advantage in communication complexity when compared to causal protocols. In quantum computation, such structures can decide whether two unitary gates commute or anticommute with a single call to each gate, which is impossible with conventional (causal) quantum algorithms. A generalization of this effect to $n$ unitary gates, originally introduced in M. Araújo et al., Phys. Rev. Lett. 113, 250402 (2014) and often called Fourier promise problem (FPP), can be solved with the quantum-$n$-switch and a single call to each gate, while the best known causal algorithm so far calls $O(n^2)$ gates. In this work, we show that this advantage is smaller than expected. In fact, we present a causal algorithm that solves the only known specific FPP with $O(n \log(n))$ queries and a causal algorithm that solves every FPP with $O(n\sqrt{n})$ queries. Besides the interest in such algorithms on their own, our results limit the expected advantage of indefinite causal structures for these problems.

quant-ph↗