scholarly journals The robustness of magic state distillation against errors in Clifford gates

2013 ◽  
Vol 13 (5&6) ◽  
pp. 361-378
Author(s):  
Tomas Jochym-O'Connor ◽  
Yafei Yu ◽  
Bassam Helou ◽  
Raymond Laflamme

Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state~\cite{Bravyi}. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations in the Bloch sphere due to noise. Additionally, we consider a depolarizing noise model on the quantum gates in the decoding section of the distillation protocol and demonstrate its effect on the convergence rate and threshold value. Finally, we establish that faulty magic state distillation is more efficient than fault-tolerance-assisted magic state distillation at low error rates due to the large overhead in the number of quantum gates and qubits required in a fault-tolerance architecture. The ability to perform magic state distillation with noisy gates leads us to conclude that this could be a realistic scheme for future small-scale quantum computing devices as fault-tolerance need only be used in the final steps of the protocol.

2010 ◽  
Vol 10 (9&10) ◽  
pp. 780-802
Author(s):  
David S. Wang ◽  
Austin G. Fowler ◽  
Charles D. Hill ◽  
Lloyd C.L. Hollenberg

Recent work on fault-tolerant quantum computation making use of topological error correction shows great potential, with the 2d surface code possessing a threshold error rate approaching 1\%. However, the 2d surface code requires the use of a complex state distillation procedure to achieve universal quantum computation. The color code of is a related scheme partially solving the problem, providing a means to perform all Clifford group gates transversally. We review the color code and its error correcting methodology, discussing one approximate technique based on graph matching. We derive an analytic lower bound to the threshold error rate of 6.25\% under error-free syndrome extraction, while numerical simulations indicate it may be as high as 13.3\%. Inclusion of faulty syndrome extraction circuits drops the threshold to approximately 0.10 \pm 0.01\%.


2003 ◽  
Vol 01 (01) ◽  
pp. 1-23 ◽  
Author(s):  
VLATKO VEDRAL

In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also introduce a number of examples that will help the reader understand the basic issues involved. In the second part we show how to perform a universal quantum computation using only geometric effects appearing in quantum phases. It is then finally discussed how this geometric way of performing quantum gates can lead to a stable, large scale, intrinsically fault-tolerant quantum computer.


2004 ◽  
Vol 4 (3) ◽  
pp. 165-173
Author(s):  
L.-M. Duan ◽  
B.B. Blinov ◽  
D.L. Moehring ◽  
C. Monroe

We propose a method for scaling trapped ions for large-scale quantum computation and communication based on a probabilistic ion-photon mapping. Deterministic quantum gates between remotely located trapped ions can be achieved through detection of spontaneously-emitted photons, accompanied by the local Coulomb interaction between neighboring ions. We discuss gate speeds and tolerance to experimental noise for different probabilistic entanglement schemes.


2005 ◽  
Vol 03 (04) ◽  
pp. 669-678 ◽  
Author(s):  
YONG ZHANG ◽  
LOUIS H. KAUFFMAN ◽  
MO-LIN GE

It is fundamental to view unitary braiding operators describing topological entanglements as universal quantum gates for quantum computation. This paper derives a unitary solution of the quantum Yang–Baxter equation via Yang–Baxterization and constructs the Hamiltonian responsible for the time-evolution of the unitary braiding operator.


2015 ◽  
Vol 93 (9) ◽  
pp. 941-946 ◽  
Author(s):  
Anne Broadbent

We give a protocol for the delegation of quantum computation on encrypted data. More specifically, we show that in a client–server scenario, where the client holds the encryption key for an encrypted quantum register held by the server, it is possible for the server to perform a universal set of quantum gates on the quantum data. All Clifford group gates are non-interactive, while the remaining non-Clifford group gate that we implement (the π/8 gate) requires the client to prepare and send a single random auxiliary qubit (chosen among four possibilities), and exchange classical communication. This construction improves on previous work, which requires either multiple auxiliary qubits or two-way quantum communication. Using a reduction to an entanglement-based protocol, we show privacy against any adversarial server according to a simulation-based security definition.


2001 ◽  
Vol 15 (02) ◽  
pp. 125-133 ◽  
Author(s):  
RADU IONICIOIU ◽  
GEHAN AMARATUNGA ◽  
FLORIN UDREA

We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial state, measurement of the final state and a universal set of quantum gates. An important advantage of this model is the fact that we do not need ultrafast optoelectronics for gate operations. We use cold programming (or pre-programming), i.e. the gates are set before launching the electrons; all programming can be done using static electric fields only.


Science ◽  
2019 ◽  
Vol 364 (6442) ◽  
pp. 753-756 ◽  
Author(s):  
Zhiguang Yan ◽  
Yu-Ran Zhang ◽  
Ming Gong ◽  
Yulin Wu ◽  
Yarui Zheng ◽  
...  

Quantum walks are the quantum analogs of classical random walks, which allow for the simulation of large-scale quantum many-body systems and the realization of universal quantum computation without time-dependent control. We experimentally demonstrate quantum walks of one and two strongly correlated microwave photons in a one-dimensional array of 12 superconducting qubits with short-range interactions. First, in one-photon quantum walks, we observed the propagation of the density and correlation of the quasiparticle excitation of the superconducting qubit and quantum entanglement between qubit pairs. Second, when implementing two-photon quantum walks by exciting two superconducting qubits, we observed the fermionization of strongly interacting photons from the measured time-dependent long-range anticorrelations, representing the antibunching of photons with attractive interactions. The demonstration of quantum walks on a quantum processor, using superconducting qubits as artificial atoms and tomographic readout, paves the way to quantum simulation of many-body phenomena and universal quantum computation.


Author(s):  
Sebastian Horvat ◽  
Xiaoqin Gao ◽  
Borivoje Dakic

Abstract A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computational model that consists of 2n target bits together with a set of classical gates controlled by log(2n + 1) ancillary qubits. We show that this model is equivalent to a quantum computer operating on n qubits. Furthermore, we show that even a primitive computer that is capable of implementing only SWAP gates, can be lifted to universal quantum computing, if aided with an appropriate quantum control of logarithmic size. Our results thus exemplify the information processing power brought forth by the quantum control system.


2020 ◽  
Author(s):  
Jonathan Foox ◽  
Scott W. Tighe ◽  
Charles M. Nicolet ◽  
Justin M. Zook ◽  
Marta Byrska-Bishop ◽  
...  

AbstractMassively parallel DNA sequencing is a critical tool for genomics research and clinical diagnostics. Here, we describe the Association of Biomolecular Resource Facilities (ABRF) Next-Generation Sequencing Phase II Study to measure quality and reproducibility of DNA sequencing. Replicates of human and bacterial reference DNA samples were generated across multiple sequencing platforms, including well-established technologies such as Illumina, ThermoFisher Ion Torrent, and Pacific Biosciences, as well as emerging technologies such as BGI, Genapsys, and Oxford Nanopore. A total of 202 datasets were generated to investigate the performance of a total of 16 sequencing platforms, including mappability of reads, coverage and error rates in difficult genomic regions, and detection of small-scale polymorphisms and large-scale structural variants. This study provides a comprehensive baseline resource for continual benchmarking as chemistries, methods, and platforms evolve for DNA sequencing.


Sign in / Sign up

Export Citation Format

Share Document