arXiv subjects

Earl T. Campbell

Publications and source records attributed to Earl T. Campbell.

At least 55 records · Page 3Linked to original sources

arXiv2018

An Efficient Quantum Compiler that reduces $T$ count

Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum circuit decompositions for the same algorithm but it is desirable to compile leaner circuits. A fundamentally important cost metric is the $T$ count -- the number of $T$ gates in a circuit. For the single qubit case, optimal compiling is essentially a solved problem. However, multi-qubit compiling is a harder problem with optimal algorithms requiring classical runtime exponential in the number of qubits. Here, we present and compare several efficient quantum compilers for multi-qubit Clifford + $T$ circuits. We implemented our compilers in C++ and benchmarked them on random circuits, from which we determine that our TODD compiler yields the lowest $T$ counts on average. We also benchmarked TODD on a library of reversible logic circuits that appear in quantum algorithms and found that it reduced the $T$ count for 97\% of the circuits with an average $T$-count saving of 20\% when compared against the best of all previous circuit decompositions.

quant-ph↗

arXiv2018

Magic state parity-checker with pre-distilled components

Magic states are eigenstates of non-Pauli operators. One way of suppressing errors present in magic states is to perform parity measurements in their non-Pauli eigenbasis and postselect on even parity. Here we develop new protocols based on non-Pauli parity checking, where the measurements are implemented with the aid of pre-distilled multiqubit resource states. This leads to a two step process: pre-distillation of multiqubit resource states, followed by implementation of the parity check. These protocols can prepare single-qubit magic states that enable direct injection of single-qubit axial rotations without subsequent gate-synthesis and its associated overhead. We show our protocols are more efficient than all previous comparable protocols with quadratic error reduction, including the protocols of Bravyi and Haah.

quant-ph↗

arXiv2017

Optimal Quantum Metrology of Distant Black Bodies

Measurements of an object's temperature are important in many disciplines, from astronomy to engineering, as are estimates of an object's spatial configuration. We present the quantum optimal estimator for the temperature of a distant body based on the black body radiation received in the far-field. We also show how to perform separable quantum optimal estimates of the spatial configuration of a distant object, i.e. imaging. In doing so we necessarily deal with multi-parameter quantum estimation of incompatible observables, a problem that is poorly understood. We compare our optimal observables to the two mode analogue of lensed imaging and find that the latter is far from optimal, even when compared to measurements which are separable. To prove the optimality of the estimators we show that they minimise the cost function weighted by the quantum Fisher information---this is equivalent to maximising the average fidelity between the actual state and the estimated one.

quant-ph↗

arXiv2017

Application of a resource theory for magic states to fault-tolerant quantum computing

Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. We first show that robustness of magic is a well-behaved magic monotone that operationally quantifies the classical simulation overhead for a Gottesman-Knill type scheme using ancillary magic states. Our framework subsequently finds immediate application in the task of synthesizing non-Clifford gates using magic states. When magic states are interspersed with Clifford gates, Pauli measurements and stabilizer ancillas - the most general synthesis scenario - then the class of synthesizable unitaries is hard to characterize. Our techniques can place non-trivial lower bounds on the number of magic states required for implementing a given target unitary. Guided by these results we have found new and optimal examples of such synthesis.

quant-ph↗

arXiv2017

Unifying gate-synthesis and magic state distillation

The leading paradigm for performing computation on quantum memories can be encapsulated as distill-then-synthesize. Initially, one performs several rounds of distillation to create high-fidelity magic states that provide one good T gate, an essential quantum logic gate. Subsequently, gate synthesis intersperses many T gates with Clifford gates to realise a desired circuit. We introduce a unified framework that implements one round of distillation and multi-qubit gate synthesis in a single step. Typically, our method uses the same number of T gates as conventional synthesis, but with the added benefit of quadratic error suppression. Because of this, one less round of magic state distillation needs to be performed, leading to significant resource savings.

quant-ph↗

arXiv2016

Quantum computation with realistic magic state factories

Leading approaches to fault-tolerant quantum computation dedicate a significant portion of the hardware to computational factories that churn out high-fidelity ancillas called magic states. Consequently, efficient and realistic factory design is of paramount importance. Here we present the most detailed resource assessment to date of magic state factories within a surface code quantum computer, along the way introducing a number of new techniques. We show that the block codes of Bravyi and Haah [Phys. Rev. A 86, 052329 (2012)] have been systematically undervalued; we track correlated errors both numerically and analytically, providing fidelity estimates without appeal to the union bound. We also introduce a subsystem code realisation of these protocols with constant time and low ancilla cost. Additionally, we confirm that magic state factories have space-time costs that scale as a constant factor of surface code costs. We find that the magic state factory required for post-classical factoring can be as small as 6.3 million data qubits, ignoring ancilla qubits, assuming $10^{-4}$ error gates, and the availability of long range interactions.

quant-ph↗

