arXiv subjects

Matty J. Hoban

Publications and source records attributed to Matty J. Hoban.

At least 19 recordsLinked to original sources

arXiv2026

Bounding Classical and Quantum Correlations in Bayesian Networks with Quasiprobabilities

Bell's theorem reveals that quantum theory is in tension with classical causal reasoning and, in particular, the notion of local causality. This is now understood as a particular example of non-classicality in the study of correlations in (Bayesian) networks with both unobserved and observed nodes: the correlations are probability distributions over the observed nodes. There is a great deal of work aiming to understand the bounds on quantum and classical correlations in such networks and one approach is to consider outer approximations to the former. Along these lines, we consider quasiprobabilistic models for Bayesian networks, which can be seen as classical models but the probability distributions involving unobserved nodes are "replaced" with quasiprobabilities that respect normalisation but not positivity. We denote the set of correlations resulting from these models as the quasi set. Such models have a history in the study of Bell-type non-classicality where it has been shown that they can produce all non-signalling correlations. We show a generalisation of this result for a broad class of networks, which motivates a conjecture that the quasi set recovers the so called nested Markov model. Our work utilises a connection to tensor network decompositions, which may be of independent interest.

quant-ph↗

arXiv2025

Activation of post-quantum steering

There are possible physical theories that give greater violations of Bell's inequalities than the corresponding Tsirelson bound, termed post-quantum non-locality. Such theories do not violate special relativity, but could give an advantage in certain information processing tasks. There is another way in which entangled quantum states exhibit non-classical phenomena, with one notable example being Einstein-Podolsky-Rosen (EPR) steering; a violation of a bipartite Bell inequality implies EPR steering, but the converse is not necessarily true. The study of post-quantum EPR steering is more intricate, but it has been shown that it does not always imply post-quantum non-locality in a conventional Bell test. In this work we show how to distribute resources in a larger network that individually do not demonstrate post-quantum non-locality but violate a Tsirelson bound for the network. That is, we show how to activate post-quantum steering so that it can now be witnessed as post-quantum correlations in a Bell scenario. One element of our work that may be of independent interest is we show how to self-test a bipartite quantum assemblage in a network, even assuming post-quantum resources.

quant-ph↗

arXiv2024

A hierarchy of semidefinite programs for generalised Einstein-Podolsky-Rosen scenarios

Correlations in Einstein-Podolsky-Rosen (EPR) scenarios, captured by \textit{assemblages} of unnormalised quantum states, have recently caught the attention of the community, both from a foundational and an information-theoretic perspective. The set of quantum-realisable assemblages, or abbreviated to quantum assemblages, are those that arise from multiple parties performing local measurements on a shared quantum system. In general, deciding whether or not a given assemblage is a quantum assemblage, i.e. membership of the set of quantum assemblages, is a hard problem, and not always solvable. In this paper we introduce a hierarchy of tests where each level either determines non-membership of the set of quantum assemblages or is inconclusive. The higher the level of the hierarchy the better one can determine non-membership, and this hierarchy converges to a particular set of assemblages. Furthermore, this set to which it converges contains the quantum assemblages. Each test in the hierarchy is formulated as a semidefinite program. This hierarchy allows one to upper bound the quantum violation of a steering inequality and the quantum advantage provided by quantum EPR assemblages in a communication or information-processing task.

quant-ph↗

arXiv2024

Activation of post-quantumness in bipartite generalised EPR scenarios

In a standard bipartite Einstein-Podolsky-Rosen (EPR) scenario, Alice and Bob share a system prepared in an entangled state and Alice performs local measurements. One possible generalisation of this set-up is to allow Bob to also locally process his subsystem. Then, correlations generated in such generalised EPR scenarios are examples of non-signalling bipartite resources, called assemblages, that can exhibit post-quantum behavior, i.e., cannot be generated using solely quantum systems. There exist assemblages that, despite being post-quantum resources, can only generate quantum correlations in bipartite Bell-type scenarios. Here, we present a protocol for activation of post-quantumness in bipartite generalised EPR scenarios such as the so-called Bob-with-input, measurement-device-independent, and channel EPR scenarios. By designing a protocol that involves distributing the assemblages in a larger network, we derive tailored Bell inequalities which can be violated beyond their quantum bound in this new set-up. Our results show that in all of the above generalised scenarios, the post-quantumness of the assemblages can be witnessed at the level of correlations they produce.

