Fault-Tolerant Operations for Universal Blind Quantum Computation

Chien, Chia-Hung; Meter, Rodney Van; Kuo, Sy‐Yen

doi:10.1145/2700248

Cited by 30 publications

(30 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A DQC protocol for continuous-variable quantum computation has been proposed [Mor12], as well as protocols in the circuit [GMMR13] and ancilla-driven [SKM13] quantum computation models. To improve the efficiency of these protocols, fault tolerant computation has been directly embedded in them [MF12,CMK13]. Alternatives which minimize the communication complexity between the client and server have also been studied [GMMR13,MPDF13].…”

Section: Other Related Workmentioning

confidence: 99%

Composable Security of Delegated Quantum Computation

Dunjko

Fitzsimons

Portmann

et al. 2014

Lecture Notes in Computer Science

134

View full text Add to dashboard Cite

Delegating difficult computations to remote large computation facilities, with appropriate security guarantees, is a possible solution for the ever-growing needs of personal computing power. For delegated computation protocols to be usable in a larger context -or simply to securely run two protocols in parallel -the security definitions need to be composable. Here, we define composable security for delegated quantum computation. We distinguish between protocols which provide only blindness -the computation is hidden from the server -and those that are also verifiablethe client can check that it has received the correct result. We show that the composable security definition capturing both these notions can be reduced to a combination of several distinct "trace-distance-type" criteriawhich are, individually, non-composable security definitions.Additionally, we study the security of some known delegated quantum computation protocols, including Broadbent, Fitzsimons and Kashefi's Universal Blind Quantum Computation protocol. Even though these protocols were originally proposed with insufficient security criteria, they turn out to still be secure given the stronger composable definitions.

show abstract

Section: Other Related Workmentioning

confidence: 99%

Composable Security of Delegated Quantum Computation

Dunjko

Fitzsimons

Portmann

et al. 2014

Lecture Notes in Computer Science

134

View full text Add to dashboard Cite

show abstract

“…While early proposals noted that their constructions could be made fault-tolerant, 10, 12 significant work has since been put into computing explicit fault-tolerance thresholds for blind computation 66,67 and dealing with the issue of noise occurring during quantum communication between client and server. [67][68][69] Issues of fault-tolerance have also been examined in the context of verification, [70][71][72] a subtle topic which is often under-examined in the literature. In the context of multipleserver protocols, the issue of overcoming noisy correlations between servers has also been addressed in the form of entanglement distillation protocols.…”

Section: Physical Implementationsmentioning

confidence: 99%

Private quantum computation: an introduction to blind quantum computing and related protocols

2017

View full text Add to dashboard Cite

Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have emerged which seek to marry these concepts for the purpose of securing computation rather than communication. These protocols address the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation. We present a review of the progress to date in this emerging area.npj Quantum Information (2017) 3:23 ; doi:10.1038/s41534-017-0025-3 INTRODUCTIONFor almost as long as programmable computers have existed, there has been a strong motivation for users to run calculations on hardware that they do not personally control. Initially, this was due to the high cost of such devices coupled with the need for specialised facilities to house them. Universities, government agencies and large corporations housed computers in central locations where they ran jobs for their users in batches. Over time, computers have become ubiquitous, but demand for centralised resources has not abated. Even today, the use of delegated computation is widespread, in the form of cloud computing.While we do not yet know how the field of quantum computing will develop, it seems reasonable to speculate that it will follow a similar path. Indeed this speculation is somewhat born out by recent efforts to provide access to rudimentary quantum processors over the Internet.1 Today we are in a far better position to enable remote access to quantum computers than was possible with early conventional computers, due to the existence of high speed global communications networks, and the ubiquity of classical processors. Furthermore, the discovery of quantum key distribution protocols 2, 3 has provided the impetus to develop quantum communication over existing optical fibre networks

show abstract

“…We find that the deepest depth among the stabilizer circuits has the largest correlation with the logical error rate of the lattice and the biggest number of data qubits owned by a stabilizer has the next largest correlation. Large-scale quantum computation will require an ensemble of sufficiently faulttolerant quantum computation chips, coupled either by their proximity or through the use of quantum communication links [26][27][28][29][30][31][32]. Our results will contribute to guiding the construction of this ensemble.…”

Section: Introductionmentioning

confidence: 97%

Surface code error correction on a defective lattice

et al. 2017

Self Cite

View full text Add to dashboard Cite

The yield of physical qubits fabricated in the laboratory is much lower than that of classical transistors in production semiconductor fabrication. Actual implementations of quantum computers will be susceptible to loss in the form of physically faulty qubits. Though these physical faults must negatively affect the computation, we can deal with them by adapting error-correction schemes. In this paper we have simulated statically placed single-fault lattices and lattices with randomly placed faults at functional qubit yields of 80%, 90%, and 95%, showing practical performance of a defective surface code by employing actual circuit constructions and realistic errors on every gate, including identity gates. We extend Stace et alʼs superplaquettes solution against dynamic losses for the surface code to handle static losses such as physically faulty qubits [1]. The single-fault analysis shows that a static loss at the periphery of the lattice has less negative effect than a static loss at the center. The randomly faulty analysis shows that 95% yield is good enough to build a large-scale quantum computer. The local gate error rate threshold is~0.3%, and a code distance of seven suppresses the residual error rate below the original error rate at = p 0.1%. 90% yield is also good enough when we discard badly fabricated quantum computation chips, while 80% yield does not show enough error suppression even when discarding 90% of the chips. We evaluated several metrics for predicting chip performance, and found that the average of the product of the number of data qubits and the cycle time of a stabilizer measurement of stabilizers gave the strongest correlation with logical error rates. Our analysis will help with selecting usable quantum computation chips from among the pool of all fabricated chips.

show abstract

Fault-Tolerant Operations for Universal Blind Quantum Computation

Cited by 30 publications

References 31 publications

Composable Security of Delegated Quantum Computation

Composable Security of Delegated Quantum Computation

Private quantum computation: an introduction to blind quantum computing and related protocols

Surface code error correction on a defective lattice

Contact Info

Product

Resources

About