Continuous-variable quantum computing: scalable designs and fault tolerance

2021 ◽  
Author(s):  
Nicolas Menicucci
Keyword(s):  
Quantum Computing ◽  
Fault Tolerance ◽  
Continuous Variable

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 Client-friendly continuous-variable blind and verifiable quantum computing

2019 ◽  
Vol 100 (6) ◽  
Author(s):  
Nana Liu ◽  
Tommaso F. Demarie ◽  
Si-Hui Tan ◽  
Leandro Aolita ◽  
Joseph F. Fitzsimons
Keyword(s):  
Quantum Computing ◽  
Continuous Variable

scholarly journals Continuous-Variable Instantaneous Quantum Computing is Hard to Sample

2017 ◽  
Vol 118 (7) ◽  
Author(s):  
T. Douce ◽  
D. Markham ◽  
E. Kashefi ◽  
E. Diamanti ◽  
T. Coudreau ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Continuous Variable

scholarly journals Continuous variable gate-model quantum computing

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

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 Cluster States from Gaussian States: Essential Diagnostic Tools for Continuous-Variable One-Way Quantum Computing

PRX Quantum ◽  
2021 ◽  
Vol 2 (3) ◽  
Author(s):  
Carlos González-Arciniegas ◽  
Paulo Nussenzveig ◽  
Marcelo Martinelli ◽  
Olivier Pfister
Keyword(s):  
Quantum Computing ◽  
Continuous Variable ◽  
Diagnostic Tools ◽  
Cluster States ◽  
Gaussian States

scholarly journals Generation of time-domain-multiplexed two-dimensional cluster state

Science ◽  
2019 ◽  
Vol 366 (6463) ◽  
pp. 373-376 ◽  
Author(s):  
Warit Asavanant ◽  
Yu Shiozawa ◽  
Shota Yokoyama ◽  
Baramee Charoensombutamon ◽  
Hiroki Emura ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Large Scale ◽  
Cluster State ◽  
Continuous Variable ◽  
Error Correcting Codes ◽  
Square Lattice ◽  
Two Dimensional ◽  
Report Generation ◽  
Cluster States ◽  
Variable Cluster

Entanglement is the key resource for measurement-based quantum computing. It is stored in quantum states known as cluster states, which are prepared offline and enable quantum computing by means of purely local measurements. Universal quantum computing requires cluster states that are both large and possess (at least) a two-dimensional topology. Continuous-variable cluster states—based on bosonic modes rather than qubits—have previously been generated on a scale exceeding one million modes, but only in one dimension. Here, we report generation of a large-scale two-dimensional continuous-variable cluster state. Its structure consists of a 5- by 1240-site square lattice that was tailored to our highly scalable time-multiplexed experimental platform. It is compatible with Bosonic error-correcting codes that, with higher squeezing, enable fault-tolerant quantum computation.

Sign in / Sign up

Export Citation Format

Share Document