Search

A fault-tolerant quantum processor may be configured using stationary qubits interacting only with their nearest neighbours, but at the cost of significant overheads in physical qubits per logical qubit. Such overheads could be reduced by coherently transporting qubits across the chip, allowing connectivity beyond immediate neighbours. Here we demonstrate high-fidelity coherent transport of an electron spin qubit between quantum dots in isotopically-enriched silicon. We observe qubit precession in the inter-site tunnelling regime and assess the impact of qubit transport using Ramsey interferometry and quantum state tomography techniques. We report a polarization transfer fidelity of 99.97% and an average coherent transfer fidelity of 99.4%. Our results provide key elements for high-fidelity, on-chip quantum information distribution, as long envisaged, reinforcing the scaling prospects of silicon-based spin qubits., Nature Communications, 12 (1), ISSN:2041-1723

The performance requirements for fault-tolerant quantum computing are very stringent. Qubits must be manipulated, coupled, and measured with error rates well below 1%. For semiconductor implementations, silicon quantum dot spin qubits have demonstrated average single-qubit Clifford gate error rates that approach this threshold, notably with error rates of 0.14% in isotopically enriched $^{28}$Si/SiGe devices. This gate performance, together with high-fidelity two-qubit gates and measurements, is only known to meet the threshold for fault-tolerant quantum computing in some architectures when assuming that the noise is incoherent, and still lower error rates are needed to reduce overhead. Here we experimentally show that pulse engineering techniques, widely used in magnetic resonance, improve average Clifford gate error rates for silicon quantum dot spin qubits to 0.043%,a factor of 3 improvement on previous best results for silicon quantum dot devices. By including tomographically complete measurements in randomised benchmarking, we infer a higher-order feature of the noise called the unitarity, which measures the coherence of noise. This in turn allows us to theoretically predict that average gate error rates as low as 0.026% may be achievable with further pulse improvements. These fidelities are ultimately limited by Markovian noise, which we attribute to charge noise emanating from the silicon device structure itself, or the environment.

Electron spins in semiconductor quantum dots have been intensively studied for implementing quantum computation and high-fidelity single- and two-qubit operations have recently been achieved. Quantum teleportation is a three-qubit protocol exploiting quantum entanglement and it serves as an essential primitive for more sophisticated quantum algorithms. Here we demonstrate a scheme for quantum teleportation based on direct Bell measurement for a single-electron spin qubit in a triple quantum dot utilizing the Pauli exclusion principle to create and detect maximally entangled states. The single spin polarization is teleported from the input qubit to the output qubit. We find this fidelity is primarily limited by singlet–triplet mixing, which can be improved by optimizing the device parameters. Our results may be extended to quantum algorithms with a larger number of semiconductor spin qubits.

Performing large calculations with a quantum computer will likely require a fault-tolerant architecture based on quantum error-correcting codes. The challenge is to design practical quantum error-correcting codes that perform well against realistic noise using modest resources. Here we show that a variant of the surface code -- the XZZX code -- offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel; it is the first explicit code shown to have this universal property. We present numerical evidence that the threshold even exceeds this hashing bound for an experimentally relevant range of noise parameters. Focusing on the common situation where qubit dephasing is the dominant noise, we show that this code has a practical, high-performance decoder and surpasses all previously known thresholds in the realistic setting where syndrome measurements are unreliable. We go on to demonstrate the favourable sub-threshold resource scaling that can be obtained by specialising a code to exploit structure in the noise. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation., 10+6 pages, 11 figures; v2 - minor clarifying changes; v3 - final author version. Data and code used to produce our results available at https://bitbucket.org/qecsim/qsdxzzx/. The available software extends and uses services from the quantum error correction simulation package qecsim

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., Comment: 22 pages + appendices, 25 figures; v2 improvements to presentation; v3 published version

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., 13 pages, 5 figures and 4 tables

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., Comment: 6 pages, 4 figures, comments welcome; v2 published version, now includes supplemental material with a technical description of the implemented decoders

