scholarly journals Building a large-scale quantum computer with continuous-variable optical technologies

Author(s):  
Kosuke Fukui ◽  
Shuntaro Takeda

Abstract Realizing a large-scale quantum computer requires hardware platforms that can simultaneously achieve universality, scalability, and fault tolerance. As a viable pathway to meeting these requirements, quantum computation based on continuous-variable optical systems has recently gained more attention due to its unique advantages and approaches. This review introduces several topics of recent experimental and theoretical progress in the optical continuous-variable quantum computation that we believe are promising. In particular, we focus on scaling-up technologies enabled by time multiplexing, bandwidth broadening, and integrated optics, as well as hardware-efficient and robust bosonic quantum error correction schemes.

2016 ◽  
Vol 14 (07) ◽  
pp. 1650040
Author(s):  
Toshiyuki Fujii ◽  
Shigemasa Matsuo ◽  
Noriyuki Hatakenaka

We propose a fluxon-controlled quantum computer incorporated with three-qubit quantum error correction using special gate operations, i.e. joint-phase and SWAP gate operations, inherent in capacitively coupled superconducting flux qubits. The proposed quantum computer acts exactly like a knitting machine at home.


Author(s):  
Dongsheng Wang ◽  
Yunjiang Wang ◽  
Ningping Cao ◽  
Bei Zeng ◽  
Raymond Lafflamme

Abstract In this work, we develop the theory of quasi-exact fault-tolerant quantum (QEQ) computation, which uses qubits encoded into quasi-exact quantum error-correction codes (``quasi codes''). By definition, a quasi code is a parametric approximate code that can become exact by tuning its parameters. The model of QEQ computation lies in between the two well-known ones: the usual noisy quantum computation without error correction and the usual fault-tolerant quantum computation, but closer to the later. Many notions of exact quantum codes need to be adjusted for the quasi setting. Here we develop quasi error-correction theory using quantum instrument, the notions of quasi universality, quasi code distances, and quasi thresholds, etc. We find a wide class of quasi codes which are called valence-bond-solid codes, and we use them as concrete examples to demonstrate QEQ computation.


Author(s):  
Valentin Kasper ◽  
Daniel González-Cuadra ◽  
Apoorva Hegde ◽  
Andy Xia ◽  
Alexandre Dauphin ◽  
...  

2017 ◽  
Vol 114 (29) ◽  
pp. 7555-7560 ◽  
Author(s):  
Markus Reiher ◽  
Nathan Wiebe ◽  
Krysta M. Svore ◽  
Dave Wecker ◽  
Matthias Troyer

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.


Author(s):  
Todd A. Brun

Quantum error correction is a set of methods to protect quantum information—that is, quantum states—from unwanted environmental interactions (decoherence) and other forms of noise. The information is stored in a quantum error-correcting code, which is a subspace in a larger Hilbert space. This code is designed so that the most common errors move the state into an error space orthogonal to the original code space while preserving the information in the state. It is possible to determine whether an error has occurred by a suitable measurement and to apply a unitary correction that returns the state to the code space without measuring (and hence disturbing) the protected state itself. In general, codewords of a quantum code are entangled states. No code that stores information can protect against all possible errors; instead, codes are designed to correct a specific error set, which should be chosen to match the most likely types of noise. An error set is represented by a set of operators that can multiply the codeword state. Most work on quantum error correction has focused on systems of quantum bits, or qubits, which are two-level quantum systems. These can be physically realized by the states of a spin-1/2 particle, the polarization of a single photon, two distinguished levels of a trapped atom or ion, the current states of a microscopic superconducting loop, or many other physical systems. The most widely used codes are the stabilizer codes, which are closely related to classical linear codes. The code space is the joint +1 eigenspace of a set of commuting Pauli operators on n qubits, called stabilizer generators; the error syndrome is determined by measuring these operators, which allows errors to be diagnosed and corrected. A stabilizer code is characterized by three parameters [[n,k,d]], where n is the number of physical qubits, k is the number of encoded logical qubits, and d is the minimum distance of the code (the smallest number of simultaneous qubit errors that can transform one valid codeword into another). Every useful code has n>k; this physical redundancy is necessary to detect and correct errors without disturbing the logical state. Quantum error correction is used to protect information in quantum communication (where quantum states pass through noisy channels) and quantum computation (where quantum states are transformed through a sequence of imperfect computational steps in the presence of environmental decoherence to solve a computational problem). In quantum computation, error correction is just one component of fault-tolerant design. Other approaches to error mitigation in quantum systems include decoherence-free subspaces, noiseless subsystems, and dynamical decoupling.


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.


2018 ◽  
Vol 18 (9&10) ◽  
pp. 743-778
Author(s):  
Muhammad Ahsan ◽  
Syed Abbas Zilqurnain Naqvi

We investigate the efficacy of topological quantum error-correction in correlated noise model which permits collective coupling of all the codeword qubits to the same non-Markovian environment. In this noise model, the probability distribution over set of phase-flipped qubits, decays sub-exponentially in the size of the set and carries non-trivial likelihood of the occurring large numbers of qubits errors. We find that in the presence of noise correlation, one cannot guarantee arbitrary high computational accuracy simply by incrementing the codeword size while retaining constant noise level per qubit operation. However, if instead, per-operation qubit error probability in an n-qubits long codeword is reduced O(\sqrt{n}) times below the accuracy threshold, arbitrarily accurate quantum computation becomes feasible with acceptable scaling of the codeword size. Our results suggest that progressively reducing noise level in qubits and gates is as important as continuously integrating more qubits to realize scalable and reliable quantum computer.


2015 ◽  
Vol 5 (1) ◽  
Author(s):  
Shuhong Hao ◽  
Xiaolong Su ◽  
Caixing Tian ◽  
Changde Xie ◽  
Kunchi Peng

Sign in / Sign up

Export Citation Format

Share Document