DOCSLIB.ORG

Learning Quantum Circuits of Some T Gates Ching-Yi Lai and Hao-Chung Cheng

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Learning Quantum Circuits of Some T Gates Ching-Yi Lai and Hao-Chung Cheng 1 Learning quantum circuits of some T gates Ching-Yi Lai and Hao-Chung Cheng Abstract In this paper, we study the problem of learning quantum circuits of a certain structure. If the unknown target is an n-qubit Clifford circuit, we devise an algorithm to reconstruct its circuit representation by using O(n2) queries to it. It is unknown for decades how to handle circuits beyond the Clifford group for which the stabilizer formalism cannot be applied. Herein, we study quantum circuits of T -depth one given the all-zero state as an input. We show that their output states can be represented by some stabilizer pseudomixtures. By analyzing the algebraic structure of the stabilizer pseudomixture, we can reconstruct the output state of an unknown T -depth one quantum circuit on input j0ni from the outcomes of Pauli measurements and Bell measurements. If the number of T gates is of the order O(log n), our algorithm requires O(n2) queries. Our results greatly extend the previous known facts that stabilizer states can be efficiently identified based on the stabilizer formalism. Hence, the proposed expanded stabilizer formalism and our analysis might pave the way towards learning quantum circuits beyond the Clifford structure. I. INTRODUCTION Consider a quantum circuit U that is accessible to us but its inner working or the mathematical description are unknown. Then, given a quantum state j i as an input, what do we know about the circuit output? The goal of this paper is to find a circuit representation that resembles the functioning of U so that we are able to predict the output Uj i given an arbitrary input j i. Moreover, we would like to use as few queries to U as possible. We term such a problem learning an unknown quantum circuit. If we focus on only the output state Uj i for a particular input state j i, the problem boils down to determining the state Uj i. This is also called quantum state tomography, known as one of the most crucial tasks in quantum information sciences [1], [2], [3], [4]. Its goal is to infer an unknown quantum state (assuming several copies of it are available) through a sequence of quantum measurements in a way so that a proposed candidate state performs well in future predictions. However, this is a non-trivial task. In order to identify an unknown n-qubit quantum state, one would require exponentially many copies (in the number n) of the state during the tomography process to determine a full description of the state. This makes the task of tomography intractable in practice. To mitigate such difficulties, at least two possible approaches were proposed as follows. Firstly, instead of fully characterizing the mathematical description of the unknown state, one might come up with a state that is Probably Approximately Correct (PAC) [5] when only a particular set of measurements is of interest in future predictions. In this case, Aaronson formulated the state tomography as a learning problem, and proved that only O(n) copies of the state are sufficient to obtain a good hypothesis state [6] (see also [7], [8], [9], [10], [11] for the related works). Secondly, one can focus on restricted states with a certain specific structure. For example, stabilizer states are a class of states that play an substantial role in quantum error-correcting codes and other computational tasks [12]. Aaronson and Gottesman provided a procedure to identify an unknown n-qubit stabilizer state with only O(n) copies of it if collective measurements are possible [13]. Later, Montanaro proposed an efficient algorithm via Bell sampling that consumes O(n) copies of the state and runs in time of order O(n3) [14]. Rocchetto cast the problem into the PAC learning model, and showed that stabiliser states are efficiently PAC learnable in the sense that the running time is polynomial in n [15]. (Note that the O(n) number of copies is optimal by Holevo’s theorem [16].) If now one aims to infer an unknown quantum evolution with certain known input states, this is called quantum process tomography. Once we completely know the underlying evolution, we can determine the final states for arbitrary initial states. This is the target problem we want to study in this paper. Nevertheless, this problem is much more challenging than quantum 3n arXiv:2106.12524v1 [quant-ph] 23 Jun 2021 state tomography. The amount of resources needed for identifying an arbitrary n-qubit quantum circuit is 4 , which is also practically formidable [17], [18], [19], [20]. When considering a restricted class of Clifford circuits Cn [21], Low showed that an n-qubit Clifford circuit Cn is determined (up to a global phase) given 2n + 1 queries to Cn and 2n queries to its conjugate y 2 Cn in time O(n ) [22]. Moreover, a converse result showed that at least n queries is required for such the task [22]. However, no concrete algorithms for reconstructing the circuit representation of the target Cn are provided and one is not capable of predicting the output state of Cn when sending an arbitrary state as input. The first main contribution of this paper is to fulfill this gap. Specifically, we propose a constructive algorithm to efficiently produce the circuit representation of the target circuit 2 Cn by using O(n ) queries to it. (See Theorem 9 and Algorithm 1 in Section III.) Theorem 1. [Learning unknown Clifford circuits] Given access to an unknown Clifford circuit Cn, one can learn a circuit 2 3 description using 2n + 10n + 4 queries to it in time O(n ), so that the produced hypothesis circuit is equivalent to Cn with probability at least 1 − 2−n+1. CYL is with the Institute of Communications Engineering, National Yang Ming Chiao Tung University, Hsinchu 30010, Taiwan. email:[email protected] HCC is with the Department of Electrical Engineering, Graduate Institute of Communication Engineering, National Taiwan University (NTU), Taipei 10617, Taiwan, and with the Department of Mathematics, Institute of Applied Mathematical Sciences, NTU, Taipei 10617, Taiwan, and also with Hon Hai (Foxconn) Quantum Computing Centre, New Taipei City 236, Taiwan. 2 y Let us emphasize that our approach does not rely on accessing the conjugate circuit Cn (as it was required in [22]) since implementing such the conjugate circuit might incur exponential overhead [23], hence compromising the efficiency of the learning process. The problem of learning an unknown Clifford circuit is closely related to that of learning stabilizer states since the output of a Clifford on input j0ni is a stabilizer state. In the proposed Algorithm 1, we adopt Montanaro’s Bell sampling algorithm for learning stabilizer states [14] as a subroutine. Moreover, we employ the stabilizer formalism [12], [24], exploiting the desirable structure of the Pauli group to learn the output stabilizers states. Lastly, by showing that a set of evolved Pauli basis can be identified by changing the input basis state appropriately, we determine the circuit representation of the unknown Clifford circuit Cn via a circuit synthesis procedure. In the aforementioned task, we heavily rely on the stabilizer formalism. However, it is unknown for a long time whether one can efficiently identify a quantum state that is produced from a quantum device beyond the class of Clifford circuits. In this work, we aim to provide an algorithm to identify the unknown quantum state output produced from a quantum circuit consisting of Clifford gates and a non-Clifford gate T = j0ih0j+eiπ=4j1ih1j. This Clifford+T gate set is universal for quantum computation and receives great attention in fault-tolerant quantum computation [25], [26], compiling quantum circuits [27], [28], [29], and quantum circuit simulations [30], [31]. Namely, an arbitrary quantum circuit can be approximately decomposed as a sequence of Clifford stages and T stages, alternatively. Here, a Clifford stage is simply a Clifford circuit. In a T stage, either a T gate or the identity is applied to each qubit1. The number of T stages in a circuit is called the T -depth of the circuit. A slightly related work is that the quantum circuits in the Clifford hierarchy can be distinguished by some POVM measurements [22, Theorem 8]. However, no exact construction of the POVMs is given, other than the first level of Clifford hierarchy, namely the Pauli group, which can be identified using the idea of superdense coding [32]. We note that quantum circuits of T -depth one have been studied in [33]. Our second main contribution is as follows. Suppose that U is an unknown n-qubit T -depth one quantum circuit with O(log n) T gates. We show that it requires at most O(n2) queries to efficiently learn the output of U on input j0ni. Theorem 2. [Learning unknown T -depth one output states] Given access to an unknown T -depth one quantum circuit U, one can learn a circuit description using O(3kn) queries to the unknown circuit U with time complexity O(n3 + 3kn), where k ≤ n is the number of T gates, so that the produced hypothesis circuit U^ is equivalent to U with probability at least 1 − 3e−n when the input states are restricted to the computational basis. The explicit procedure is provided in Algorithm 2 of Section V. The reason why learning quantum circuits U of some T gates is a much more technical-demanding problem is elaborated in the following. Since the T gate dose not belong to the Clifford group, Pauli operators are not preserved by the evolution of the quantum circuit U, and hence the stabilizer formalism or the Gottesman–Kitaev theorem [24] does not work for circuits with T gates.
Load more

