scholarly journals Sufficient condition on noise correlations for scalable quantum computing

2013 ◽  
Vol 13 (3&4) ◽  
pp. 181-194
Author(s):  
John Preskill
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Fault Tolerant ◽  
Spatial Separation ◽  
Sufficient Condition ◽  
Quantum Computations

I study the effectiveness of fault-tolerant quantum computation against correlated Hamiltonian noise, and derive a sufficient condition for scalability. Arbitrarily long quantum computations can be executed reliably provided that noise terms acting collectively on $k$ system qubits are sufficiently weak, and decay sufficiently rapidly with increasing $k$ and with increasing spatial separation of the qubits.

scholarly journals Improved Resource State for Verifiable Blind Quantum Computation

Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 996
Author(s):  
Qingshan Xu ◽  
Xiaoqing Tan ◽  
Rui Huang
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Fault Tolerant ◽  
Maximal Degree ◽  
Recent Advances ◽  
Quantum Computations ◽  
Blind Quantum Computation ◽  
Computation Graph ◽  
Resource State

Recent advances in theoretical and experimental quantum computing raise the problem of verifying the outcome of these quantum computations. The recent verification protocols using blind quantum computing are fruitful for addressing this problem. Unfortunately, all known schemes have relatively high overhead. Here we present a novel construction for the resource state of verifiable blind quantum computation. This approach achieves a better verifiability of 0.866 in the case of classical output. In addition, the number of required qubits is 2N+4cN, where N and c are the number of vertices and the maximal degree in the original computation graph, respectively. In other words, our overhead is less linear in the size of the computational scale. Finally, we utilize the method of repetition and fault-tolerant code to optimise the verifiability.

scholarly journals Semiconductor quantum computation

2018 ◽  
Vol 6 (1) ◽  
pp. 32-54 ◽  
Author(s):  
Xin Zhang ◽  
Hai-Ou Li ◽  
Gang Cao ◽  
Ming Xiao ◽  
Guang-Can Guo ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Fault Tolerant ◽  
Theoretical Work ◽  
Positive Trend ◽  
Material Development ◽  
Recent Theoretical Work ◽  
Gate Control ◽  
Huge Impact ◽  
Basic Ideas

AbstractSemiconductors, a significant type of material in the information era, are becoming more and more powerful in the field of quantum information. In recent decades, semiconductor quantum computation was investigated thoroughly across the world and developed with a dramatically fast speed. The research varied from initialization, control and readout of qubits, to the architecture of fault-tolerant quantum computing. Here, we first introduce the basic ideas for quantum computing, and then discuss the developments of single- and two-qubit gate control in semiconductors. Up to now, the qubit initialization, control and readout can be realized with relatively high fidelity and a programmable two-qubit quantum processor has even been demonstrated. However, to further improve the qubit quality and scale it up, there are still some challenges to resolve such as the improvement of the readout method, material development and scalable designs. We discuss these issues and introduce the forefronts of progress. Finally, considering the positive trend of the research on semiconductor quantum devices and recent theoretical work on the applications of quantum computation, we anticipate that semiconductor quantum computation may develop fast and will have a huge impact on our lives in the near future.

scholarly journals Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics

Quantum ◽  
2018 ◽  
Vol 2 ◽  
pp. 43 ◽  
Author(s):  
Christopher Chamberland ◽  
Pavithran Iyer ◽  
David Poulin
Keyword(s):  
Quantum Computing ◽  
Error Correction ◽  
Quantum Computation ◽  
Fault Tolerant ◽  
Independent Interest ◽  
Optimal Correction ◽  
Decoding Algorithms ◽  
Gate Time

We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for instance it does not require active error correction and results in a reduced error-correction overhead when error diagnostics is much slower than the gate time. In addition, we adapt our protocol to cases where the underlying error correction strategy chooses the optimal correction amongst all Clifford gates instead of the usual Pauli gates. The resulting Clifford frame protocol is of independent interest as it can increase error thresholds and could find applications in other areas of quantum computation.

scholarly journals Competing ν = 5/2 fractional quantum Hall states in confined geometry

2016 ◽  
Vol 113 (44) ◽  
pp. 12386-12390 ◽  
Author(s):  
Hailong Fu ◽  
Pengjie Wang ◽  
Pujia Shan ◽  
Lin Xiong ◽  
Loren N. Pfeiffer ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Filling Factor ◽  
Fault Tolerant ◽  
Quantum Hall ◽  
Point Contact ◽  
Fractional Quantum ◽  
Fractional Quantum Hall ◽  
Topological Quantum ◽  
Quantum Point ◽  
Topological Quantum Computation