Electron spins in quantum dots are a promising building block for quantum computing. While fundamental gate operations on single and two qubits have been demonstrated, quantum algorithms utilizing three or more qubits have not tested so far. Quantum teleportation is one of the important milestones that can be implemented with three qubits, because it explicitly makes use of quantum entanglement and is applicable to quantum communication and quantum computing. The key of Quantum teleportation is to prepare one of maximally entangled states and perform projection measurement onto them. These can be, in principle, implemented by using a two-qubit gate operation and a series of single-qubit operations. However, realization of those controls remains challenging in three-spin-qubit systems. Instead, the Pauli spin blockade can be utilized to prepare and selectively measure one of the maximally entangled state. This significantly simplifies partial implementation of the quantum teleportation protocol.

Scalable quantum processors require tunable two-qubit gates that are fast, coherent and long-range. The Heisenberg exchange interaction offers fast and coherent couplings for spin qubits, but is intrinsically short-ranged. Here, we demonstrate that its range can be increased by employing a multielectron quantum dot as a mediator, while preserving speed and coherence of the resulting spin-spin coupling. We do this by placing a large quantum dot with 50–100 electrons between a pair of two-electron double quantum dots that can be operated and measured simultaneously. Two-spin correlations identify coherent spin-exchange processes across the multielectron quantum dot. We further show that different physical regimes of the mediated exchange interaction allow a reduced susceptibility to charge noise at sweet spots, as well as positive and negative coupling strengths up to several gigahertz. These properties make multielectron dots attractive as scalable, voltage-controlled coherent coupling elements., Controllable two-qubit interactions are necessary to build a functional quantum computer. Here the authors demonstrate fast, coherent swapping of two spin states mediated by a long, multi-electron quantum dot that could act as a tunable coupler mediating interactions between multiple qubits.

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., Comment: 20 pages, 13 figures, 2 tables

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., Comment: 14 pages, 3 figures, comments welcome; v3 published version

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., Comment: 18+4 pages, 24 figures; v2 includes additional coauthor (ASD) and new results on the performance of surface codes in the finite-bias regime, obtained with beveled surface codes and an improved tensor network decoder; v3 published version

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., 42 pages, 10 figures, comments welcome; v2 published version

Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are implemented via single-site measurements on a fixed universal resource state. Here we adapt the randomized benchmarking protocol for a single qubit to a linear cluster state computation, which provides partial, yet efficient characterization of the noise associated with the target gate set. Applying randomized benchmarking to measurement-based quantum computation exhibits an interesting interplay between the inherent randomness associated with logic gates in the measurement-based model and the random gate sequences used in benchmarking. We consider two different approaches: the first makes use of the standard single-qubit Clifford group, while the second uses recently introduced (non-Clifford) measurement-based 2-designs, which harness inherent randomness to implement gate sequences., 10 pages, 4 figures, comments welcome; v2 published version

What gives quantum computers that extra oomph over their classical digital counterparts? An intrinsic, measurable aspect of quantum mechanics called contextuality, it now emerges. See Article p.351 It is widely appreciated that quantum computing promises advantages over classical computing in certain circumstances and for certain problems. But what are the specific features of quantum mechanics that are ultimately responsible for this enhanced potential? Mark Howard and colleagues identify 'quantum contextuality' — a generalization of the concept of quantum non-locality — as the critical resource that gives quantum computers their power. This finding not only provides clarification of the theoretical basis of quantum computing, it also provides a framework for directing experimental efforts to most effectively harness the weirdness of quantum mechanics for computational tasks.

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., 5 pages + 1 page appendix, 1 figure, comments welcome; v2 published version

Quantum computers require many quantum bits to perform complex calculations, but devices with more than a few bits are difficult to program. A device based on five atomic quantum bits shows a way forward. See Letter p.63 The functional quantum computer is eagerly awaited in certain circles. For instance, for problems such as simulation of chemical reactions and factoring large numbers, a quantum computer would outperform any classical computer. Although algorithms have been run on small quantum computers, it has not so far been possible to design a programmable quantum computer that is easily reconfigurable and in which different algorithms can be compiled without changing the hardware. Here Shantanu Debnath and colleagues demonstrate such a small programmable quantum computer, using five trapped atomic ions as qubits. The architecture could in principle be scaled up to a larger number of qubits.

