arXiv subjects

Stephen D. Bartlett

Publications and source records attributed to Stephen D. Bartlett.

At least 55 records · Page 3Linked to original sources

arXiv2020

Braiding defects in topological stabiliser codes of any dimension cannot be universal

Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for universal fault-tolerant quantum computing in any spatial dimension. In particular, we show that, for the natural encoding of quantum information in defects in topological stabiliser codes, the set of logical operators implementable by braiding defects is contained in the Clifford group. Indeed, we show that this remains true even when supplemented with locality-preserving logical operators.

quant-ph↗

arXiv2020

Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes

Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We prove that a universal gate set for quantum computing cannot be realised by supplementing locality-preserving logical operators with defect braiding, even in more than two dimensions. However, notwithstanding this no-go theorem, we demonstrate that higher dimensional defect-braiding schemes have the potential to play an important role in realising fault-tolerant quantum computing. Specifically, we present an approach to implement the full Clifford group via braiding in any code possessing twist defects on which a fermion can condense. We explore three such examples in higher dimensional codes, specifically: in self-dual surface codes; the three dimensional Levin-Wen fermion mode; and the checkerboard model. Finally, we show how our no-go theorems can be circumvented to provide a universal scheme in three-dimensional surface codes without magic state distillation. Specifically, our scheme employs adaptive implementation of logical operators conditional on logical measurement outcomes to lift a combination of locality-preserving and braiding logical operators to universality.

quant-ph↗

arXiv2020

Fault-tolerant thresholds for the surface code in excess of 5% under biased noise

Noise in quantum computing is countered with quantum error correction. Achieving optimal performance will require tailoring codes and decoding algorithms to account for features of realistic noise, such as the common situation where the noise is biased towards dephasing. Here we introduce an efficient high-threshold decoder for a noise-tailored surface code based on minimum-weight perfect matching. The decoder exploits the symmetries of its syndrome under the action of biased noise and generalises to the fault-tolerant regime where measurements are unreliable. Using this decoder, we obtain fault-tolerant thresholds in excess of $6\%$ for a phenomenological noise model in the limit where dephasing dominates. These gains persist even for modest noise biases: we find a threshold of $\sim 5\%$ in an experimentally relevant regime where dephasing errors occur at a rate one hundred times greater than bit-flip errors.

quant-ph↗

arXiv2020

From estimation of quantum probabilities to simulation of quantum circuits

Investigating the classical simulability of quantum circuits provides a promising avenue towards understanding the computational power of quantum systems. Whether a class of quantum circuits can be efficiently simulated with a probabilistic classical computer, or is provably hard to simulate, depends quite critically on the precise notion of "classical simulation" and in particular on the required accuracy. We argue that a notion of classical simulation, which we call epsilon-simulation, captures the essence of possessing "equivalent computational power" as the quantum system it simulates: It is statistically impossible to distinguish an agent with access to an epsilon-simulator from one possessing the simulated quantum system. We relate epsilon-simulation to various alternative notions of simulation predominantly focusing on a simulator we call a poly-box. A poly-box outputs 1/poly precision additive estimates of Born probabilities and marginals. This notion of simulation has gained prominence through a number of recent simulability results. Accepting some plausible computational theoretic assumptions, we show that epsilon-simulation is strictly stronger than a poly-box by showing that IQP circuits and unconditioned magic-state injected Clifford circuits are both hard to epsilon-simulate and yet admit a poly-box. In contrast, we also show that these two notions are equivalent under an additional assumption on the sparsity of the output distribution (poly-sparsity).

quant-ph↗

arXiv2019

Tailoring surface codes for highly biased noise