Some theories predict that the filling factor 5/2 fractional quantum Hall state can exhibit non-Abelian statistics, which makes it a candidate for fault-tolerant topological quantum computation. Although the non-Abelian Pfaffian state and its particle-hole conjugate, the anti-Pfaffian state, are the most plausible wave functions for the 5/2 state, there are a number of alternatives with either Abelian or non-Abelian statistics. Recent experiments suggest that the tunneling exponents are more consistent with an Abelian state rather than a non-Abelian state. Here, we present edge-current–tunneling experiments in geometrically confined quantum point contacts, which indicate that Abelian and non-Abelian states compete at filling factor 5/2. Our results are consistent with a transition from an Abelian state to a non-Abelian state in a single quantum point contact when the confinement is tuned. Our observation suggests that there is an intrinsic non-Abelian 5/2 ground state but that the appropriate confinement is necessary to maintain it. This observation is important not only for understanding the physics of the 5/2 state but also for the design of future topological quantum computation devices.

scholarly journals MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES

2009 ◽  
Vol 07 (06) ◽  
pp. 1053-1203 ◽  
Author(s):  
ROBERT RAUßENDORF
Keyword(s):  
Computational Model ◽  
Quantum Computation ◽  
Quantum Logic ◽  
Network Model ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
Cluster State ◽  
Building Blocks ◽  
Network Simulator ◽  
Classical Level

In this thesis, we describe the one-way quantum computer [Formula: see text], a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state. We prove the universality of the [Formula: see text], describe the underlying computational model and demonstrate that the [Formula: see text] can be operated fault-tolerantly. In Sec. 2, we show that the [Formula: see text] can be regarded as a simulator of quantum logic networks. In this way, we prove the universality and establish the link to the network model — the common model of quantum computation. We also indicate that the description of the [Formula: see text] as a network simulator is not adequate in every respect. In Sec. 3, we derive the computational model underlying the [Formula: see text], which is very different from the quantum logic network model. The [Formula: see text] has no quantum input, no quantum output and no quantum register, and the unitary gates from some universal set are not the elementary building blocks of [Formula: see text] quantum algorithms. Further, all information that is processed with the [Formula: see text] is the outcomes of one-qubit measurements and thus processing of information exists only at the classical level. The [Formula: see text] is nevertheless quantum-mechanical, as it uses a highly entangled cluster state as the central physical resource. In Sec. 4, we show that there exist nonzero error thresholds for fault-tolerant quantum computation with the [Formula: see text]. Further, we outline the concept of checksums in the context of the [Formula: see text], which may become an element in future practical and adequate methods for fault-tolerant [Formula: see text] computation.

Efficient reversible quantum design of sig-magnitude to two's complement converters

2020 ◽  
Vol 20 (9&10) ◽  
pp. 747-765
Author(s):  
F. Orts ◽  
G. Ortega ◽  
E.M. E.M. Garzon
Keyword(s):  
Quantum Computing ◽  
Scientific Community ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
State Of The Art ◽  
The Other ◽  
Quantum Computers ◽  
Binary Number ◽  
Quantum Cost ◽  
The One

Despite the great interest that the scientific community has in quantum computing, the scarcity and high cost of resources prevent to advance in this field. Specifically, qubits are very expensive to build, causing the few available quantum computers are tremendously limited in their number of qubits and delaying their progress. This work presents new reversible circuits that optimize the necessary resources for the conversion of a sign binary number into two's complement of N digits. The benefits of our work are two: on the one hand, the proposed two's complement converters are fault tolerant circuits and also are more efficient in terms of resources (essentially, quantum cost, number of qubits, and T-count) than the described in the literature. On the other hand, valuable information about available converters and, what is more, quantum adders, is summarized in tables for interested researchers. The converters have been measured using robust metrics and have been compared with the state-of-the-art circuits. The code to build them in a real quantum computer is given.

Fault-tolerant blind quantum computing using GHZ states over depolarization channel

2021 ◽  
Vol 20 (9) ◽  
Author(s):  
Xiaoqing Tan ◽  
Hong Tao ◽  
Xiaoqian Zhang ◽  
Xiaodan Zeng ◽  
Qingshan Xu
Keyword(s):  
Quantum Computing ◽  
Fault Tolerant ◽  
Ghz States

scholarly journals Roads towards fault-tolerant universal quantum computation

Nature ◽  
2017 ◽  
Vol 549 (7671) ◽  
pp. 172-179 ◽  
Author(s):  
Earl T. Campbell ◽  
Barbara M. Terhal ◽  
Christophe Vuillot
Keyword(s):  
Quantum Computation ◽  
Fault Tolerant ◽  
Universal Quantum
Sign in / Sign up

Export Citation Format

Share Document