We identify "proper quantum computation" with computational processes that cannot be efficiently simulated on a classical computer. For optical quantum computation, we establish "no-go" theorems for classes of quantum optical experiments that cannot yield proper quantum computation, and we identify requirements for optical proper quantum computation that correspond to violations of assumptions underpinning the no-go theorems., Comment: 11 pages, no figures

We analyse a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased. The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal fault-tolerant quantum computation using only Clifford gates that preserve the noise bias. We analyse the distillation of $|T\rangle$-type magic states using this gadget at the physical level, followed by concatenation with the 15-qubit quantum Reed-Muller code, and comparing our results with standard constructions. In the regime where the noise bias (rate of Pauli $Z$ errors relative to other single-qubit errors) is greater than a factor of 10, our scheme has lower overhead across a broad range of relevant noise rates., Comment: 9 pages, 6 figures, comments welcome; v2 published version

We show that non-exponential fidelity decays in randomized benchmarking experiments on quantum dot qubits are consistent with numerical simulations that incorporate low-frequency noise. By expanding standard randomized benchmarking analysis to this experimental regime, we find that such non-exponential decays are better modeled by multiple exponential decay rates, leading to an instantaneous control fidelity for isotopically-purified-silicon MOS quantum dot qubits which can be as high as 99.9% when low-frequency noise conditions and system calibrations are favorable. These advances in qubit characterization and validation methods underpin the considerable prospects for silicon as a qubit platform for fault-tolerant quantum computation., Comment: 6 pages, 4 figures

We study the spectral properties of a family of quantum antiferromagnets on two-dimensional (2D) lattices. This family of models is obtained by a deformation of the well-studied 2D quantum antiferromagnetic model of Affleck, Kennedy, Lieb and Tasaki (AKLT); they are described by two-body, frustration-free Hamiltonians on a three-colourable lattice of spins. Although the existence of a spectral gap in the 2D AKLT model remains an open question, we rigorously prove the existence of a gap for a subset of this family of quantum antiferromagnets. Along with providing new progress for the gap problem in AKLT-type antiferromagnets in 2D, this result has implications for the theory of quantum computation as it provides a family of two-body Hamiltonians for which the ground state is a resource for universal quantum computation and for which a spectral gap is proven to exist., Comment: 14 pages, 6 figures, comments welcome; v2 published version

The framework of measurement-based quantum computation (MBQC) allows us to view the ground states of local Hamiltonians as potential resources for universal quantum computation. A central goal in this field is to find models with ground states that are universal for MBQC and that are also natural in the sense that they involve only two-body interactions and have a small local Hilbert space dimension. Graph states are the original resource states for MBQC, and while it is not possible to obtain graph states as exact ground states of two-body Hamiltonians here we construct two-body frustration-free Hamiltonians that have arbitrarily good approximations of graph states as unique ground states. The construction involves taking a two-body frustration-free model that has a ground state convertible to a graph state with stochastic local operations, then deforming the model such that its ground state is close to a graph state. Each graph state qubit resides in a subspace of a higher dimensional particle. This deformation can be applied to two-body frustration-free Affleck-Kennedy-Lieb-Tasaki (AKLT) models, yielding Hamiltonians that are exactly solvable with exact tensor network expressions for ground states. For the star-lattice AKLT model, the ground state of which is not expected to be a universal resource for MBQC, applying such a deformation appears to enhance the computational power of the ground state, promoting it to a universal resource for MBQC. Transitions in computational power, similar to percolation phase transitions, can be observed when Hamiltonians are deformed in this way. Improving the fidelity of the ground state comes at the cost of a shrinking gap. While analytically proving gap properties for these types of models is difficult in general, we provide a detailed analysis of the deformation of a spin-1 AKLT state to a linear graph state., Comment: 16 pages, 5 figures, comments welcome; v2 published version

