Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2008.11294 · Nature Physics

Measuring the capabilities of quantum computers

Timothy J Proctor, Kenneth Rudinger, Kevin C Young, Erik Nielsen, Robin Blume-Kohout

Published Dec 20, 2021• 146 citations
arXivHTMLPDF
DOI
10.1038/s41567-021-01409-7

Related papers

Benchmarking Quantum Computers

Robson Giles

•Jan 1, 2024•0 citations

Measuring the Capabilities of Quantum Computers

Timothy J Proctor, Kenneth Rudinger, Erik Nielsen +2 more

This is supplemental data and code for: T. Proctor et al., Measuring the Capabilities of Quantum Computers, Nature Physics 18, 75-79 (2022). This folder contains all the data and the analysis code to generate the results presented in that paper. The core data analysis routines use PyGSTi, which can be found at https://github.com/pyGSTio/pyGSTi. Please direct any questions to Timothy Proctor (tjproct@sandia.gov).

•Aug 13, 2021•9 citations

Benchmarking quantum computers

Timothy J Proctor, Kevin C Young, Andrew Baczewski +1 more

arXiv:2407.08828•Nature Reviews Physics•Jan 7, 2025•71 citations

Ancilla-driven blind quantum computation for clients with different quantum capabilities

Qunfeng Dai, Junyu Quan, Xiaoping Lou +1 more

Abstract Blind quantum computation (BQC) allows a client with limited quantum power to delegate his quantum computational task to a powerful server and still keep his input, output, and algorithm private. There are mainly two kinds of models about BQC, namely circuit-based and measurement-based models. In addition, a hybrid model called ancilla-driven universal blind quantum computation (ADBQC) was proposed by combining the properties of both circuit-based and measurement-based models, where all unitary operations on the register qubits can be realized with the aid of single ancilla coupled to the register qubits. However, in the ADBQC model, the quantum capability of the client is strictly limited to preparing single qubits. If a client can only perform single-qubit measurements or a few simple quantum gates, he will not be able to perform ADBQC. This paper solves the problem and extends the existing model by proposing two types of ADBQC protocols for clients with different quantum capabilities, such as performing single-qubit measurements or single-qubit gates. Furthermore, in the two proposed ADBQC protocols, clients can detect whether servers are honest or not with a high probability by using corresponding verifiable techniques.

arXiv:2210.09878•EPJ Quantum Technology•May 23, 2023•5 citations

The Limits of Quantum Computers

Scott Aaronson

Scientific American•Mar 1, 2008•146 citations

Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle

Ben W. Reichardt

A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented with limited quasiparticle braiding capabilities, in fact using only a single mobile quasiparticle, if the system can be properly initialized by measurements. It is also known that measurements alone suffice without any braiding, provided that the measurement devices can be dynamically created and modified. We study a model in which both measurement and braiding capabilities are limited. Given the ability to pull nontrivial Fibonacci anyon pairs from the vacuum with a certain success probability, we show how to simulate universal quantum computation by braiding one quasiparticle and with only one measurement, to read out the result. The difficulty lies in initializing the system. We give a systematic construction of a family of braid sequences that initialize to arbitrary accuracy nontrivial composite anyons. Instead of using the Solovay-Kitaev theorem, the sequences are based on a quantum algorithm for convergent search.

arXiv:1206.0330•Jun 1, 2012•0 citations
Abstract Blind quantum computation (BQC) allows a client with limited quantum power to delegate his quantum computational task to a powerful server and still keep his input, output, and algorithm private. There are mainly two kinds of models about BQC, namely circuit-based and measurement-based models. In addition, a hybrid model called ancilla-driven universal blind quantum computation (ADBQC) was proposed by combining the properties of both circuit-based and measurement-based models, where all unitary operations on the register qubits can be realized with the aid of single ancilla coupled to the register qubits. However, in the ADBQC model, the quantum capability of the client is strictly limited to preparing single qubits. If a client can only perform single-qubit measurements or a few simple quantum gates, he will not be able to perform ADBQC. This paper solves the problem and extends the existing model by proposing two types of ADBQC protocols for clients with different quantum capabilities, such as performing single-qubit measurements or single-qubit gates. Furthermore, in the two proposed ADBQC protocols, clients can detect whether servers are honest or not with a high probability by using corresponding verifiable techniques.
A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented with limited quasiparticle braiding capabilities, in fact using only a single mobile quasiparticle, if the system can be properly initialized by measurements. It is also known that measurements alone suffice without any braiding, provided that the measurement devices can be dynamically created and modified. We study a model in which both measurement and braiding capabilities are limited. Given the ability to pull nontrivial Fibonacci anyon pairs from the vacuum with a certain success probability, we show how to simulate universal quantum computation by braiding one quasiparticle and with only one measurement, to read out the result. The difficulty lies in initializing the system. We give a systematic construction of a family of braid sequences that initialize to arbitrary accuracy nontrivial composite anyons. Instead of using the Solovay-Kitaev theorem, the sequences are based on a quantum algorithm for convergent search.