arXiv Analytics

Sign in

arXiv:1808.03927 [quant-ph]AbstractReferencesReviewsResources

Benchmarks for approximate CNOTs based on a 17-Qubit Surface Code

Andreas Peter, Daniel Loss, James R. Wootton

Published 2018-08-12Version 1

Scalable and fault-tolerant quantum computation will require error correction. This will demand constant measurement of many-qubit observables, implemented using a vast number of CNOT gates. Indeed, practically all operations performed by a fault-tolerant device will be these CNOTs, or equivalent two-qubit controlled operations. It is therefore important to devise benchmarks for these gates that explicitly quantify their effectiveness at this task. Here we develop such benchmarks, and demonstrate their use by applying them to a range of differently implemented controlled gates and a particular quantum error correcting code. Specifically, we consider spin qubits confined to quantum dots that are coupled either directly or via floating gates to implement the minimal 17-qubit instance of the surface code. Our results show that small differences in the gate fidelity can lead to large differences in the performance of the surface code. This shows that gate fidelity is not, in general, a good predictor of code performance.

Related articles: Most relevant | Search more
arXiv:1705.02771 [quant-ph] (Published 2017-05-08)
Assessing the progress of trapped-ion processors towards fault-tolerant quantum computation
A. Bermudez et al.
arXiv:0911.3202 [quant-ph] (Published 2009-11-17, updated 2011-07-18)
Combining dynamical decoupling with fault-tolerant quantum computation
arXiv:quant-ph/9605011 (Published 1996-05-13, updated 1997-03-05)
Fault-tolerant quantum computation