Collapse Threshold from a Computational Limit

Pauli instability in arbitrary states: detecting magic in physical correlators

Measures of non-stabilizerness (``magic'') of a quantum evolution quantify how hard it is to simulate on a classical computer. A natural question is how to extract information about magic from physical correlators, for example at finite temperature or in the ground state. In this paper we show how to measure magic usin...

Forbidden Subspaces in Quantum State Smoothing

A system between a preparation and a post-selection has had no agreed state since 1964. With positivity as the criterion, a post-selection admits an interval of orderings around the symmetric one exactly when the subspace it forbids is spanned by eigenvectors of a full-rank filtered state. Otherwise it certifies contex...

Unconditional and exponentially large violation of classicality

Testing the predictions of quantum mechanics has been one of the main experimental endeavors for decades. Recent advancements in technology have led to a number of demonstrations that test non-classicality via specific computational tasks. Limitations of these experiments include dependence on complexity theory assumpt...

Operational transformation rates of quantum states

Typically, multiple copies of a quantum state are described by a tensor power of that state. However, from an operational point of view, an experimentalist cannot, in general, rule out imperfections at unknown positions or correlations between copies, so assuming independent and identically distributed (iid) copies is...

Closing the Objectivity Loophole in Bell Tests on a Public Quantum Computer

The IBM Quantum and IonQ devices turn out to be sufficiently accurate to pass an extended Bell‐type test of local realism focusing on the objectivity criterion, although at the price of communication loopholes and residual but statistically significant signaling.

UvA-DARE (