Searcharxiv⌕ Search

arXiv subjects

Ciarán M. Lee

Publications and source records attributed to Ciarán M. Lee.

17 recordsLinked to original sources

Leveraging directed causal discovery to detect latent common causes

The discovery of causal relationships is a fundamental problem in science and medicine. In recent years, many elegant approaches to discovering causal relationships between two variables from observational data have been proposed. However, most of these deal only with purely directed causal relationships and cannot detect latent common causes. Here, we devise a general heuristic which takes a causal discovery algorithm that can only distinguish purely directed causal relations and modifies it to also detect latent common causes. We apply our method to two directed causal discovery algorithms, the Information Geometric Causal Inference of (Daniusis et al., 2010) and the Kernel Conditional Deviance for Causal Inference of (Mitrovic, Sejdinovic, & Teh, 2018), and extensively test on synthetic data -- detecting latent common causes in additive, multiplicative and complex noise regimes -- and on real data, where we are able to detect known common causes. In addition to detecting latent common causes, our experiments demonstrate that both the modified algorithms preserve the performance of the original in distinguishing directed causal relations.

stat.ML↗

Compositional resource theories of coherence

Quantum coherence is one of the most important resources in quantum information. Indeed, preventing the loss of coherence is one of the most important technical challenges obstructing the development of large-scale quantum computers. Recently, there has been substantial progress in developing mathematical resource theories of coherence, paving the way towards its quantification and control. To date however, these resource theories have only been mathematically formalised within the realms of convex-geometry, information theory, and linear algebra. This approach is limited in scope, and makes it difficult to go beyond resource theories of coherence for single system quantum states. In this paper we take a complementary perspective, showing that resource theories of coherence can instead be defined purely compositionally, that is, working with the mathematics of process theories, string diagrams and category theory. This new perspective offers several advantages: i) it unifies various existing approaches to the study of coherence, for example, subsuming both speakable and unspeakable coherence; ii) it provides a general treatment of the compositional multi-system setting; iii) it generalises immediately to the case of quantum channels, measurements, instruments, and beyond; iv) it can easily be generalised to the setting where there are multiple distinct sources of decoherence; and, iv) it directly extends to arbitrary process theories, for example, generalised probabilistic theories and Spekkens toy model--providing the ability to operationally characterise coherence rather than relying on specific mathematical features of quantum theory for its description. More importantly, by providing a new, complementary, perspective on the resource of coherence, this work opens the door to the development of novel tools which would not be accessible from the linear algebraic mind set.

quant-ph↗

MultiVerse: Causal Reasoning using Importance Sampling in Probabilistic Programming

We elaborate on using importance sampling for causal reasoning, in particular for counterfactual inference. We show how this can be implemented natively in probabilistic programming. By considering the structure of the counterfactual query, one can significantly optimise the inference process. We also consider design choices to enable further optimisations. We introduce MultiVerse, a probabilistic programming prototype engine for approximate causal reasoning. We provide experimental results and compare with Pyro, an existing probabilistic programming framework with some of causal reasoning tools.

cs.AI↗

Integrating overlapping datasets using bivariate causal discovery

Causal knowledge is vital for effective reasoning in science, as causal relations, unlike correlations, allow one to reason about the outcomes of interventions. Algorithms that can discover causal relations from observational data are based on the assumption that all variables have been jointly measured in a single dataset. In many cases this assumption fails. Previous approaches to overcoming this shortcoming devised algorithms that returned all joint causal structures consistent with the conditional independence information contained in each individual dataset. But, as conditional independence tests only determine causal structure up to Markov equivalence, the number of consistent joint structures returned by these approaches can be quite large. The last decade has seen the development of elegant algorithms for discovering causal relations beyond conditional independence, which can distinguish among Markov equivalent structures. In this work we adapt and extend these so-called bivariate causal discovery algorithms to the problem of learning consistent causal structures from multiple datasets with overlapping variables belonging to the same generating process, providing a sound and complete algorithm that outperforms previous approaches on synthetic and real data.

stat.ML↗

The computational landscape of general physical theories