Defects in topologically ordered models have interesting properties that are reminiscent of the anyonic excitations of the models themselves. For example, dislocations in the toric code model are known as twists and possess properties that are analogous to Ising anyons. We strengthen this analogy by using the topological entanglement entropy as a diagnostic tool to identify properties of both defects and excitations in the toric code. Specifically, we show, through explicit calculation, that the toric code model including twists and dyon excitations has the same quantum dimensions, the same total quantum dimension, and the same fusion rules as an Ising anyon model., 4+3 pages, 4 figures, comments welcome; v2 references added; v3 published version

The two-dimensional cluster state, a universal resource for measurement-based quantum computation, is also the gapped ground state of a short-ranged Hamiltonian. Here, we examine the effect of perturbations to this Hamiltonian. We prove that, provided the perturbation is sufficiently small and respects a certain symmetry, the perturbed ground state remains a universal resource. We do this by characterising the operation of an adaptive measurement protocol throughout a suitable symmetry-protected quantum phase, relying on generic properties of the phase rather than any analytic control over the ground state., Comment: 20 pages plus appendices, 11 figures, comments very welcome; v2 minor corrections and additional references; v3 published version with minor corrections

Ground states of spin lattices can serve as a resource for measurement-based quantum computation. Ideally, the ability to perform quantum gates via measurements on such states would be insensitive to small variations in the Hamiltonian. Here, we describe a class of symmetry-protected topological orders in one-dimensional systems, any one of which ensures the perfect operation of the identity gate. As a result, measurement-based quantum gates can be a robust property of an entire phase in a quantum spin lattice, when protected by an appropriate symmetry., Comment: 5 pages, 1 figure, comments welcome; v2 fixed minor typographic errors; v3 published version

Single-spin measurements on the ground state of an interacting spin lattice can be used to perform a quantum computation. We show how such measurements can mimic renormalization group transformations and remove the short-ranged variations of the state that can reduce the fidelity of a computation. This suggests that the quantum computational ability of a spin lattice could be a robust property of a quantum phase. We illustrate our idea with the ground state of a spin-1 chain, which can serve as a quantum computational wire not only at the Affleck-Kennedy-Lieb-Tasaki point, but within the rotationally-invariant Haldane phase., v2: 4 pages, 3 figures; improved description of buffering scheme and connection to string operators. v3: final published version

Measurement-based quantum computing, a powerful alternative to the standard circuit model, proceeds using only local adaptive measurements on a highly-entangled resource state of many spins on a graph or lattice. Along with the canonical cluster state, the valence-bond solid ground state on a chain of spin-1 particles, studied by Affleck, Kennedy, Lieb, and Tasaki (AKLT), is such a resource state. We propose a simulation of this AKLT state using linear optics, wherein we can make use of the high-fidelity projective measurements that are commonplace in quantum optical experiments, and describe how quantum logic gates can be performed on this chain. In our proposed implementation, the spin-1 particles comprizing the AKLT state are encoded on polarization biphotons: three level systems consisting of pairs of polarized photons in the same spatio-temporal mode. A logical qubit encoded on the photonic AKLT state can be initialized, read out and have an arbitrary single qubit unitary applied to it by performing projective measurements on the constituent biphotons. For MBQC, biphoton measurements are required which cannot be deterministically performed using only linear optics and photodetection., 9 pages, 4 figures, published version

