Fault Tolerant Authenticated Quantum Dialogue Based on Logical Qubits and Controlled-Not Operations

2018 ◽  
Vol 58 (2) ◽  
pp. 531-542 ◽  
Author(s):  
Yan-Feng Lang
2020 ◽  
Vol 29 (1) ◽  
pp. 010304 ◽  
Author(s):  
Li-Wei Chang ◽  
Yu-Qing Zhang ◽  
Xiao-Xiong Tian ◽  
Yu-Hua Qian ◽  
Shi-Hui Zheng

2015 ◽  
Vol 15 (11&12) ◽  
pp. 962-986
Author(s):  
Matthew B. Hastings ◽  
A. Geller

We propose two distinct methods of improving quantum computing protocols based on surface codes. First, we analyze the use of dislocations instead of holes to produce logical qubits, potentially reducing spacetime volume required. Dislocations\cite{dis2,dis} induce defects which, in many respects, behave like Majorana quasi-particles. We construct circuits to implement these codes and present fault-tolerant measurement methods for these and other defects which may reduce spatial overhead. One advantage of these codes is that Hadamard gates take exactly $0$ time to implement. We numerically study the performance of these codes using a minimum weight and a greedy decoder using finite-size scaling. Second, we consider state injection of arbitrary ancillas to produce arbitrary rotations. This avoids the logarithmic (in precision) overhead in online cost required if $T$ gates are used to synthesize arbitrary rotations. While this has been considered before\cite{ancilla}, we consider also the parallel performance of this protocol. Arbitrary ancilla injection leads to a probabilistic protocol in which there is a constant chance of success on each round; we use an amortized analysis to show that even in a parallel setting this leads to only a constant factor slowdown as opposed to the logarithmic slowdown that might be expected naively.


2019 ◽  
Vol 73 (3) ◽  
Author(s):  
Ming-Hui Zhang ◽  
Zheng-Wen Cao ◽  
Jin-Ye Peng ◽  
Geng Chai

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Jacob Hastrup ◽  
Kimin Park ◽  
Jonatan Bohr Brask ◽  
Radim Filip ◽  
Ulrik Lund Andersen

AbstractQuantum computing potentially offers exponential speed-ups over classical computing for certain tasks. A central, outstanding challenge to making quantum computing practical is to achieve fault tolerance, meaning that computations of any length or size can be realized in the presence of noise. The Gottesman-Kitaev-Preskill code is a promising approach toward fault-tolerant quantum computing, encoding logical qubits into grid states of harmonic oscillators. However, for the code to be fault tolerant, the quality of the grid states has to be extremely high. Approximate grid states have recently been realized experimentally, but their quality is still insufficient for fault tolerance. Current implementable protocols for generating grid states rely on measurements of ancillary qubits combined with either postselection or feed forward. Implementing such measurements take up significant time during which the states decohere, thus limiting their quality. Here, we propose a measurement-free preparation protocol, which deterministically prepares arbitrary logical grid states with a rectangular or hexagonal lattice. The protocol can be readily implemented in trapped-ion or superconducting-circuit platforms to generate high-quality grid states using only a few interactions, even with the noise levels found in current systems.


2014 ◽  
Vol 14 (15&16) ◽  
pp. 1339-1371
Author(s):  
Daniel Gottesman

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol.


IEEE Micro ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jonathan M. Baker ◽  
Casey Duckering ◽  
David Schuster ◽  
Fred Chong

Sign in / Sign up

Export Citation Format

Share Document