Search

Learning a hidden property of a quantum system typically requires a series of interactions. In this work, we formalise such multi-round learning processes using a generalisation of classical-quantum states, called classical-quantum combs. Here, "classical" refers to a random variable encoding the hidden property to be learnt, and "quantum" refers to the quantum comb describing the behaviour of the system. The optimal strategy for learning the hidden property can be quantified by applying the comb min-entropy (Chiribella and Ebler, NJP, 2016) to classical-quantum combs. To demonstrate the power of this approach, we focus attention on an array of problems derived from measurement-based quantum computation (MBQC) and related applications. Specifically, we describe a known blind quantum computation (BQC) protocol using the combs formalism and thereby leverage the min-entropy to provide a proof of single-shot security for multiple rounds of the protocol, extending the existing result in the literature. Furthermore, we consider a range of operationally motivated examples related to the verification of a partially unknown MBQC device. These examples involve learning the features of the device necessary for its correct use, including learning its internal reference frame for measurement calibration. We also introduce a novel connection between MBQC and quantum causal models that arises in this context.

Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of “computational irreducibility” sheds light on this compatibility. It implies that there cannot, in general, be shortcuts to predict the behavior of agents, explaining why deterministic agents often appear to act freely. In this paper, we introduce a variant of computational irreducibility that intends to capture more accurately aspects of actual (as opposed to apparent) free agency, including computational sourcehood, i.e., the phenomenon that the successful prediction of a process’ behavior must typically involve an almost-exact representation of the relevant features of that process, regardless of the time it takes to arrive at the prediction. We argue that this can be understood as saying that the process itself is the source of its actions, and we conjecture that many computational processes have this property. The main contribution of this paper is technical, in that we analyze whether and how a sensible formal definition of computational sourcehood is possible. While we do not answer the question completely, we show how it is related to finding a particular simulation preorder on Turing machines, we uncover concrete stumbling blocks towards constructing such a definition, and demonstrate that structure-preserving (as opposed to merely simple or efficient) functions between levels of simulation play a crucial role.

One of the most fundamental open problems in physics is the unification of general relativity and quantum theory to a theory of quantum gravity. An aspect that might become relevant in such a theory is that the dynamical nature of causal structure present in general relativity displays quantum uncertainty. This may lead to a phenomenon known as indefinite or quantum causal structure, as captured by the process matrix formalism. Due to the generality of that framework, however, for many process matrices there is no clear physical interpretation. A popular approach towards a quantum theory of gravity is the Page-Wootters formalism, which associates to time a Hilbert space structure similar to spatial position. By explicitly introducing a quantum clock, it allows to describe time-evolution of systems via correlations between this clock and said systems encoded in history states. In this paper we combine the process matrix framework with a generalization of the Page-Wootters formalism in which one considers several agents, each with their own discrete quantum clock. We describe how to extract process matrices from scenarios involving such agents with quantum clocks, and analyze their properties. The description via a history state with multiple clocks imposes constraints on the implementation of process matrices and on the perspectives of the agents as described via causal reference frames. While it allows for scenarios where different definite causal orders are coherently controlled, we explain why certain noncausal processes might not be implementable within this setting.

Quantum Darwinism posits that the emergence of a classical reality relies on the spreading of classical information from a quantum system to many parts of its environment. But what are the essential physical principles of quantum theory that make this mechanism possible? We address this question by formulating the simplest instance of Darwinism – CNOT-like $fan$-$out$ interactions – in a class of probabilistic theories that contain classical and quantum theory as special cases. We determine necessary and sufficient conditions for any theory to admit such interactions. We find that every theory with non-classical features that admits this idealized spreading of classical information must have both entangled states and entangled measurements. Furthermore, we show that Spekkens' toy theory admits this form of Darwinism, and so do all probabilistic theories that satisfy principles like strong symmetry, or contain a certain type of decoherence processes. Our result suggests the counter-intuitive general principle that in the presence of local non-classicality, a classical world can only emerge if this non-classicality can be "amplified" to a form of entanglement.