arXiv2016

An efficient magic state approach to small angle rotations

Standard error correction techniques only provide a quantum memory and need extra gadgets to perform computation. Central to quantum algorithms are small angle rotations, which can be fault-tolerantly implemented given a supply of an unconventional species of magic state. We present a low-cost distillation routine for preparing these small angle magic states. Our protocol builds on the work of Duclos-Cianci and Poulin [Phys. Rev. A, 91, 042315 (2015)] by compressing their circuit. Additionally, we present a method of diluting magic states that reduces costs associated with very small angle rotations. We quantify performance by the expected number of noisy magic states consumed per rotation, and compare with other protocols. For modest size angles, our protocols offer a factor 24 improvement over the best known gate synthesis protocols and a factor 2 over the Duclos-Cianci and Poulin protocol. For very small angle rotations, the dilution protocol dramatically reduces costs, giving several orders magnitude improvement over competitors. There also exists an intermediary regime of small, but not very small, angles where our approach gives a marginal improvement over gate synthesis. We discuss how different performance metrics may alter these conclusions.

quant-ph↗

arXiv2015

Cellular-automaton decoders for topological quantum memories

We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed of small local memories, communicating with neighbours, and repeatedly performing identical simple update rules. This approach does not require any global operations or complex decoding algorithms. Our cellular automata draw inspiration from classical field theories, with a Coulomb-like potential naturally emerging from the local dynamics. For a 3D automaton coupled to a 2D toric code, we present evidence of an error correction threshold above 6.1% for uncorrelated noise. A 2D automaton equipped with a more complex update rule yields a threshold above 8.2%. Our framework provides decisive new tools in the quest for realising a passive dissipative quantum memory.

quant-ph↗

arXiv2015

Enhanced fault-tolerant quantum computing in $d$-level systems

Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford gate. Codes with the desired property are presented for $d$-level, qudit, systems with prime $d$. The codes use $n=d-1$ qudits and can detect upto $\sim d/3$ errors. We quantify the performance of these codes for one approach to quantum computation, known as magic state distillation. Unlike prior work, we find performance is always enhanced by increasing $d$.

quant-ph↗

arXiv2015

Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions

Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, d-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological quantum codes with remarkable transversality properties, can be generalized to the qudit paradigm. In recent developments it was found that in three spatial dimensions a qubit color code can support a transversal non-Clifford gate, and that in higher spatial dimensions additional non-Clifford gates can be found, saturating Bravyi and König's bound [Phys. Rev. Lett. 110, 170503 (2013)]. Furthermore, by using gauge fixing techniques, an effective set of Clifford gates can be achieved, removing the need for state distillation. We show that the qudit color code can support the qudit analogues of these gates, and show that in higher spatial dimensions a color code can support a phase gate from higher levels of the Clifford hierarchy which can be proven to saturate Bravyi and König's bound in all but a finite number of special cases. The methodology used is a generalisation of Bravyi and Haah's method of triorthogonal matrices [Phys. Rev. A 86 052329 (2012)], which may be of independent interest. For completeness, we show explicitly that the qudit color codes generalize to gauge color codes, and share the many of the favorable properties of their qubit counterparts.

quant-ph↗

arXiv2015

Decoherence in open Majorana systems

Coupling to a thermal bath leads to decoherence of stored quantum information. For a system of Gaussian fermions, the fermionic analog of linear or Gaussian optics, these dynamics can be elegantly and efficiently described by evolution of the system's covariance matrix. Taking both system and bath to be Gaussian fermionic, we observe that decoherence occurs at a rate that is independent of the bath temperature. Furthermore, we also consider a weak coupling regime where the dynamics are Markovian. We present a microscopic derivation of Markovian master equations entirely in the language of covariance matrices, where temperature independence remains manifest. This is radically different from behaviour seen in other scenarios, such as when fermions interact with a bosonic bath. Our analysis applies to many Majorana fermion systems that have been heralded as very robust, topologically protected, qubits. In these systems, it has been claimed that thermal decoherence can be exponentially suppressed by reducing temperature, but we find Gaussian decoherence cannot be cooled away.

quant-ph↗

arXiv2015

Renormalising entanglement distillation

Entanglement distillation refers to the task of transforming a collection of weakly entangled pairs into fewer highly entangled ones. It is a core ingredient in quantum repeater protocols, needed to transmit entanglement over arbitrary distances in order to realise quantum key distribution schemes. Usually, it is assumed that the initial entangled pairs are i.i.d. distributed and uncorrelated with each other, an assumption that might not be reasonable at all in any entanglement generation process involving memory channels. Here, we introduce a framework that captures entanglement distillation in the presence of natural correlations arising from memory channels. Conceptually, we bring together ideas from condensed-matter physics - that of renormalisation and of matrix-product states and operators - with those of local entanglement manipulation, Markov chain mixing, and quantum error correction. We identify meaningful parameter regions for which we prove convergence to maximally entangled states, arising as the fixed points of a matrix-product operator renormalisation flow.