We present the theory of how to achieve phase measurements with the minimum possible variance in ways that are readily implementable with current experimental techniques. Measurements whose statistics have high-frequency fringes, such as those obtained from NOON states, have commensurately high information yield. However this information is also highly ambiguous because it does not distinguish between phases at the same point on different fringes. We provide schemes to eliminate this phase ambiguity in a highly efficient way, providing phase estimates with uncertainty that is within a small constant factor of the Heisenberg limit, the minimum allowed by the laws of quantum mechanics. These techniques apply to NOON state and multi-pass interferometry, as well as phase measurements in quantum computing. We have reported the experimental implementation of some of these schemes with multi-pass interferometry elsewhere. Here we present the theoretical foundation, and also present some new experimental results. There are three key innovations to the theory in this paper. First, we examine the intrinsic phase properties of the sequence of states (in multiple time modes) via the equivalent two-mode state. Second, we identify the key feature of the equivalent state that enables the optimal scaling of the intrinsic phase uncertainty to be obtained. This enables us to identify appropriate combinations of states to use. The remaining difficulty is that the ideal phase measurements to achieve this intrinic phase uncertainty are often not physically realizable. The third innovation is to solve this problem by using realizable measurements that closely approximate the optimal measurements, enabling the optimal scaling to be preserved., 23 pages, 10 figures; new general definition of resources

Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state model, and by using nonlocal correlation functions that quantify the fidelity of quantum gates performed between distant qubits, we demonstrate that it possesses a quantum (zero-temperature) phase transition between a disordered phase and an ordered "cluster phase" in which it is possible to perform a universal set of quantum gates., 5 pages, 2 figures, comments welcome; v2 has had many technical detailed removed, and gives a simplified presentation; v3 published version

We consider measurement-based quantum computation using the state of a spin-lattice system in equilibrium with a thermal bath and free to evolve under its own Hamiltonian. Any single qubit measurements disturb the system from equilibrium and, with adaptive measurements performed at a finite rate, the resulting dynamics reduces the fidelity of the computation. We show that it is possible to describe the loss in fidelity by a single quantum operation on the encoded quantum state that is independent of the measurement history. To achieve this simple description, we choose a particular form of spin-boson coupling to describe the interaction with the environment, and perform measurements periodically at a natural rate determined by the energy gap of the system. We found that an optimal cooling exists, which is a trade-off between keeping the system cool enough that the resource state remains close to the ground state, but also isolated enough that the cooling does not strongly interfere with the dynamics of the computation. For a sufficiently low temperature we obtain a fault-tolerant threshold for the couplings to the environment., Comment: 9 pages, 3 figures; v2 published version

We present a general procedure for constructing lattices of qubits with a Hamiltonian composed of nearest-neighbour two-body interactions such that the ground state encodes a cluster state. We give specific details for lattices in one-, two-, and three-dimensions, investigating both periodic and fixed boundary conditions, as well as present a proof for the applicability of this procedure to any graph. We determine the energy gap of these systems, which is shown to be independent of the size of the lattice but dependent on the type of lattice (in particular, the coordination number), and investigate the scaling of this gap in terms of the coupling constants of the Hamiltonian. We provide a comparative analysis of the different lattice types with respect to their usefulness for measurement-based quantum computation., 16 pages, 5 figures, comments welcome; v2 added some new results about exact solutions to this model; v3 published version

We show that the usefulness of the thermal state of a specific spin-lattice model for measurement-based quantum computing exhibits a transition between two distinct "phases" - one in which every state is a universal resource for quantum computation, and another in which any local measurement sequence can be simulated efficiently on a classical computer. Remarkably, this transition in computational power does not coincide with any phase transition, classical or quantum, in the underlying spin-lattice model., Comment: 9 pages, 2 figures, v4 published version

Recently, there has been much interest in a new kind of ``unspeakable'' quantum information that stands to regular quantum information in the same way that a direction in space or a moment in time stands to a classical bit string: the former can only be encoded using particular degrees of freedom while the latter are indifferent to the physical nature of the information carriers. The problem of correlating distant reference frames, of which aligning Cartesian axes and synchronizing clocks are important instances, is an example of a task that requires the exchange of unspeakable information and for which it is interesting to determine the fundamental quantum limit of efficiency. There have also been many investigations into the information theory that is appropriate for parties that lack reference frames or that lack correlation between their reference frames, restrictions that result in global and local superselection rules. In the presence of these, quantum unspeakable information becomes a new kind of resource that can be manipulated, depleted, quantified, etcetera. Methods have also been developed to contend with these restrictions using relational encodings, particularly in the context of computation, cryptography, communication, and the manipulation of entanglement. This article reviews the role of reference frames and superselection rules in the theory of quantum information processing., Comment: 55 pages, published version

