arXiv subjects

Joel J. Wallman

Publications and source records attributed to Joel J. Wallman.

53 records · Page 3Linked to original sources

arXiv2017

Contextuality under weak assumptions

The presence of contextuality in quantum theory was first highlighted by Bell, Kochen and Specker, who discovered that for quantum systems of three or more dimensions, measurements cannot be viewed as revealing pre-existing properties of the system. More precisely, no model can assign deterministic outcomes to the projectors of a quantum measurement in a way that depends only on the projector and not the context (the full set of projectors) in which it appeared, despite the fact that the Born rule probabilities associated with projectors are independent of the context. A more general, operational definition of contextuality introduced by Spekkens, which we will term "probabilistic contextuality", drops the assumption of determinism and allows for operations other than measurements to be considered contextual. Probabilistic noncontextuality represents the postulate that elements of an operational theory that cannot be distinguished from each other based on the statistics of arbitrarily many repeated experiments are ontologically identical. In this paper, we introduce a framework that enables us to distinguish between different noncontextuality assumptions in terms of the relationships between the ontological representations of objects in the theory given a certain relation between their operational representations. This framework can be used to motivate and define a "possibilistic" analogue, encapsulating the idea that elements of an operational theory that cannot be unambiguously distinguished operationally can also not be unambiguously distinguished ontologically. We then prove that possibilistic noncontextuality is equivalent to an alternative notion proposed by Hardy. Finally, we demonstrate that these weaker noncontextuality assumptions are sufficient to prove alternative versions of known "no-go" theorems that constrain $ψ$-epistemic models for quantum mechanics.

quant-ph↗

arXiv2016

Estimating the coherence of noise in quantum control of a solid-state qubit

To exploit a given physical system for quantum information processing, it is critical to understand the different types of noise affecting quantum control. Distinguishing coherent and incoherent errors is extremely useful as they can be reduced in different ways. Coherent errors are generally easier to reduce at the hardware level, e.g. by improving calibration, whereas some sources of incoherent errors, e.g. T2* processes, can be reduced by engineering robust pulses. In this work, we illustrate how purity benchmarking and randomized benchmarking can be used together to distinguish between coherent and incoherent errors and to quantify the reduction in both of them due to using optimal control pulses and accounting for the transfer function in an electron spin resonance system. We also prove that purity benchmarking provides bounds on the optimal fidelity and diamond norm that can be achieved by correcting the coherent errors through improving calibration.

quant-ph↗

arXiv2016

Bounding experimental quantum error rates relative to fault-tolerant thresholds

Rigorously establishing that the error in an experimental quantum operation is beneath the threshold for fault-tolerant quantum computation currently requires considering the worst-case error, which can be orders of magnitude smaller than the average gate infidelities routinely reported in experiments. We show that an improved bound on the worst-case error can be obtained by also considering the recently-introduced unitarity of the noise where the upper and lower bounds differ by a factor of $\approx 2.45$ for unital qubit channels. We prove that the contribution from the nonunital part of any noise map is at most on the order of the average gate infidelity and so is negligible relative to any coherent contribution. We also show that the "average" error rate when measurements are not restricted to an eigenbasis containing the state of the system exhibits the same scaling as the worst-case error, which, for coherent noise, is the square-root of the infidelity. We also obtain improved bounds for the diamond distance when the noise map is known (or approximately known).

quant-ph↗

arXiv2016

Noise tailoring for scalable quantum computation via randomized compiling

