Surprises in fault tolerance and cluster dynamics for quantum computing

2012 ◽  
Author(s):  
G. Gilbert ◽  
Y. S. Weinstein
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance

Quantum Algorithms

2021 ◽  
pp. 82-101
Author(s):  
Renata Wong ◽  
Amandeep Singh Bhatia
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Computer Hardware ◽  
Quantum Mechanical ◽  
Computational Power ◽  
Quantum Devices ◽  
The Core

In the last two decades, the interest in quantum computation has increased significantly among research communities. Quantum computing is the field that investigates the computational power and other properties of computers on the basis of the underlying quantum-mechanical principles. The main purpose is to find quantum algorithms that are significantly faster than any existing classical algorithms solving the same problem. While the quantum computers currently freely available to wider public count no more than two dozens of qubits, and most recently developed quantum devices offer some 50-60 qubits, quantum computer hardware is expected to grow in terms of qubit counts, fault tolerance, and resistance to decoherence. The main objective of this chapter is to present an introduction to the core quantum computing algorithms developed thus far for the field of cryptography.

scholarly journals A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing

2006 ◽  
Vol 6 (3) ◽  
pp. 193-212 ◽  
Author(s):  
K.M. Svore ◽  
A.W. Cross ◽  
I.L. Chuang ◽  
A.V. Aho
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Upper Bounds ◽  
Component Failure ◽  
Simulation Procedure ◽  
Component Failure Rates ◽  
Flow Map ◽  
Noise Models

An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent estimates of the threshold are near some experimentally achieved gate fidelities. However, the landscape of threshold estimates includes pseudothresholds, threshold estimates based on a subset of components and a low level of the recursion. In this paper, we observe that pseudothresholds are a generic phenomenon in fault-tolerant computation. We define pseudothresholds and present classical and quantum fault-tolerant circuits exhibiting pseudothresholds that differ by a factor of $4$ from fault-tolerance thresholds for typical relationships between component failure rates. We develop tools for visualizing how reliability is influenced by recursive simulation in order to determine the asymptotic threshold. Finally, we conjecture that refinements of these methods may establish upper bounds on the fault-tolerance threshold for particular codes and noise models.

scholarly journals Fault tolerance in parity-state linear optical quantum computing

2010 ◽  
Vol 82 (2) ◽  
Author(s):  
A. J. F. Hayes ◽  
H. L. Haselgrove ◽  
Alexei Gilchrist ◽  
T. C. Ralph
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance ◽  
Parity State ◽  
Linear Optical

scholarly journals Measurement-free preparation of grid states

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Jacob Hastrup ◽  
Kimin Park ◽  
Jonatan Bohr Brask ◽  
Radim Filip ◽  
Ulrik Lund Andersen
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance ◽  
Fault Tolerant ◽  
Hexagonal Lattice ◽  
Harmonic Oscillators ◽  
Noise Levels ◽  
Logical Qubits ◽  
Classical Computing ◽  
Current Systems

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.

scholarly journals Generating Fault-Tolerant Cluster States from Crystal Structures

Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 295 ◽  
Author(s):  
Michael Newman ◽  
Leonardo Andreta de Castro ◽  
Kenneth R. Brown
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance ◽  
Crystal Structures ◽  
Fault Tolerant ◽  
Cluster State ◽  
Error Correcting Codes ◽  
Noise Model ◽  
Cluster States ◽  
Promising Alternative ◽  
Quantum Error

Measurement-based quantum computing (MBQC) is a promising alternative to traditional circuit-based quantum computing predicated on the construction and measurement of cluster states. Recent work has demonstrated that MBQC provides a more general framework for fault-tolerance that extends beyond foliated quantum error-correcting codes. We systematically expand on that paradigm, and use combinatorial tiling theory to study and construct new examples of fault-tolerant cluster states derived from crystal structures. Included among these is a robust self-dual cluster state requiring only degree-3 connectivity. We benchmark several of these cluster states in the presence of circuit-level noise, and find a variety of promising candidates whose performance depends on the specifics of the noise model. By eschewing the distinction between data and ancilla, this malleable framework lays a foundation for the development of creative and competitive fault-tolerance schemes beyond conventional error-correcting codes.

Discrete variable gate-model quantum computing

2019 ◽  
Author(s):  
Mark Fingerhuth ◽  
Tomáš Babej ◽  
Peter Wittek
Keyword(s):  
Quantum Computing ◽  
Discrete Variable

A Review on Load Balancing Model Using Best Partition Technique

2017 ◽  
Vol 7 (8) ◽  
pp. 284
Author(s):  
M. Chaitanya ◽  
K. Durga Charan
Keyword(s):  
Cloud Computing ◽  
Fault Tolerance ◽  
Load Balancing ◽  
Load Balance ◽  
Large Impact ◽  
Cloud Environment ◽  
Public Cloud ◽  
The Public ◽  
Partition Technique ◽  
Textual Content

Load balancing makes cloud computing greater knowledgeable and could increase client pleasure. At reward cloud computing is among the all most systems which offer garage of expertise in very lowers charge and available all the time over the net. However, it has extra vital hassle like security, load administration and fault tolerance. Load balancing inside the cloud computing surroundings has a large impact at the presentation. The set of regulations relates the sport idea to the load balancing manner to amplify the abilties in the public cloud environment. This textual content pronounces an extended load balance mannequin for the majority cloud concentrated on the cloud segregating proposal with a swap mechanism to select specific strategies for great occasions.

Sign in / Sign up

Export Citation Format

Share Document