Jessica Bavaresco

An astonishing feature of higher-order quantum theory is that it can accommodate indefinite causal order. In the simplest bipartite setting, there exist signaling correlations for which it is fundamentally impossible to ascribe a definite causal order for the parties’ actions. Moreover, the assumptions required to arrive at such a statement (local quantum transformations and well-behaved probabilities) result in a nontrivial set of correlations, whose boundary is, to date, uncharacterized. In this work, we investigate indefinite causal order in boxworld theories. We construct a higher-order theory whose descriptor is the generalized bit (gbit)—the natural successor of the classical bit and quantum qubit. By fixing the local transformations in boxworld and asking about the global causal structure, we find that we trivially recover the full set of two-way signaling correlations. In light of this, we motivate and propose two physical principles in order to limit the set of achievable correlations: nonsignaling preservation and no signaling without system exchange. We find that a higher-order boxworld theory that respects these physical principles leads to (i) a nontrivial set of achievable correlations and (ii) a violation of some causal inequalities that is higher than what can be achieved in higher-order quantum theory. These results lead us to conjecture that the set of correlations of our higher-order boxworld theory is an outer approximation to the set of correlations produced by higher-order quantum theory.

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.

Using quantum systems as sensors or probes has been shown to greatly improve the precision of parameter estimation by exploiting unique quantum features such as entanglement. A major task in quantum sensing is to design the optimal protocol, i.e., the most precise one. It has been solved for some specific instances of the problem, but in general even numerical methods are not known. Here, we focus on the single-shot Bayesian setting, where the goal is to find the optimal initial state of the probe (which can be entangled with an auxiliary system), the optimal measurement, and the optimal estimator function. We leverage the formalism of higher-order operations to develop a method based on semidefinite programming that finds a protocol that is close to the optimal one with arbitrary precision. Crucially, our method is not restricted to any specific quantum evolution, cost function or prior distribution, and thus can be applied to any estimation problem. Moreover, it can be applied to both single or multiparameter estimation tasks. We demonstrate our method with three examples, consisting of unitary phase estimation, thermometry in a bosonic bath, and multiparameter estimation of an SU(2) transformation. Exploiting our methods, we extend several results from the literature. For example, in the thermometry case, we find the optimal protocol at any finite time and quantify the usefulness of entanglement. Additionally, we show that when the cost function is the mean squared error, projective measurements are optimal for estimation.

We present an instance of a task of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then establish two new classes of strategies for channel discrimination that involve indefinite causal order and show that there exists a strict hierarchy among the performance of all four strategies. Our proof technique employs a general method of computer-assisted proofs. We also provide a systematic method for finding pairs of channels that showcase this phenomenon, demonstrating that the hierarchy between strategies is not exclusive to our main example.

High-dimensional encoding of quantum information provides a way of transcending the limitations of current approaches to quantum communication, which are mostly based on the entanglement between qubits—two-dimensional quantum systems. One of the central challenges in the pursuit of high-dimensional alternatives is ascertaining the presence of high-dimensional entanglement within a given high-dimensional quantum state. In particular, it would be desirable to carry out such entanglement certification without resorting to inefficient full state tomography. Here, we show how carefully constructed measurements in two bases (one of which is not orthonormal) can be used to faithfully and efficiently certify bipartite high-dimensional states and their entanglement for any physical platform. To showcase the practicality of this approach under realistic conditions, we put it to the test for photons entangled in their orbital angular momentum. In our experimental set-up, we are able to verify 9-dimensional entanglement for a pair of photons on a 11-dimensional subspace each, at present the highest amount certified without any assumptions on the state.