The surface code, with a simple modification, exhibits ultra-high error correction thresholds when the noise is biased towards dephasing. Here, we identify features of the surface code responsible for these ultra-high thresholds. We provide strong evidence that the threshold error rate of the surface code tracks the hashing bound exactly for all biases, and show how to exploit these features to achieve significant improvement in logical failure rate. First, we consider the infinite bias limit, meaning pure dephasing. We prove that the error threshold of the modified surface code for pure dephasing noise is $50\%$, i.e., that all qubits are fully dephased, and this threshold can be achieved by a polynomial time decoding algorithm. We demonstrate that the sub-threshold behavior of the code depends critically on the precise shape and boundary conditions of the code. That is, for rectangular surface codes with standard rough/smooth open boundaries, it is controlled by the parameter $g=\gcd(j,k)$, where $j$ and $k$ are dimensions of the surface code lattice. We demonstrate a significant improvement in logical failure rate with pure dephasing for co-prime codes that have $g=1$, and closely-related rotated codes, which have a modified boundary. The effect is dramatic: the same logical failure rate achievable with a square surface code and $n$ physical qubits can be obtained with a co-prime or rotated surface code using only $O(\sqrt{n})$ physical qubits. Finally, we use approximate maximum likelihood decoding to demonstrate that this improvement persists for a general Pauli noise biased towards dephasing. In particular, comparing with a square surface code, we observe a significant improvement in logical failure rate against biased noise using a rotated surface code with approximately half the number of physical qubits.

quant-ph↗

arXiv2019

Quantum topology identification with deep neural networks and quantum walks

Topologically ordered materials may serve as a platform for new quantum technologies such as fault-tolerant quantum computers. To fulfil this promise, efficient and general methods are needed to discover and classify new topological phases of matter. We demonstrate that deep neural networks augmented with external memory can use the density profiles formed in quantum walks to efficiently identify properties of a topological phase as well as phase transitions. On a trial topological ordered model, our method's accuracy of topological phase identification reaches 97.4%, and is shown to be robust to noise on the data. Furthermore, we demonstrate that our trained DNN is able to identify topological phases of a perturbed model and predict the corresponding shift of topological phase transitions without learning any information about the perturbations in advance. These results demonstrate that our approach is generally applicable and may be used to identify a variety of quantum topological materials.

quant-ph↗

arXiv2018

Contextuality as a resource for measurement-based quantum computation beyond qubits

Contextuality - the obstruction to describing quantum mechanics in a classical statistical way - has been proposed as a resource that powers quantum computing. The measurement-based model provides a concrete manifestation of contextuality as a computational resource, as follows. If local measurements on a multi-qubit state can be used to evaluate non-linear boolean functions with only linear control processing, then this computation constitutes a proof of strong contextuality - the possible local measurement outcomes cannot all be pre-assigned. However, this connection is restricted to the special case when the local measured systems are qubits, which have unusual properties from the perspective of contextuality. A single qubit cannot allow for a proof of contextuality, unlike higher-dimensional systems, and multiple qubits can allow for state-independent contextuality with only Pauli observables, again unlike higher-dimensional generalisations. Here we identify precisely that strong non-locality is necessary in a qudit measurement-based computation that evaluates high-degree polynomial functions with only linear control. We introduce the concept of local universality, which places a bound on the space of output functions accessible under the constraint of single-qudit measurements. Thus, the partition of a physical system into subsystems plays a crucial role for the increase in computational power. A prominent feature of our setting is that the enabling resources for qubit and qudit measurement-based computations are of the same underlying nature, avoiding the pathologies associated with qubit contextuality.

quant-ph↗

arXiv2018

Fast spin exchange between two distant quantum dots

The Heisenberg exchange interaction between neighboring quantum dots allows precise voltage control over spin dynamics, due to the ability to precisely control the overlap of orbital wavefunctions by gate electrodes. This allows the study of fundamental electronic phenomena and finds applications in quantum information processing. Although spin-based quantum circuits based on short-range exchange interactions are possible, the development of scalable, longer-range coupling schemes constitutes a critical challenge within the spin-qubit community. Approaches based on capacitative coupling and cavity-mediated interactions effectively couple spin qubits to the charge degree of freedom, making them susceptible to electrically-induced decoherence. The alternative is to extend the range of the Heisenberg exchange interaction by means of a quantum mediator. Here, we show that a multielectron quantum dot with 50-100 electrons serves as an excellent mediator, preserving speed and coherence of the resulting spin-spin coupling while providing several functionalities that are of practical importance. These include speed (mediated two-qubit rates up to several gigahertz), distance (of order of a micrometer), voltage control, possibility of sweet spot operation (reducing susceptibility to charge noise), and reversal of the interaction sign (useful for dynamical decoupling from noise).