quant-ph↗

arXiv2024

On estimating the entropy of shallow circuit outputs

Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. Here, we examine the hardness of this task for the case of probability distributions or quantum states produced by shallow circuits. Specifically, we show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors (LWE) problem, and thus believed to be intractable even for efficient quantum computation. This illustrates that quantum circuits do not need to be complex to render the computation of entropy a difficult task. We also give complexity-theoretic evidence that this problem for log-depth circuits is not as hard as its counterpart with general polynomial-size circuits, seemingly occupying an intermediate hardness regime. Finally, we discuss potential future applications of our work for quantum gravity research by relating our results to the complexity of the bulk-to-boundary dictionary of AdS/CFT.

quant-ph↗

arXiv2023

The resource theory of nonclassicality of channel assemblages

When two parties, Alice and Bob, share correlated quantum systems and Alice performs local measurements, Alice's updated description of Bob's state can provide evidence of nonclassical correlations. This simple scenario, famously introduced by Einstein, Podolsky and Rosen (EPR), can be modified by allowing Bob to also have a classical or quantum system as an input. In this case, Alice updates her knowledge of the channel (rather than of a state) in Bob's lab. In this paper, we provide a unified framework for studying the nonclassicality of various such generalizations of the EPR scenario. We do so using a resource theory wherein the free operations are local operations and shared randomness (LOSR). We derive a semidefinite program for studying the pre-order of EPR resources and discover possible conversions between the latter. Moreover, we study conversions between post-quantum resources both analytically and numerically.

quant-ph↗

arXiv2023

Quantifying EPR: the resource theory of nonclassicality of common-cause assemblages

Einstein-Podolsky-Rosen (EPR) steering is often (implicitly or explicitly) taken to be evidence for spooky action-at-a-distance. An alternative perspective on steering is that Alice has no causal influence on the physical state of Bob's system; rather, Alice merely updates her knowledge of the state of Bob's system by performing a measurement on a system correlated with his. In this work, we elaborate on this perspective (from which the very term 'steering' is seen to be inappropriate), and we are led to a resource-theoretic treatment of correlations in EPR scenarios. For both bipartite and multipartite scenarios, we develop the resulting resource theory, wherein the free operations are local operations and shared randomness (LOSR). We show that resource conversion under free operations in this paradigm can be evaluated with a single instance of a semidefinite program, making the problem numerically tractable. Moreover, we find that the structure of the pre-order of resources features interesting properties, such as infinite families of incomparable resources. In showing this, we derive new EPR resource monotones. We also discuss advantages of our approach over a pre-existing proposal for a resource theory of 'steering', and discuss how our approach sheds light on basic questions, such as which multipartite assemblages are classically explainable.

quant-ph↗

arXiv2022

The power of qutrits for non-adaptive measurement-based quantum computing

Non-locality is not only one of the most prominent quantum features but can also serve as a resource for various information-theoretical tasks. Analysing it from an information-theoretical perspective has linked it to applications such as non-adaptive measurement-based quantum computing (NMQC). In this type of quantum computing the goal is to output a multivariate function. The success of such a computation can be related to the violation of a generalised Bell inequality. So far, the investigation of binary NMQC with qubits has shown that quantum correlations can compute all Boolean functions using at most $2^n-1$ qubits, whereas local hidden variables (LHVs) are restricted to linear functions. Here, we extend these results to NMQC with qutrits and prove that quantum correlations enable the computation of all ternary functions using the generalised qutrit Greenberger-Horne-Zeilinger (GHZ) state as a resource and at most $3^n-1$ qutrits. This yields a corresponding generalised GHZ type paradox for any ternary function that LHVs cannot compute. We give an example for an $n$-variate function that can be computed with only $n+1$ qutrits, which leads to convenient generalised qutrit Bell inequalities whose quantum bound is maximal. Finally, we prove that not all functions can be computed efficiently with qutrit NMQC by presenting a counterexample.