We present a simple quantum many-body system - a two-dimensional lattice of qubits with a Hamiltonian composed of nearest-neighbor two-body interactions - such that the ground state is a universal resource for quantum computation using single-qubit measurements. This ground state approximates a cluster state that is encoded into a larger number of physical qubits. The Hamiltonian we use is motivated by the projected entangled pair states, which provide a transparent mechanism to produce such approximate encoded cluster states on square or other lattice structures (as well as a variety of other quantum states) as the ground state. We show that the error in this approximation takes the form of independent errors on bonds occurring with a fixed probability. The energy gap of such a system, which in part determines its usefulness for quantum computation, is shown to be independent of the size of the lattice. In addition, we show that the scaling of this energy gap in terms of the coupling constants of the Hamiltonian is directly determined by the lattice geometry. As a result, the approximate encoded cluster state obtained on a hexagonal lattice (a resource that is also universal for quantum computation) can be shown to have a larger energy gap than one on a square lattice with an equivalent Hamiltonian., Comment: 5 pages, 1 figure; v2 has a simplified lattice, an extended analysis of errors, and some additional references; v3 published version

We introduce methods for clock synchronization that make use of the adiabatic exchange of nondegenerate two-level quantum systems: ticking qubits. Schemes involving the exchange of N independent qubits with frequency $\omega$ give a synchronization accuracy that scales as $(\omega\sqrt{N})^{-1}$, i.e., as the standard quantum limit. We introduce a protocol that makes use of N coherent exchanges of a single qubit at frequency $\omega$, leading to an accuracy that scales as $(\omega N)^{-1}\log N$. This protocol beats the standard quantum limit without the use of entanglement, and we argue that this scaling is the fundamental limit for clock synchronization allowed by quantum mechanics. We analyse the performance of these protocols when used with a lossy channel., Comment: 9 pages, 1 figure, published version

Two-qubit entangling gates allow the realization of new types of generalized quantum measurement. We discuss, and use photonic systems to demonstrate, two instances of this: two-qubit entangling measurements realizing superior discrimination of locally prepared two-qubit quantum states relative to what is achievable with local measurements and classical communication; and nondestructive weak measurements with postselection, leading to quantum weak values.

Measuring the polarisation of a single photon typically results in its destruction. We propose, demonstrate, and completely characterise a \emph{quantum non-demolition} (QND) scheme for realising such a measurement non-destructively. This scheme uses only linear optics and photo-detection of ancillary modes to induce a strong non-linearity at the single photon level, non-deterministically. We vary this QND measurement continuously into the weak regime, and use it to perform a non-destructive test of complementarity in quantum mechanics. Our scheme realises the most advanced general measurement of a qubit: it is non-destructive, can be made in any basis, and with arbitrary strength., 4 pages, 3 figures

We perform a QND measurement of single photon polarization, achieved using measurement-induced nonlinearity. This QND measurement, varied from strong to weak, is used to perform a fundamental test of complementarity in an interferometer

Using quantum state tomography, we completely characterise entangled qubits and qutrits encoded in photons in different transverse spatial modes. We investigate using such entangled qutrits for quantum bit commitment, the basis of quantum coin flipping

Summary form only given. The use of continuous-variable (CV) quantum computing allows information to be encoded and processed much more compactly and efficiently than with discrete-variable (qubit) computing. That is, with CV realizations, one can perform quantum information processes using fewer coupled quantum systems: a considerable advantage for the experimental realization of quantum computing. As a result, CV quantum information theory is of interest in quantum error correction, quantum cryptography and quantum teleportation. For example, quantum teleportation has recently been tested experimentally in the CV domain. The current proposed realization of CV quantum computation employs position eigenstates as a computational basis; these states are approximated in experiment using highly squeezed states. We introduce new CV representations, where the generalized Pauli group is generated by the number and phase operators for harmonic oscillators, and the computational basis is given by either harmonic oscillator energy eigenstates or phase eigenstates.