Quantum computers are poised to radically outperform their classical counterparts by manipulating coherent quantum systems. A realistic quantum computer will experience errors due to the environment and imperfect control. When these errors are even partially coherent, they present a major obstacle to achieving robust computation. Here, we propose a method for introducing independent random single-qubit gates into the logical circuit in such a way that the effective logical circuit remains unchanged. We prove that this randomization tailors the noise into stochastic Pauli errors, leading to dramatic reductions in worst-case and cumulative error rates, while introducing little or no experimental overhead. Moreover we prove that our technique is robust to variation in the errors over the gate sets and numerically illustrate the dramatic reductions in worst-case error that are achievable. Given such tailored noise, gates with significantly lower fidelity are sufficient to achieve fault-tolerant quantum computation, and, importantly, the worst case error rate of the tailored noise can be directly and efficiently measured through randomized benchmarking experiments. Remarkably, our method enables the realization of fault-tolerant quantum computation under the error rates observed in recent experiments.

quant-ph↗

arXiv2015

Randomized Benchmarking with Confidence

Randomized benchmarking is a promising tool for characterizing the noise in experimental implementations of quantum systems. In this paper, we prove that the estimates produced by randomized benchmarking (both standard and interleaved) for arbitrary Markovian noise sources are remarkably precise by showing that the variance due to sampling random gate sequences is small. We discuss how to choose experimental parameters, in particular the number and lengths of random sequences, in order to characterize average gate errors with rigorous confidence bounds. We also show that randomized benchmarking can be used to reliably characterize time-dependent Markovian noise (e.g., when noise is due to a magnetic field with fluctuating strength). Moreover, we identify a necessary property for time-dependent noise that is violated by some sources of non-Markovian noise, which provides a test for non-Markovianity.

quant-ph↗

arXiv2015

Robust Characterization of Loss Rates

Many physical implementations of qubits---including ion traps, optical lattices and linear optics---suffer from loss. A nonzero probability of irretrievably losing a qubit can be a substantial obstacle to fault-tolerant methods of processing quantum information, requiring new techniques to safeguard against loss that introduce an additional overhead that depends upon the loss rate. Here we present a scalable and platform-independent protocol for estimating the average loss rate (averaged over all input states) resulting from an arbitrary Markovian noise process, as well as an independent estimate of detector efficiency. Moreover, we show that our protocol gives an additional constraint on estimated parameters from randomized benchmarking that improves the reliability of the estimated error rate and provides a new indicator for non-Markovian signatures in the experimental data. We also derive a bound for the state-dependent loss rate in terms of the average loss rate.

quant-ph↗

arXiv2015

Estimating outcome probabilities of quantum circuits using quasiprobabilities

We present a method for estimating the probabilities of outcomes of a quantum circuit using Monte Carlo sampling techniques applied to a quasiprobability representation. Our estimate converges to the true quantum probability at a rate determined by the total negativity in the circuit, using a measure of negativity based on the 1-norm of the quasiprobability. If the negativity grows at most polynomially in the size of the circuit, our estimator converges efficiently. These results highlight the role of negativity as a measure of non-classical resources in quantum computation.

quant-ph↗

arXiv2015

Characterization of Leakage Errors via Randomized Benchmarking