quant-ph↗

arXiv2022

On characterising assemblages in Einstein-Podolsky-Rosen scenarios

Characterising non-classical quantum phenomena is crucial not only from a fundamental perspective, but also to better understand its capabilities for information processing and communication tasks. In this work, we focus on exploring the characterisation of Einstein-Podolsky-Rosen inference (a.k.a. steering): a signature of non-classicality manifested when one or more parties in a Bell scenario have their systems and measurements described by quantum theory, rather than being treated as black boxes. We propose a way of characterising common-cause assemblages from the correlations that arise when the trusted party performs tomographically-complete measurements on their share of the experiment, and discuss the advantages and challenges of this approach. Within this framework, we show that so-called almost quantum assemblages satisfy the principle of macroscopic noncontextuality, and demonstrate that a subset of almost quantum correlations recover almost quantum assemblages in this approach.

quant-ph↗

arXiv2022

Quantum networks self-test all entangled states

Certifying quantum properties with minimal assumptions is a fundamental problem in quantum information science. Self-testing is a method to infer the underlying physics of a quantum experiment only from the measured statistics. While all bipartite pure entangled states can be self-tested, little is known about how to self-test quantum states of an arbitrary number of systems. Here, we introduce a framework for network-assisted self-testing and use it to self-test any pure entangled quantum state of an arbitrary number of systems. The scheme requires the preparation of a number of singlets that scales linearly with the number of systems, and the implementation of standard projective and Bell measurements, all feasible with current technology. When all the network constraints are exploited, the obtained self-testing certification is stronger than what is achievable in any Bell-type scenario. Our work does not only solve an open question in the field, but also shows how properly designed networks offer new opportunities for the certification of quantum phenomena.

quant-ph↗

arXiv2021

Postquantum common-cause channels: the resource theory of local operations and shared entanglement

We define the type-independent resource theory of local operations and shared entanglement (LOSE). This allows us to formally quantify postquantumness in common-cause scenarios such as the Bell scenario. Any nonsignaling bipartite quantum channel which cannot be generated by LOSE operations requires a postquantum common cause to generate, and constitutes a valuable resource. Our framework allows LOSE operations that arbitrarily transform between different types of resources, which in turn allows us to undertake a systematic study of the different manifestations of postquantum common causes. Only three of these have been previously recognized, namely postquantum correlations, postquantum steering, and non-localizable channels, all of which are subsumed as special cases of resources in our framework. Finally, we prove several fundamental results regarding how the type of a resource determines what conversions into other resources are possible, and also places constraints on the resource's ability to provide an advantage in distributed tasks such as nonlocal games, semiquantum games, steering games, etc.

quant-ph↗

arXiv2020

Certified Quantum Random Numbers from Untrusted Light

A remarkable aspect of quantum theory is that certain measurement outcomes are entirely unpredictable to all possible observers. Such quantum events can be harnessed to generate numbers whose randomness is asserted based upon the underlying physical processes. We formally introduce, design and experimentally demonstrate an ultrafast optical quantum random number generator that uses a totally untrusted photonic source. While considering completely general quantum attacks, we certify and generate in real-time random numbers at a rate of $8.05\,$Gb/s with a rigorous security parameter of $10^{-10}$. Our security proof is entirely composable, thereby allowing the generated randomness to be utilised for arbitrary applications in cryptography and beyond. To our knowledge, this represents the fastest composably secure source of quantum random numbers ever reported.

quant-ph↗

arXiv2020

Bipartite post-quantum steering in generalised scenarios