We show that a universal set of gates for quantum computation with optics can be quantum teleported through the use of EPR entangled states, homodyne detection, and linear optics and squeezing operations conditioned on measurement outcomes. This scheme may be used for fault-tolerant quantum computation in any optical scheme (qubit or continuous variable). The teleportation of nondeterministic nonlinear gates employed in linear optics quantum computation is discussed., 4 pages, 1 figure, published version

Although universal continuous-variable quantum computation cannot be achieved via linear optics (including squeezing), homodyne detection and feed-forward, inclusion of ideal photon counting measurements overcomes this obstacle. These measurements are sometimes described by arrays of beam splitters to distribute the photons across several modes. We show that such a scheme cannot be used to implement ideal photon counting and that such measurements necessarily involve nonlinear evolution. However, this requirement of nonlinearity can be moved "off-line," thereby permitting universal continuous-variable quantum computation with linear optics., 6 pages, no figures, replaced with published version

We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for analyses of quantum vs classical computation, in practice qubits are often realized in higher-dimensional systems by truncating all but two levels, thereby reducing the size of the precious Hilbert space. We develop natural qudit gates for universal quantum computation, and exploit the entire accessible Hilbert space. Mathematically, we give representations of the generalized Pauli group for qudits in coupled spin systems and harmonic oscillators, and include analyses of the qubit and the infinite-dimensional limits., Comment: 4 pages, published version

While solid-state devices offer naturally reliable hardware for modern classical computers, thus far quantum information processors resemble vacuum tube computers in being neither reliable nor scalable. Strongly correlated many body states stabilized in topologically ordered matter offer the possibility of naturally fault tolerant computing, but are both challenging to engineer and coherently control and cannot be easily adapted to different physical platforms. We propose an architecture which achieves some of the robustness properties of topological models but with a drastically simpler construction. Quantum information is stored in the symmetry-protected degenerate ground states of spin-1 chains, while quantum gates are performed by adiabatic non-Abelian holonomies using only single-site fields and nearest-neighbor couplings. Gate operations respect the symmetry, and so inherit some protection from noise and disorder from the symmetry-protected ground states., New Journal of Physics, 15, ISSN:1367-2630

Recently, it was shown that the non-local correlations needed for measurement-based quantum computation (MBQC) can be revealed in the ground state of the Affleck–Kennedy–Lieb–Tasaki (AKLT) model involving nearest-neighbour spin-3/2 interactions on a honeycomb lattice. This state is not singular but resides in the disordered phase of the ground states of a large family of Hamiltonians characterized by short-range-correlated valence bond solid states. By applying local filtering and adaptive single-particle measurements, we show that most states in the disordered phase can be reduced to a graph of correlated qubits that is a scalable resource for MBQC. At the transition between the disordered and Neel ordered phases, we find a transition from universal to non-universal states as witnessed by the scaling of percolation in the reduced graph state.

We investigate the degradation of reference frames, treated as dynamical quantum systems, and quantify their longevity as a resource for performing tasks in quantum information processing. We adopt an operational measure of a reference frame's longevity, namely, the number of measurements that can be made against it with a certain error tolerance. We investigate two distinct types of reference frame: a reference direction, realized by a spin-j system, and a phase reference, realized by an oscillator mode with bounded energy. For both cases, we show that our measure of longevity increases quadratically with the size of the reference system and is therefore non-additive. For instance, the number of measurements that a directional reference frame consisting of N parallel spins can be put to use scales as N^2. Our results quantify the extent to which microscopic or mesoscopic reference frames may be used for repeated, high-precision measurements, without needing to be reset - a question that is important for some implementations of quantum computing. We illustrate our results using the proposed single-spin measurement scheme of magnetic resonance force microscopy., Comment: 9 pages plus appendices, 4 figures, published version