Recommended publications
  • Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
    Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes Daniel Litinski and Felix von Oppen Dahlem Center for Complex Quantum Systems and Fachbereich Physik, Freie Universit¨at Berlin, Arnimallee 14, 14195 Berlin, Germany We present a planar surface-code-based bilizers requires more potentially faulty controlled-not scheme for fault-tolerant quantum computation (CNOT) gates. which eliminates the time overhead of single- The main drawback of surface codes in comparison qubit Clifford gates, and implements long-range to color codes is the absence of transversal single-qubit multi-target CNOT gates with a time overhead Clifford gates, i.e., the gates that are products of the that scales only logarithmically with the control- Hadamard gate H and the phase gate S. While the target separation. This is done by replacing transversal Clifford gates of color codes provide them hardware operations for single-qubit Clifford with fast logical H and S gates, defect-based propos- gates with a classical tracking protocol. Inter- als for surface codes [14] implement the H gate via a qubit communication is added via a modified multi-step measurement protocol, and the S gate via a lattice surgery protocol that employs twist de- distilled ancilla qubit. In order to lower the overhead fects of the surface code. The long-range multi- of single-qubit Clifford gates, surface code qubits can target CNOT gates facilitate magic state distil- be encoded using twist defects [15], which are essen- lation, which renders our scheme fault-tolerant tially Majoranas that can be braided via code defor- and universal. mation [16].
    [Show full text]
  • Arxiv:2003.09412V2 [Quant-Ph] 7 Jul 2021 Hadamard-Free Circuits Expose the Structure of the Clifford Group
    Hadamard-free circuits expose the structure of the Clifford group Sergey Bravyi and Dmitri Maslov IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, USA July 8, 2021 Abstract The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely written in the canonical form F1HSF2, where H is a layer of Hadamard gates, S is a permutation of qubits, and Fi are parameterized Hadamard-free circuits chosen from suitable subgroups of the Clifford group. Our canonical form provides a one-to-one correspondence between Clifford operators and layered quantum circuits. We report a polynomial-time algorithm for computing the canonical form. We employ this canonical form to generate a random uniformly distributed n-qubit Clifford operator in runtime O(n2). The number of random bits consumed by the algorithm matches the information-theoretic lower bound. A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group. The variants of the canonical form, one with a short Hadamard- free part and one allowing a circuit depth 9n implementation of arbitrary Clifford unitaries in the Linear Nearest Neighbor architecture are also discussed. Finally, we study computational quantum advantage where a classical reversible linear circuit can be implemented more efficiently using Clifford gates, and show an explicit example where such an advantage takes place. 1 Introduction Clifford circuits can be defined as quantum computations by the circuits with Phase (p), Hadamard (h), and cnot gates, applied to a computational basis state, such as |00...0i.
    [Show full text]
  • Quantum Topological Error Correction Codes Are Capable of Improving the Performance of Clifford Gates
    1 Quantum Topological Error Correction Codes Are Capable of Improving the Performance of Clifford Gates Daryus Chandra, Zunaira Babar, Hung Viet Nguyen, Dimitrios Alanis, Panagiotis Botsinis, Soon Xin Ng, and Lajos Hanzo Abstract—The employment of quantum error correction codes under certain conditions we can transform various classes of (QECCs) within quantum computers potentially offers a reli- powerful classical error correction codes into their quantum ability improvement for both quantum computation and com- counterparts, such as Quantum Turbo Codes (QTCs) [8], [9], munications tasks. However, incorporating quantum gates for performing error correction potentially introduces more sources Quantum Low-Density Parity-Check (QLDPC) codes [10], of quantum decoherence into the quantum computers. In this [11], and Quantum Polar Codes (QPCs) [12], [13]. However, scenario, the primary challenge is to find the sufficient condition several challenges remain, hindering the immediate employ- required by each of the quantum gates for beneficially employing ment of these powerful QSCs in quantum computers. Firstly, QECCs in order to yield reliability improvements given that the the reliability of the state-of-the-art quantum gates is still quantum gates utilized by the QECCs also introduce quantum decoherence. In this treatise, we approach this problem by significantly lower compared to classical gates. For exam- firstly presenting the general framework of protecting quantum ple, the reliability of a two-qubit quantum gate is between gates by the amalgamation of the transversal configuration of 90:00% 99:90% across various technology platforms, such quantum gates and quantum stabilizer codes (QSCs), which can as spin− electronics, photonics, superconducting, trapped-ion, be viewed as syndrome-based QECCs.
    [Show full text]
  • Universal Quantum Computation with Ideal Clifford Gates and Noisy Ancillas
    PHYSICAL REVIEW A 71, 022316 ͑2005͒ Universal quantum computation with ideal Clifford gates and noisy ancillas Sergey Bravyi* and Alexei Kitaev† Institute for Quantum Information, California Institute of Technology, Pasadena, 91125 California, USA ͑Received 6 May 2004; published 22 February 2005͒ We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state ͉0͘, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state ␳, which should be regarded as a parameter of the model. Our goal is to determine for which ␳ universal quantum computation ͑UQC͒ can be efficiently simu- lated. To answer this question, we construct purification protocols that consume several copies of ␳ and produce a single output qubit with higher polarization. The protocols allow one to increase the polarization only along certain “magic” directions. If the polarization of ␳ along a magic direction exceeds a threshold value ͑about 65%͒, the purification asymptotically yields a pure state, which we call a magic state. We show that the Clifford group operations combined with magic states preparation are sufficient for UQC. The connection of our results with the Gottesman-Knill theorem is discussed. DOI: 10.1103/PhysRevA.71.022316 PACS number͑s͒: 03.67.Lx, 03.67.Pp I. INTRODUCTION AND SUMMARY additional operations ͑e.g., measurements by Aharonov- Bohm interference ͓13͔ or some gates that are not related to The theory of fault-tolerant quantum computation defines topology at all͒. Of course, these nontopological operations an important number called the error threshold.
    [Show full text]
  • Randomized Benchmarking of Two-Qubit Gates
    Master's Thesis Randomized Benchmarking of Two-Qubit Gates Department of Physics Laboratory for Solid State Physics Quantum Device Lab August 28, 2015 Author: Samuel Haberthur¨ Supervisor: Yves Salathe´ Principal Investor: Prof. Dr. Andreas Wallraff Abstract On the way to high-fidelity quantum gates, accurate estimation of the gate errors is essential. Randomized benchmarking (RB) provides a tool to classify and characterize the errors of multi- qubit gates. Here we implement RB to investigate the fidelity of single-qubit and two-qubit gates in the Clifford group realized on a superconducting transmon qubit system. This thesis provides an overview of the current randomized benchmarking methods and gives detailed discussions of how to estimate the gate error. For single-qubit gates an average gate fidelity of 99:6(1) % was obtained. Furthermore, it shows how two-qubit gates are realized and how they can be calibrated to achieve high fidelities. Here, the focus lies on the controlled phase gate and iswap gate, which are both implemented using fast magnetic flux pulses. For the former, fidelities above 92 % were estimated. Also a decreasing of average gate fidelity over time was observed. Finally, a method for achieving scalable iSwap gates is proposed. Contents 1. Motivation 6 2. Superconducting Quantum Circuits8 2.1. Electromagnetic Oscillators..............................8 2.2. The Transmon Qubit.................................. 11 2.3. Circuit QED...................................... 13 2.4. Readout and Single Quantum Gates......................... 15 2.5. Coherence Time.................................... 17 2.6. Experimental Setup.................................. 18 3. Single-Qubit Randomized Benchmarking 21 3.1. Randomized Noise Estimation............................. 22 3.2. Pauli Method...................................... 23 3.3.
    [Show full text]
  • Arxiv:2006.01273V1 [Quant-Ph] 1 Jun 2020 Performance of the System According to Our Bench- 5.1 Full Stack Benchmarking
    Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack Daniel Mills∗ 1,2, Seyon Sivarajah2, Travis L. Scholten3, and Ross Duncan2,4 1University of Edinburgh, 10 Crichton Street, Edinburgh EH8 9AB, UK 2Cambridge Quantum Computing Ltd, 9a Bridge Street, Cambridge, CB2 1UB, UK 3IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, USA 4University of Strathclyde, 26 Richmond Street, Glasgow, G1 1XH, UK June 3, 2020 Abstract Contents Quantum computing systems need to be bench- 1 Introduction2 marked in terms of practical tasks they would be expected to do. Here, we propose 3 “application- 2 Circuit Classes4 motivated” circuit classes for benchmarking: deep 2.1 Shallow Circuits: IQP . .4 (relevant for state preparation in the variational 2.2 Square Circuits: Random Circuit quantum eigensolver algorithm), shallow (inspired Sampling . .5 by IQP-type circuits that might be useful for near- 2.3 Deep Circuits: Pauli Gadgets . .7 term quantum machine learning), and square (in- spired by the quantum volume benchmark). We 3 Figures of Merit7 quantify the performance of a quantum computing 3.1 Heavy Output Generation Bench- system in running circuits from these classes using marking . .8 several figures of merit, all of which require expo- 3.2 Cross-Entropy Difference . 10 nential classical computing resources and a polyno- 3.3 `1-Norm Distance . 11 mial number of classical samples (bitstrings) from 3.4 Metric Comparison . 12 the system. We study how performance varies with the compilation strategy used and the de- 4 Quantum Computing Stack 12 vice on which the circuit is run. Using systems 4.1 Software Development Kits .
    [Show full text]
  • Supercomputer Simulations of Transmon Quantum Computers Quantum Simulations of Transmon Supercomputer
    IAS Series IAS Supercomputer simulations of transmon quantum computers quantum simulations of transmon Supercomputer 45 Supercomputer simulations of transmon quantum computers Dennis Willsch IAS Series IAS Series Band / Volume 45 Band / Volume 45 ISBN 978-3-95806-505-5 ISBN 978-3-95806-505-5 Dennis Willsch Schriften des Forschungszentrums Jülich IAS Series Band / Volume 45 Forschungszentrum Jülich GmbH Institute for Advanced Simulation (IAS) Jülich Supercomputing Centre (JSC) Supercomputer simulations of transmon quantum computers Dennis Willsch Schriften des Forschungszentrums Jülich IAS Series Band / Volume 45 ISSN 1868-8489 ISBN 978-3-95806-505-5 Bibliografsche Information der Deutschen Nationalbibliothek. Die Deutsche Nationalbibliothek verzeichnet diese Publikation in der Deutschen Nationalbibliografe; detaillierte Bibliografsche Daten sind im Internet über http://dnb.d-nb.de abrufbar. Herausgeber Forschungszentrum Jülich GmbH und Vertrieb: Zentralbibliothek, Verlag 52425 Jülich Tel.: +49 2461 61-5368 Fax: +49 2461 61-6103 [email protected] www.fz-juelich.de/zb Umschlaggestaltung: Grafsche Medien, Forschungszentrum Jülich GmbH Titelbild: Quantum Flagship/H.Ritsch Druck: Grafsche Medien, Forschungszentrum Jülich GmbH Copyright: Forschungszentrum Jülich 2020 Schriften des Forschungszentrums Jülich IAS Series, Band / Volume 45 D 82 (Diss. RWTH Aachen University, 2020) ISSN 1868-8489 ISBN 978-3-95806-505-5 Vollständig frei verfügbar über das Publikationsportal des Forschungszentrums Jülich (JuSER) unter www.fz-juelich.de/zb/openaccess. This is an Open Access publication distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract We develop a simulator for quantum computers composed of superconducting transmon qubits.
    [Show full text]
  • Quantum Proofs Can Be Verified Using Only Single Qubit Measurements
    Quantum proofs can be verified using only single qubit measurements Tomoyuki Morimae,1, ∗ Daniel Nagaj,2, † and Norbert Schuch3 1ASRLD Unit, Gunma University, 1-5-1 Tenjin-cho Kiryu-shi Gunma-ken, 376-0052, Japan 2Institute of Physics, Slovak Academy of Sciences, D´ubravsk´acesta 9, 84511 Bratislava, Slovakia 3JARA Institute for Quantum Information, RWTH Aachen University, 52056 Aachen, Germany (Dated: October 9, 2018) QMA (Quantum Merlin Arthur) is the class of problems which, though potentially hard to solve, have a quantum solution which can be verified efficiently using a quantum computer. It thus forms a natural quantum version of the classical complexity class NP (and its probabilistic variant MA, Merlin-Arthur games), where the verifier has only classical computational resources. In this paper, we study what happens when we restrict the quantum resources of the verifier to the bare minimum: individual measurements on single qubits received as they come, one-by-one. We find that despite this grave restriction, it is still possible to soundly verify any problem in QMA for the verifier with the minimum quantum resources possible, without using any quantum memory or multiqubit operations. We provide two independent proofs of this fact, based on measurement based quantum computation and the local Hamiltonian problem, respectively. The former construction also applies to QMA1, i.e., QMA with one-sided error. PACS numbers: 03.67.-a, 03.67.Ac, 03.67.Lx I. INTRODUCTION ing a classical (NP, MA) or quantum (QMA) computer. Adding quantum mechanics opens new doors for Mer- lin to cheat, but on the other hand, performing a quan- One of the key questions in computational complexity tum computation as a verification procedure gives more is to determine the resources required to find a solution power to Arthur as well.
    [Show full text]
  • Arxiv:2007.08532V2 [Quant-Ph]
    Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate Shelly Garion,1, ∗ Naoki Kanazawa,2, † Haggai Landa,1 David C. McKay,3 Sarah Sheldon,4 Andrew W. Cross,3 and Christopher J. Wood3 1IBM Quantum, IBM Research Haifa, Haifa University Campus, Mount Carmel, Haifa 31905, Israel 2IBM Quantum, IBM Research Tokyo, 19-21 Nihonbashi Hakozaki-cho, Chuo-ku, Tokyo, 103-8510, Japan 3IBM Quantum, T.J. Watson Research Center, Yorktown Heights, NY 10598, USA 4IBM Quantum, Almaden Research Center, San Jose, CA 9512, USA Hardware efficient transpilation of quantum circuits to a quantum devices native gateset is es- sential for the execution of quantum algorithms on noisy quantum computers. Typical quantum devices utilize a gateset with a single two-qubit Clifford entangling gate per pair of coupled qubits, however, in some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions and also allows more flexibility in optimizing over noise. We demonstrate π calibration of a low error non-Clifford Controlled- 2 phase (CS) gate on a cloud based IBM Quantum computing using the Qiskit Pulse framework. To measure the gate error of the calibrated CS gate we perform non-Clifford CNOT-Dihedral interleaved randomized benchmarking. We are able to obtain a gate error of 5.9(7) × 10−3 at a gate length 263 ns, which is close to the coherence limit of the associated qubits, and lower error than the backends standard calibrated CNOT gate. I. INTRODUCTION sets with a Clifford two-qubit like CNOT are appealing as a variety of averaged errors in a Clifford gateset can Quantum computation holds great promise for speed- be can be robustly measured using various randomized ing up certain classes of problems, however near-term benchmarking (RB) protocols [4, 12–16].
    [Show full text]
  • A Study of the Robustness of Magic State Distillation Against Clifford Gate Faults
    A study of the robustness of magic state distillation against Clifford gate faults by Tomas Jochym-O'Connor A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Science in Physics - Quantum Information Waterloo, Ontario, Canada, 2012 c Tomas Jochym-O'Connor 2012 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract Quantum error correction and fault-tolerance are at the heart of any scalable quantum computation architecture. Developing a set of tools that satisfy the requirements of fault- tolerant schemes is thus of prime importance for future quantum information processing implementations. The Clifford gate set has the desired fault-tolerant properties, preventing bad propagation of errors within encoded qubits, for many quantum error correcting codes, yet does not provide full universal quantum computation. Preparation of magic states can enable universal quantum computation in conjunction with Clifford operations, however preparing magic states experimentally will be imperfect due to implementation errors. Thankfully, there exists a scheme to distill pure magic states from prepared noisy magic states using only operations from the Clifford group and measurement in the Z-basis, such a scheme is called magic state distillation [1]. This work investigates the robustness of magic state distillation to faults in state preparation and the application of the Clifford gates in the protocol. We establish that the distillation scheme is robust to perturbations in the initial state preparation and characterize the set of states in the Bloch sphere that converge to the T -type magic state in different fidelity regimes.
    [Show full text]
  • Superconducting Qubits: Current State of Play Arxiv:1905.13641V3
    Superconducting Qubits: Current State of Play Morten Kjaergaard,1 Mollie E. Schwartz,2 Jochen Braum¨uller,1 Philip Krantz,3 Joel I-J Wang,1, Simon Gustavsson,1 and William D. Oliver,1;2;4 1Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, USA, MA 02139. MK email: [email protected] 2MIT Lincoln Laboratory, 244 Wood Street, Lexington, USA, MA 02421 3Microtechnology and Nanoscience, Chalmers University of Technology, G¨oteborg, Sweden, SE-412 96 4Department of Physics, Massachusetts Institute of Technology, Cambridge, USA, MA 02139. WDO email: [email protected] Keywords superconducting qubits, superconducting circuits, quantum algorithms, quantum simulation, quantum error correction, NISQ era Abstract Superconducting qubits are leading candidates in the race to build a quantum computer capable of realizing computations beyond the reach of modern supercomputers. The superconducting qubit modality has been used to demonstrate prototype algorithms in the `noisy intermedi- ate scale quantum' (NISQ) technology era, in which non-error-corrected qubits are used to implement quantum simulations and quantum al- gorithms. With the recent demonstrations of multiple high fidelity two-qubit gates as well as operations on logical qubits in extensible superconducting qubit systems, this modality also holds promise for the longer-term goal of building larger-scale error-corrected quantum computers. In this brief review, we discuss several of the recent ex- perimental advances in qubit hardware, gate implementations, readout capabilities, early NISQ algorithm implementations, and quantum er- ror correction using superconducting qubits. While continued work on many aspects of this technology is certainly necessary, the pace of both conceptual and technical progress in the last years has been impres- arXiv:1905.13641v3 [quant-ph] 21 Apr 2020 sive, and here we hope to convey the excitement stemming from this progress.
    [Show full text]
  • Logical Clifford Synthesis for Stabilizer Codes
    IEEE Transactions on Quantum Software uantumEngineering Received March 24, 2020; revised July 29, 2020; accepted August 31, 2020; date of publication September 11, 2020; date of current version October 5, 2020. Digital Object Identifier 10.1109/TQE.2020.3023419 Logical Clifford Synthesis for Stabilizer Codes NARAYANAN RENGASWAMY1 (Student Member, IEEE), ROBERT CALDERBANK1 (Fellow, IEEE), SWANAND KADHE2 (Member, IEEE), AND HENRY D. PFISTER1 (Senior Member, IEEE) 1 Department of Electrical and Computer Engineering, Duke University, Durham, NC 27708 USA 2 Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720 USA Corresponding author: Narayanan Rengaswamy (e-mail: [email protected]). Part of this work was presented at the 2018 IEEE International Symposium on Information Theory [1]. This work was supported by the National Science Foundation under Grants 1718494, 1908730, and 1910571. ABSTRACT Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators to be translated into physical operators acting on physical quantum states. In this article, we propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the desired physical Clifford operator in CN×N as a 2m × 2m binary symplectic matrix, where N = 2m. We prove two theorems that use symplectic transvections to effciently enumerate all binary symplectic matrices that satisfy a system of linear equations. As a corollary, we prove that for an [[m, k]]stabilizer code every logical Clifford operator has 2r(r+1)/2 symplectic solutions, where r = m − k, up to stabilizer degeneracy.
    [Show full text]