The study of stronger-than-quantum effects is a fruitful line of research that provides valuable insight into quantum theory. Unfortunately, traditional bipartite steering scenarios can always be explained by quantum theory. Here we show that, by relaxing this traditional setup, bipartite steering incompatible with quantum theory is possible. The two scenarios we describe, which still feature Alice remotely steering Bob's system, are: (i) one where Bob also has an input and operates on his subsystem, and (ii) the `instrumental steering' scenario. We show that such bipartite post-quantum steering is a genuinely new type of post-quantum nonlocality, which does not follow from post-quantum Bell nonlocality. In addition, we present a method to bound quantum violations of steering inequalities in these scenarios.

quant-ph↗

arXiv2019

Self-testing and certification using trusted quantum inputs

Device-independent certification of quantum devices is of crucial importance for the development of secure quantum information protocols. So far, the most studied scenario corresponds to a system consisting of different non-characterized devices that observers probe with classical inputs to obtain classical outputs. The certification of relevant quantum properties follows from the observation of correlations between these events that do not have a classical counterpart. In the fully device-independent scenario no assumptions are made on the devices and therefore their non-classicality follows from Bell non-locality. There exist other scenarios, known as semidevice-independent, in which assumptions are made on the devices, such as their dimension, and non-classicality is associated to the observation of other types of correlations with no classical analogue. More recently, the use of trusted quantum inputs for certification has been introduced. The goal of this work is to study the power of this formalism and describe self-testing protocols in various settings using trusted quantum inputs. We also relate these different types of self-testing to some of the most basic quantum information protocols, such as quantum teleportation. Finally, we apply our findings to quantum networks and provide methods for estimating the quality of the whole network, as well as of parts of it.

quant-ph↗

arXiv2019

The complexity of compatible measurements

Measurement incompatibility is one of the basic aspects of quantum theory. Here we study the structure of the set of compatible -- i.e. jointly measurable -- measurements. We are interested in whether or not there exist compatible measurements whose parent is maximally complex -- requiring a number of outcomes exponential in the number of measurements, and related questions. Although we show this to be the case in a number of simple scenarios, we show that generically it cannot happen, by proving an upper bound on the number of outcomes of a parent measurement that is linear in the number of compatible measurements. We discuss why this doesn't trivialise the problem of finding parent measurements, but rather shows that a trade-off between memory and time can be achieved. Finally, we also investigate the complexity of extremal compatible measurements in regimes where our bound is not tight, and uncover rich structure.

quant-ph↗

arXiv2019

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↗

arXiv2018

One-Sided Device-Independent Certification of Unbounded Random Numbers

The intrinsic non-locality of correlations in Quantum Mechanics allow us to certify the behaviour of a quantum mechanism in a device independent way. In particular, we present a new protocol that allows an unbounded amount of randomness to be certified as being legitimately the consequence of a measurement on a quantum state. By using a sequence of non-projective measurements on single state, we show a more robust method to certify unbounded randomness than the protocol of Churchod et al., by moving to a one-sided device independent scenario. This protocol also does not assume any specific behaviour of the adversary trying to fool the participants in the protocol, which is an advantage over previous steering based protocols. We present numerical results which confirm the optimal functioning of this protocol in the ideal case. Furthermore, we also study an experimental scenario to determine the feasibility of the protocol in a realistic implementation. The effect of depolarizing noise is examined, by studying a potential state produced by a networked system of ion traps.

quant-ph↗

arXiv2018

A simple protocol for fault tolerant verification of quantum computation

With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation within the framework of interactive proofs has been fruitful for addressing this problem. Specifically, an untrusted agent (prover) alleging to perform quantum computations can have his claims verified by another agent (verifier) who only has access to classical computation and a small quantum device for preparing or measuring single qubits. However, when this quantum device is prone to errors, verification becomes challenging and often existing protocols address this by adding extra assumptions, such as requiring the noise in the device to be uncorrelated with the noise on the prover's devices. In this paper, we present a simple protocol for verifying quantum computations, in the presence of noisy devices, with no extra assumptions. This protocol is based on post hoc techniques for verification, which allow for the prover to know the desired quantum computation and its input. We also perform a simulation of the protocol, for a one-qubit computation, and find the error thresholds when using the qubit repetition code as well as the Steane code.

quant-ph↗