Leakage errors arise when the quantum state leaks out of some subspace of interest, for example, the two-level subspace of a multi-level system defining a computational `qubit' or the logical code space defined by some quantum error-correcting code or decoherence-free subspace. Leakage errors pose a distinct challenge to quantum control relative to the more well-studied decoherence errors and can be a limiting factor to achieving fault-tolerant quantum computation. Here we present scalable and robust randomized benchmarking protocols for quickly estimating the rates of both coherent and incoherent leakage, allowing for practical minimization of the leakage rate by varying over control methods. We illustrate the reliability of the protocol through numerical simulations with physically-relevant error models.

quant-ph↗

arXiv2014

Nonlocality in instantaneous quantum circuits

We show that families of Instantaneous Quantum Polynomial (IQP) circuits corresponding to nontrivial Bell tests exhibit nonlocality. However, we also prove that this nonlocality can only be demonstrated using post-selection or nonlinear processing of the measurement outcomes. Therefore if the output of a computation is encoded in the parity of the measurement outcomes, then families of IQP circuits whose full output distributions are hard to sample still only provide a computational advantage relative to locally causal theories under post-selection. Consequently, post-selection is a crucial technique for obtaining a computational advantage for IQP circuits (with respect to decision problems) and for demonstrating nonlocality within IQP circuits, suggesting a strong link between these phenomena.

quant-ph↗

arXiv2014

Measurement-based classical computation

Measurement-based quantum computation (MBQC) is a model of quantum computation, in which computation proceeds via adaptive single qubit measurements on a multi-qubit quantum state. It is computationally equivalent to the circuit model. Unlike the circuit model, however, its classical analog is little studied. Here we present a classical analog of MBQC whose computational complexity presents a rich structure. To do so, we identify uniform families of quantum computations (refining the circuits introduced by Bremner, Jozsa and Shepherd in Proc. R. Soc. A 467, 459 (2011)) whose output is likely hard to exactly simulate (sample) classically. We demonstrate that these circuit families can be efficiently implemented in the MBQC model without adaptive measurement, and thus can be achieved in a classical analog of MBQC whose resource state is a probability distribution which has been created quantum mechanically. Such states (by definition) violate no Bell inequality, but nevertheless exhibit non-classicality when used as a computational resource - an imprint of their quantum origin.

quant-ph↗

arXiv2014

Contextuality supplies the magic for quantum computation

Quantum computers promise dramatic advantages over their classical counterparts, but the answer to the most basic question "What is the source of the power in quantum computing?" has remained elusive. Here we prove a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via magic state distillation. This is a conceptually satisfying link because contextuality provides one of the fundamental characterizations of uniquely quantum phenomena and, moreover, magic state distillation is the leading model for experimentally realizing fault-tolerant quantum computation. Furthermore, this connection suggests a unifying paradigm for the resources of quantum information: the nonlocality of quantum theory is a particular kind of contextuality and nonlocality is already known to be a critical resource for achieving advantages with quantum communication. In addition to clarifying these fundamental issues, this work advances the resource framework for quantum computation, which has a number of practical applications, such as characterizing the efficiency and trade-offs between distinct theoretical and experimental schemes for achieving robust quantum computation and bounding the overhead cost for the classical simulation of quantum algorithms.

quant-ph↗

arXiv2012

Nonnegative subtheories and quasiprobability representations of qubits

Negativity in a quasiprobability representation is typically interpreted as an indication of nonclassical behavior. However, this does not preclude states that are non-negative from exhibiting phenomena typically associated with quantum mechanics - the single qubit stabilizer states have non-negative Wigner functions and yet play a fundamental role in many quantum information tasks. We seek to determine what other sets of quantum states and measurements for a qubit can be non-negative in a quasiprobability representation, and to identify nontrivial unitary groups that permute the states in such a set. These sets of states and measurements are analogous to the single qubit stabilizer states. We show that no quasiprobability representation of a qubit can be non-negative for more than four bases and that the non-negative bases in any quasiprobability representation must satisfy certain symmetry constraints. We provide an exhaustive list of the sets of single qubit bases that are non-negative in some quasiprobability representation and are also permuted by a nontrivial unitary group. This list includes two families of three bases that both include the single qubit stabilizer states as a special case and a family of four bases whose symmetry group is the Pauli group. For higher dimensions, we prove that there can be no more than 2^{d^2} states in non-negative bases of a d-dimensional Hilbert space in any quasiprobability representation. Furthermore, these bases must satisfy certain symmetry constraints, corresponding to requiring the bases to be sufficiently complementary to each other.

quant-ph↗

arXiv2012

Experimentally Violating Bell Inequalities Without Complete Reference Frames

We experimentally demonstrate, using qubits encoded in photon polarization, that if two parties share a single reference direction and use locally orthogonal measurements they will always violate a Bell inequality, up to experimental deficiencies. This contrasts with the standard view of Bell inequalities in which the parties need to share a complete reference frame for their measurements. Furthermore, we experimentally demonstrate that as the reference direction degrades the probability of violating a Bell inequality decreases smoothly to (39.7 +/- 0.1) % in the limiting case that the observers do not share a reference direction. This result promises simplified distribution of entanglement between separated parties, with applications in fundamental investigations of quantum physics and tasks such as quantum communication.

quant-ph↗

arXiv2012

Revisiting consistency conditions for quantum states of systems on closed timelike curves: an epistemic perspective

There has been considerable recent interest in the consequences of closed timelike curves (CTCs) for the dynamics of quantum mechanical systems. A vast majority of research into this area makes use of the dynamical equations developed by Deutsch, which were developed from a consistency condition that assumes that mixed quantum states uniquely describe the physical state of a system. We criticise this choice of consistency condition from an epistemic perspective, i.e., a perspective in which the quantum state represents a state of knowledge about a system. We demonstrate that directly applying Deutsch's condition when mixed states are treated as representing an observer's knowledge of a system can conceal time travel paradoxes from the observer, rather than resolving them. To shed further light on the appropriate dynamics for quantum systems traversing CTCs, we make use of a toy epistemic theory with a strictly classical ontology due to Spekkens and show that, in contrast to the results of Deutsch, many of the traditional paradoxical effects of time travel are present.

quant-ph↗

arXiv2012

Observers can always generate nonlocal correlations without aligning measurements by covering all their bases

Quantum theory allows for correlations between the outcomes of distant measurements that are inconsistent with any locally causal theory, as demonstrated by the violation of a Bell inequality. Typical demonstrations of these correlations require careful alignment between the measurements, which requires distant parties to share a reference frame. Here, we prove, following a numerical observation by Shadbolt et al., that if two parties share a Bell state and each party randomly chooses three orthogonal measurements, then the parties will always violate a Bell inequality. Furthermore, we prove that this probability is highly robust against local depolarizing noise, in that small levels of noise only decrease the probability of violating a Bell inequality by a small amount. We also show that generalizing to N parties increases the robustness against noise. These results improve on previous ones that only allowed a high probability of violating a Bell inequality for large numbers of parties.

quant-ph↗

arXiv2011

Generalized Bell Inequality Experiments and Computation

We consider general settings of Bell inequality experiments with many parties, where each party chooses from a finite number of measurement settings each with a finite number of outcomes. We investigate the constraints that Bell inequalities place upon the correlations possible in a local hidden variable theories using a geometrical picture of correlations. We show that local hidden variable theories can be characterized in terms of limited computational expressiveness, which allows us to characterize families of Bell inequalities. The limited computational expressiveness for many settings (each with many outcomes) generalizes previous results about the many-party situation each with a choice of two possible measurements (each with two outcomes). Using this computational picture we present generalizations of the Popescu-Rohrlich non-local box for many parties and non-binary inputs and outputs at each site. Finally, we comment on the effect of pre-processing on measurement data in our generalized setting and show that it becomes problematic outside of the binary setting, in that it allows local hidden variable theories to simulate maximally non-local correlations such as those of these generalised Popescu-Rohrlich non-local boxes.

quant-ph↗

arXiv2011

Generating nonclassical correlations without fully aligning measurements

We investigate the scenario where spatially separated parties perform measurements in randomly chosen bases on an N-partite Greenberger-Horne-Zeilinger state. We show that without any alignment of the measurements, the observers will obtain correlations that violate a Bell inequality with a probability that rapidly approaches 1 as N increases and that this probability is robust against noise. We also prove that restricting these randomly chosen measurements to a plane perpendicular to a common direction will always generate correlations that violate some Bell inequality. Specifically, if each observer chooses their two measurements to be locally orthogonal, then the N observers will violate one of two Bell inequalities by an amount that increases exponentially with N. These results are also robust against noise and perturbations of each observer's reference direction from the common direction.

quant-ph↗