There is good evidence that quantum computers are more powerful than classical computers, and that various simple modifications of quantum theory yield computational power that is dramatically greater still. However, these modifications also violate fundamental physical principles. This raises the question of whether there exists a physical theory, allowing computation more powerful than quantum, but which still respects those fundamental physical principles. Prior work by two of us introduced this question within a suitable framework for theories that make good operational sense, and showed that in any theory satisfying tomographic locality, the class of problems that can be solved efficiently is contained in the complexity class AWPP. Here, we show that this bound is tight, in the sense that there exists a theory, satisfying tomographic locality, as well as a basic principle of causality, which can efficiently decide everything in AWPP. Hence this theory can efficiently simulate any computation in this framework, including quantum computation.

quant-ph↗

Device-independent certification of non-classical joint measurements via causal models

Quantum measurements are crucial for quantum technologies and give rise to some of the most classically counter-intuitive quantum phenomena. As such, the ability to certify the presence of genuinely non-classical joint measurements in a device-independent fashion is vital. However, previous work has either been non-device-independent, or has relied on post-selection---the ability to discard all runs of an experiment in which a specific event did not occur. In the case of entanglement, the post-selection approach applies an entangled measurement to independent states and post-selects the outcome, inducing non-classical correlations between the states that can be device-independently certified using a Bell inequality. That is, it certifies measurement non-classicality not by what it is, but by what it does. This paper remedies this discrepancy by providing a novel notion of what measurement non-classicality is, which, in analogy with Bell's theorem, corresponds to measurement statistics being incompatible with an underlying classical causal model. It is shown that this provides a more fine-grained notion of non-classicality than post-selection, as it certifies the presence of non-classicality that cannot be revealed by examining post-selected outcomes alone.

quant-ph↗

Oracles and query lower bounds in generalised probabilistic theories

We investigate the connection between interference and computational power within the operationally defined framework of generalised probabilistic theories. To compare the computational abilities of different theories within this framework we show that any theory satisfying three natural physical principles possess a well-defined oracle model. Indeed, we prove a subroutine theorem for oracles in such theories which is a necessary condition for the oracle to be well-defined. The three principles are: causality (roughly, no signalling from the future), purification (each mixed state arises as the marginal of a pure state of a larger system), and strong symmetry existence of non-trivial reversible transformations). Sorkin has defined a hierarchy of conceivable interference behaviours, where the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. Given our oracle model, we show that if a classical computer requires at least n queries to solve a learning problem, then the corresponding lower bound in theories lying at the kth level of Sorkin's hierarchy is n/k. Hence, lower bounds on the number of queries to a quantum oracle needed to solve certain problems are not optimal in the space of all generalised probabilistic theories, although it is not yet known whether the optimal bounds are achievable in general. Hence searches for higher-order interference are not only foundationally motivated, but constitute a search for a computational resource beyond that offered by quantum computation.

quant-ph↗

Generalised phase kick-back: the structure of computational algorithms from physical principles

The advent of quantum computing has challenged classical conceptions of which problems are efficiently solvable in our physical world. This motivates the general study of how physical principles bound computational power. In this paper we show that some of the essential machinery of quantum computation -- namely reversible controlled transformations and the phase kick-back mechanism -- exist in any operational-defined theory with a consistent notion of information. These results provide the tools for an exploration of the physics underpinning the structure of computational algorithms. We use these results to investigate the relationship between interference behaviour and computational power, demonstrating that non-trivial interference behaviour is a general resource for post-classical computation. In proving the above, we connect post-quantum interference -- the higher-order interference of Sorkin -- to the existence of post-quantum particle types, potentially providing a novel experimental test for higher-order interference. Finally, we conjecture that theories with post-quantum interference can solve problems intractable even on a quantum computer.

quant-ph↗

A no-go theorem for theories that decohere to quantum mechanics

To date, there has been no experimental evidence that invalidates quantum theory. Yet it may only be an effective description of the world, in the same way that classical physics is an effective description of the quantum world. We ask whether there exists an operationally-defined theory superseding quantum theory, but which reduces to it via a decoherence-like mechanism. We prove that no such post-quantum theory exists if it is demanded that it satisfy two natural physical principles: causality and purification. Causality formalises the statement that information propagates from present to future, and purification that each state of incomplete information arises in an essentially unique way due to lack of information about an environment. Hence, our result can either be viewed as evidence that the fundamental theory of Nature is quantum, or as showing in a rigorous manner that any post-quantum theory must abandon causality, purification, or both.