cond-mat.mes-hall↗

arXiv2018

Contextuality bounds the efficiency of classical simulation of quantum processes

Contextuality has been conjectured to be a super-classical resource for quantum computation, analogous to the role of non-locality as a super-classical resource for communication. We show that the presence of contextuality places a lower bound on the amount of classical memory required to simulate any quantum sub-theory, thereby establishing a quantitative connection between contextuality and classical simulability. We apply our result to the qubit stabilizer sub-theory, where the presence of state-independent contextuality has been an obstacle in establishing contextuality as a quantum computational resource. We find that the presence of contextuality in this sub-theory demands that the minimum number of classical bits of memory required to simulate a multi-qubit system must scale quadratically in the number of qubits; notably, this is the same scaling as the Gottesman-Knill algorithm. We contrast this result with the (non-contextual) qudit case, where linear scaling is possible.

quant-ph↗

arXiv2018

Ultrahigh Error Threshold for Surface Codes with Biased Noise

We show that a simple modification of the surface code can exhibit an enormous gain in the error correction threshold for a noise model in which Pauli Z errors occur more frequently than X or Y errors. Such biased noise, where dephasing dominates, is ubiquitous in many quantum architectures. In the limit of pure dephasing noise we find a threshold of 43.7(1)% using a tensor network decoder proposed by Bravyi, Suchara and Vargo. The threshold remains surprisingly large in the regime of realistic noise bias ratios, for example 28.2(2)% at a bias of 10. The performance is in fact at or near the hashing bound for all values of the bias. The modified surface code still uses only weight-4 stabilizers on a square lattice, but merely requires measuring products of Y instead of Z around the faces, as this doubles the number of useful syndrome bits associated with the dominant Z errors. Our results demonstrate that large efficiency gains can be found by appropriately tailoring codes and decoders to realistic noise models, even under the locality constraints of topological codes.

quant-ph↗

arXiv2018

Locality-Preserving Logical Operators in Topological Stabiliser Codes

Locality-preserving logical operators in topological codes are naturally fault-tolerant, since they preserve the correctability of local errors. Using a correspondence between such operators and gapped domain walls, we describe a procedure for finding all locality-preserving logical operators admitted by a large and important class of topological stabiliser codes. In particular, we focus on those equivalent to a stack of a finite number of surface codes of any spatial dimension, where our procedure fully specifies the group of locality-preserving logical operators. We also present examples of how our procedure applies to codes with different boundary conditions, including colour codes and toric codes, as well as more general codes such as abelian quantum double models and codes with fermionic excitations in more than two dimensions.

quant-ph↗

arXiv2017

Tensor Networks with a Twist: Anyon-permuting domain walls and defects in PEPS

We study the realization of anyon-permuting symmetries of topological phases on the lattice using tensor networks. Working on the virtual level of a projected entangled pair state, we find matrix product operators (MPOs) that realize all unitary topological symmetries for the toric and color codes. These operators act as domain walls that enact the symmetry transformation on anyons as they cross. By considering open boundary conditions for these domain wall MPOs, we show how to introduce symmetry twists and defect lines into the state.

quant-ph↗

arXiv2017

Tailored codes for small quantum memories

We demonstrate that small quantum memories, realized via quantum error correction in multi-qubit devices, can benefit substantially by choosing a quantum code that is tailored to the relevant error model of the system. For a biased noise model, with independent bit and phase flips occurring at different rates, we show that a single code greatly outperforms the well-studied Steane code across the full range of parameters of the noise model, including for unbiased noise. In fact, this tailored code performs almost optimally when compared with 10,000 randomly selected stabilizer codes of comparable experimental complexity. Tailored codes can even outperform the Steane code with realistic experimental noise, and without any increase in the experimental complexity, as we demonstrate by comparison in the observed error model in a recent 7-qubit trapped ion experiment.

quant-ph↗

arXiv2017

Robust symmetry-protected metrology with the Haldane phase