In a quantum world, reference frames are ultimately quantum systems too – but what does it mean to "jump into the perspective of a quantum particle"? In this work, we show that quantum reference frame (QRF) transformations appear naturally as symmetries of simple physical systems. This allows us to rederive and generalize known QRF transformations within an alternative, operationally transparent framework, and to shed new light on their structure and interpretation. We give an explicit description of the observables that are measurable by agents constrained by such quantum symmetries, and apply our results to a puzzle known as the `paradox of the third particle'. We argue that it can be reduced to the question of how to relationally embed fewer into more particles, and give a thorough physical and algebraic analysis of this question. This leads us to a generalization of the partial trace (`relational trace') which arguably resolves the paradox, and it uncovers important structures of constraint quantization within a simple quantum information setting, such as relational observables which are key in this resolution. While we restrict our attention to finite Abelian groups for transparency and mathematical rigor, the intuitive physical appeal of our results makes us expect that they remain valid in more general situations.

Nonlocality, as demonstrated by the violation of Bell inequalities, enables device-independent cryptographic tasks that do not require users to trust their apparatus. In this article, we consider devices whose inputs are spatiotemporal degrees of freedom, e.g., orientations or time durations. Without assuming the validity of quantum theory, we prove that the devices' statistical response must respect their input's symmetries, with profound foundational and technological implications. We exactly characterize the bipartite binary quantum correlations in terms of local symmetries, indicating a fundamental relation between space-time and quantum theory. For Bell experiments characterized by two input angles, we show that the correlations are accounted for by a local hidden-variable model if they contain enough noise, but conversely must be nonlocal if they are pure enough. This allows us to construct a Bell witness that certifies nonlocality with fewer measurements than possible without such spatiotemporal symmetries, suggesting an alternative class of semi-device-independent protocols for quantum technologies.

In this note we lay some groundwork for the resource theory of thermodynamics in general probabilistic theories (GPTs). We consider theories satisfying a purely convex abstraction of the spectral decomposition of density matrices: that every state has a decomposition, with unique probabilities, into perfectly distinguishable pure states. The spectral entropy, and analogues using other Schur-concave functions, can be defined as the entropy of these probabilities. We describe additional conditions under which the outcome probabilities of a fine-grained measurement are majorized by those for a spectral measurement, and therefore the "spectral entropy" is the measurement entropy (and therefore concave). These conditions are (1) projectivity, which abstracts aspects of the Lueders-von Neumann projection postulate in quantum theory, in particular that every face of the state space is the positive part of the image of a certain kind of projection operator called a filter; and (2) symmetry of transition probabilities. The conjunction of these, as shown earlier by Araki, is equivalent to a strong geometric property of the unnormalized state cone known as perfection: that there is an inner product according to which every face of the cone, including the cone itself, is self-dual. Using some assumptions about the thermodynamic cost of certain processes that are partially motivated by our postulates, especially projectivity, we extend von Neumann's argument that the thermodynamic entropy of a quantum system is its spectral entropy to generalized probabilistic systems satisfying spectrality.

A quantum process encodes the causal structure that relates quantum operations performed in local laboratories. The process matrix formalism includes as special cases quantum mechanics on a fixed background space-time, but also allows for more general causal structures. Motivated by the interpretation of processes as a resource for quantum information processing shared by two (or more) parties, with advantages recently demonstrated both for computation and communication tasks, we investigate the notion of composition of processes. We show that under very basic assumptions such a composition rule does not exist. While the availability of multiple independent copies of a resource, e.g. quantum states or channels, is the starting point for defining information-theoretic notions such as entropy (both in classical and quantum Shannon theory), our no-go result means that a Shannon theory of general quantum processes will not possess a natural rule for the composition of resources.

Despite its enormous empirical success, the formalism of quantum theory still raises fundamental questions: why is nature described in terms of complex Hilbert spaces, and what modifications of it could we reasonably expect to find in some regimes of physics? Here we address these questions by studying how compatibility with thermodynamics constrains the structure of quantum theory. We employ two postulates that any probabilistic theory with reasonable thermodynamic behaviour should arguably satisfy. In the framework of generalised probabilistic theories, we show that these postulates already imply important aspects of quantum theory, like self-duality and analogues of projective measurements, subspaces and eigenvalues. However, they may still admit a class of theories beyond quantum mechanics. Using a thought experiment by von Neumann, we show that these theories admit a consistent thermodynamic notion of entropy, and prove that the second law holds for projective measurements and mixing procedures. Furthermore, we study additional entropy-like quantities based on measurement probabilities and convex decomposition probabilities, and uncover a relation between one of these quantities and Sorkin’s notion of higher-order interference.