quant-ph↗

Towards device-independent information processing on general quantum networks

The violation of certain Bell inequalities allows for device-independent information processing secure against non-signalling eavesdroppers. However, this only holds for the Bell network, in which two or more agents perform local measurements on a single shared source of entanglement. To overcome the practical constraint that entangled systems can only be transmitted over relatively short distances, large-scale multi-source networks have been employed. Do there exist analogues of Bell inequalities for such networks, whose violation is a resource for device-independence? In this paper, the violation of recently derived polynomial Bell inequalities will be shown to allow for device-independence on multi-source networks, secure against non-signalling eavesdroppers.

quant-ph↗

Ruling out higher-order interference from purity principles

As first noted by Rafael Sorkin, there is a limit to quantum interference. The interference pattern formed in a multi-slit experiment is a function of the interference patterns formed between pairs of slits, there are no genuinely new features resulting from considering three slits instead of two. Sorkin has introduced a hierarchy of mathematically conceivable higher-order interference behaviours, where classical theory lies at the first level of this hierarchy and quantum theory theory at the second. Informally, the order in this hierarchy corresponds to the number of slits on which the interference pattern has an irreducible dependence. Many authors have wondered why quantum interference is limited to the second level of this hierarchy. Does the existence of higher-order interference violate some natural physical principle that we believe should be fundamental? In the current work we show that such principles can be found which limit interference behaviour to second-order, or "quantum-like", interference, but that do not restrict us to the entire quantum formalism. We work within the operational framework of generalised probabilistic theories, and prove that any theory satisfying Causality, Purity Preservation, Pure Sharpness, and Purification---four principles that formalise the fundamental character of purity in nature---exhibits at most second-order interference. Hence these theories are, at least conceptually, very "close" to quantum theory. Along the way we show that systems in such theories correspond to Euclidean Jordan algebras. Hence, they are self-dual and, moreover, multi-slit experiments in such theories are described by pure projectors.

quant-ph↗

Causal inference via algebraic geometry: feasibility tests for functional causal structures with two binary observed variables

We provide a scheme for inferring causal relations from uncontrolled statistical data based on tools from computational algebraic geometry, in particular, the computation of Groebner bases. We focus on causal structures containing just two observed variables, each of which is binary. We consider the consequences of imposing different restrictions on the number and cardinality of latent variables and of assuming different functional dependences of the observed variables on the latent ones (in particular, the noise need not be additive). We provide an inductive scheme for classifying functional causal structures into distinct observational equivalence classes. For each observational equivalence class, we provide a procedure for deriving constraints on the joint distribution that are necessary and sufficient conditions for it to arise from a model in that class. We also demonstrate how this sort of approach provides a means of determining which causal parameters are identifiable and how to solve for these. Prospects for expanding the scope of our scheme, in particular to the problem of quantum causal inference, are also discussed.

stat.ML↗

Higher-order interference in extensions of quantum theory