We propose a metrology scheme that is made robust to a wide range of noise processes by using the passive, error-preventing properties of symmetry-protected topological phases. The so-called fractionalized edge mode of an antiferromagnetic Heisenberg spin-1 chain in a rotationally-symmetric Haldane phase can be used to measure the direction of an unknown electric field, by exploiting the way in which the field direction reduces the symmetry of the chain. Specifically, the direction of the field is registered in the holonomy under an adiabatic sensing protocol, and the degenerate fractionalized edge mode is protected through this process by the remaining reduced symmetry. We illustrate the scheme with respect to a potential realization by Rydberg dressed atoms.

quant-ph↗

arXiv2017

Spin of a multielectron quantum dot and its interaction with a neighboring electron

We investigate the spin of a multielectron GaAs quantum dot in a sequence of nine charge occupancies, by exchange coupling the multielectron dot to a neighboring two-electron double quantum dot. For all nine occupancies, we make use of a leakage spectroscopy technique to reconstruct the spectrum of spin states in the vicinity of the interdot charge transition between a single- and a multielectron quantum dot. In the same regime we also perform time-resolved measurements of coherent exchange oscillations between the single- and multielectron quantum dot. With these measurements, we identify distinct characteristics of the multielectron spin state, depending on whether the dot's occupancy is even or odd. For three out of four even occupancies we do not observe any exchange interaction with the single quantum dot, indicating a spin-0 ground state. For the one remaining even occupancy, we observe an exchange interaction that we associate with a spin-1 multielectron quantum dot ground state. For all five of the odd occupancies, we observe an exchange interaction associated with a spin-1/2 ground state. For three of these odd occupancies, we clearly demonstrate that the exchange interaction changes sign in the vicinity of the charge transition. For one of these, the exchange interaction is negative (i.e. triplet-preferring) beyond the interdot charge transition, consistent with the observed spin-1 for the next (even) occupancy. Our experimental results are interpreted through the use of a Hubbard model involving two orbitals of the multielectron quantum dot. Allowing for the spin correlation energy (i.e. including a term favoring Hund's rules) and different tunnel coupling to different orbitals, we qualitatively reproduce the measured exchange profiles for all occupancies.

cond-mat.mes-hall↗

arXiv2017

Topological proofs of contextuality in quantum mechanics

We provide a cohomological framework for contextuality of quantum mechanics that is suited to describing contextuality as a resource in measurement-based quantum computation. This framework applies to the parity proofs first discussed by Mermin, as well as a different type of contextuality proofs based on symmetry transformations. The topological arguments presented can be used in the state-dependent and the state-independent case.

quant-ph↗

arXiv2017

Long-range entanglement for spin qubits via quantum Hall edge modes

We propose and analyse a scheme for performing a long-range entangling gate for qubits encoded in electron spins trapped in semiconductor quantum dots. Our coupling makes use of an electrostatic interaction between the state-dependent charge configurations of a singlet-triplet qubit and the edge modes of a quantum Hall droplet. We show that distant singlet-triplet qubits can be selectively coupled, with gate times that can be much shorter than qubit dephasing times and faster than decoherence due to coupling to the edge modes. Based on parameters from recent experiments, we argue that fidelities above 99% could in principle be achieved for a two-qubit entangling gate taking as little as 20 ns.

cond-mat.mes-hall↗

arXiv2017

Symmetry protected topological order at nonzero temperature

We address the question of whether symmetry-protected topological (SPT) order can persist at nonzero temperature, with a focus on understanding the thermal stability of several models studied in the theory of quantum computation. We present three results in this direction. First, we prove that nontrivial SPT order protected by a global on-site symmetry cannot persist at nonzero temperature, demonstrating that several quantum computational structures protected by such on-site symmetries are not thermally stable. Second, we prove that the 3D cluster state model used in the formulation of topological measurement-based quantum computation possesses a nontrivial SPT-ordered thermal phase when protected by a global generalized (1-form) symmetry. The SPT order in this model is detected by long-range localizable entanglement in the thermal state, which compares with related results characterizing SPT order at zero temperature in spin chains using localizable entanglement as an order parameter. Our third result is to demonstrate that the high error tolerance of this 3D cluster state model for quantum computation, even without a protecting symmetry, can be understood as an application of quantum error correction to effectively enforce a 1-form symmetry.

quant-ph↗