quant-ph↗

arXiv2014

Majorana fermions and non-locality

Localized Majorana fermions emerge in many topologically ordered systems and exhibit exchange statistics of Ising anyons. This enables noise-resistant implementation of a limited set of operations by braiding and fusing Majorana fermions. Unfortunately, these operations are incapable of implementing universal quantum computation. We show that, regardless of these limitations, Majorana fermions could be used to demonstrate non-locality (correlations incompatible with a local hidden variable theory) in experiments using only topologically protected operations. We also demonstrate that our proposal is optimal in terms of resources, with 10 Majorana fermions shown to be both necessary and sufficient for demonstrating bipartite non-locality. Furthermore, we identify severe restrictions on the possibility of tripartite non-locality. We comment on the potential of such entangled systems to be used in quantum information protocols.

quant-ph↗

arXiv2013

Efficient Decoders for Qudit Topological Codes

Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyze their error correction thresholds and efficiency. The first decoder is a generalization of a "hard-decisions" decoder due to Bravyi and Haah [arXiv:1112.3252]. We modify this decoder to overcome a percolation effect which limits its threshold performance for high dimensions. The second decoder is a generalization of a "soft-decisions" decoder due to Poulin and Duclos-Cianci [Phys. Rev. Lett. 104, 050504 (2010)], with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes.

quant-ph↗

arXiv2013

Continuous-variable entanglement distillation and non-commutative central limit theorems

Entanglement distillation transforms weakly entangled noisy states into highly entangled states, a primitive to be used in quantum repeater schemes and other protocols designed for quantum communication and key distribution. In this work, we present a comprehensive framework for continuous-variable entanglement distillation schemes that convert noisy non-Gaussian states into Gaussian ones in many iterations of the protocol. Instances of these protocols include (a) the recursive-Gaussifier protocol, (b) the temporally-reordered recursive-Gaussifier protocol, and (c) the pumping-Gaussifier protocol. The flexibility of these protocols give rise to several beneficial trade-offs related to success probabilities or memory requirements, which that can be adjusted to reflect experimental demands. Despite these protocols involving measurements, we relate the convergence in this protocols to new instances of non-commutative central limit theorems, in a formalism that we lay out in great detail. Implications of the findings for quantum repeater schemes are discussed.

quant-ph↗

arXiv2012

Magic state distillation in all prime dimensions using quantum Reed-Muller codes

We propose families of protocols for magic state distillation -- important components of fault tolerance schemes --- for systems of odd prime dimension. Our protocols utilize quantum Reed-Muller codes with transversal non-Clifford gates. We find that, in higher dimensions, small and effective codes can be used that have no direct analogue in qubit (two-dimensional) systems. We present several concrete protocols, including schemes for three-dimensional (qutrit) and five-dimensional (ququint) systems. The five-dimensional protocol is, by many measures, the best magic state distillation scheme yet discovered. It excels both in terms of error threshold with respect to depolarising noise (36.3%) and the efficiency measure know as "yield", where, for a large region of parameters, it outperforms its qubit counterpart by many orders of magnitude.

quant-ph↗

arXiv2012

Qutrit Magic State Distillation

Magic state distillation (MSD) is a purification protocol that plays a central role in fault tolerant quantum computation. Repeated iteration of the steps of a MSD protocol, generates pure single non-stabilizer states, or magic states, from multiple copies of a mixed resource state using stabilizer operations only. Thus mixed resource states promote the stabilizer operations to full universality. Magic state distillation was introduced for qubit-based quantum computation, but little has been known concerning MSD in higher dimensional qudit-based computation. Here, we describe a general approach for studying MSD in higher dimensions. We use it to investigate the features of a qutrit MSD protocol based on the 5-qutrit stabilizer code. We show that this protocol distills non-stabilizer magic states, and identify two types of states, that are attractors of this iteration map. Finally, we show how these states may be converted, via stabilizer circuits alone, into a state suitable for state injected implementation of a non-Clifford phase gate, enabling non-Clifford unitary computation.

quant-ph↗

arXiv2012

Gaussification and entanglement distillation of continuous variable systems: a unifying picture

Distillation of entanglement using only Gaussian operations is an important primitive in quantum communication, quantum repeater architectures, and distributed quantum computing. Existing distillation protocols for continuous degrees of freedom are only known to converge to a Gaussian state when measurements yield precisely the vacuum outcome. In sharp contrast, non-Gaussian states can be deterministically converted into Gaussian states while preserving their second moments, albeit by usually reducing their degree of entanglement. In this work - based on a novel instance of a non-commutative central limit theorem - we introduce a picture general enough to encompass the known protocols leading to Gaussian states, and new classes of protocols including multipartite distillation. This gives the experimental option of balancing the merits of success probability against entanglement produced.

quant-ph↗