Quantum interference lies at the heart of several quantum computational speed-ups and provides a striking example of a phenomenon with no classical counterpart. An intriguing feature of quantum interference arises in a three slit experiment. In this set-up, the interference pattern can be written in terms of the two and one slit patterns obtained by blocking some of the slits. This is in stark contrast with the standard two slit experiment, where the interference pattern is irreducible. This was first noted by Rafael Sorkin, who asked why quantum theory only exhibits irreducible interference in the two slit experiment. One approach to this problem is to compare the predictions of quantum theory to those of operationally-defined `foil' theories, in the hope of determining whether theories exhibiting higher-order interference suffer from pathological--or at least undesirable--features. In this paper two proposed extensions of quantum theory are considered: the theory of Density Cubes proposed by Dakic et al., which has been shown to exhibit irreducible interference in the three slit set-up, and the Quartic Quantum Theory of Zyczkowski. The theory of Density Cubes will be shown to provide an advantage over quantum theory in a certain computational task and to posses a well-defined mechanism which leads to the emergence of quantum theory. Despite this, the axioms used to define Density Cubes will be shown to be insufficient to uniquely characterise the theory. In comparison, Quartic Quantum Theory is well-defined and we show that it exhibits irreducible interference to all orders. This feature of the theory is argued not to be a genuine phenomenon, but to arise from an ambiguity in the current definition of higher-order interference. To understand why quantum theory has limited interference therefore, a new operational definition of higher-order interference is needed.

quant-ph↗

Deriving Grover's lower bound from simple physical principles

Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms. Quantum interference between computational paths has been posited as a key resource behind this computational speed-up. However there is a limit to this interference, at most pairs of paths can ever interact in a fundamental way. Could more interference imply more computational power? Sorkin has defined a hierarchy of possible interference behaviours---currently under experimental investigation---where classical theory is at the first level of the hierarchy and quantum theory belongs to the second. Informally, the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. In this work, we consider how Grover's speed-up depends on the order of interference in a theory. Surprisingly, we show that the quadratic lower bound holds regardless of the order of interference. Thus, at least from the point of view of the search problem, post-quantum interference does not imply a computational speed-up over quantum theory.

quant-ph↗

The Information Content of Systems in General Physical Theories

What kind of object is a quantum state? Is it an object that encodes an exponentially growing amount of information (in the size of the system) or more akin to a probability distribution? It turns out that these questions are sensitive to what we do with the information. For example, Holevo's bound tells us that n qubits only encode n bits of classical information but for certain communication complexity tasks there is an exponential separation between quantum and classical resources. Instead of just contrasting quantum and classical physics, we can place both within a broad landscape of physical theories and ask how non-quantum (and non-classical) theories are different from, or more powerful than quantum theory. For example, in communication complexity, certain (non-quantum) theories can trivialise all communication complexity tasks. In recent work [C. M. Lee and M. J. Hoban, Proc. Royal Soc. A 472 (2190), 2016], we showed that the immense power of the information content of states in general (non-quantum) physical theories is not limited to communication complexity. We showed that, in general physical theories, states can be taken as "advice" for computers in these theories and this advice allows the computers to easily solve any decision problem. Aaronson has highlighted the close connection between quantum communication complexity and quantum computations that take quantum advice, and our work gives further indications that this is a very general connection. In this work, we review the results in our previous work and discuss the intricate relationship between communication complexity and computers taking advice for general theories.

cs.CC↗

Bounds on the power of proofs and advice in general physical theories

Quantum theory presents us with the tools for computational and communication advantages over classical theory. One approach to uncovering the source of these advantages is to determine how computation and communication power vary as quantum theory is replaced by other operationally-defined theories from a broad framework of such theories. Such investigations may reveal some of the key physical features required for powerful computation and communication. In this paper we investigate how simple physical principles bound the power of two different computational paradigms which combine computation and communication in a non-trivial fashion: computation with advice and interactive proof systems. We show that the existence of non-trivial dynamics in a theory implies a bound on the power of computation with advice. Moreover, we provide an explicit example of a theory with no non-trivial dynamics in which the power of computation with advice is unbounded. Finally we show that the power of simple interactive proof systems in theories where local measurements suffice for tomography is non-trivially bounded. This result provides a proof that QMA is contained in PP which does not make use of any uniquely quantum structure - such as the fact that observables correspond to self-adjoint operators - and thus may be of independent interest.

quant-ph↗

Computation in generalised probabilistic theories

From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that BQP is in AWPP. This work investigates limits on computational power that are imposed by physical principles. To this end, we define a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and ask: what is the minimal set of physical assumptions under which the above inclusion still holds? We show that given only an assumption of tomographic locality (roughly, that multipartite states can be characterised by local measurements), efficient computations are contained in AWPP. This inclusion still holds even without assuming a basic notion of causality (where the notion is, roughly, that probabilities for outcomes cannot depend on future measurement choices). Following Aaronson, we extend the computational model by allowing post-selection on measurement outcomes. Aaronson showed that the corresponding quantum complexity class is equal to PP. Given only the assumption of tomographic locality, the inclusion in PP still holds for post-selected computation in general theories. Thus in a world with post-selection, quantum theory is optimal for computation in the space of all general theories. We then consider if relativised complexity results can be obtained for general theories. It is not clear how to define a sensible notion of an oracle in the general framework that reduces to the standard notion in the quantum case. Nevertheless, it is possible to define computation relative to a `classical oracle'. Then, we show there exists a classical oracle relative to which efficient computation in any theory satisfying the causality assumption and tomographic locality does not include NP.

quant-ph↗