Related papers: Benchmarking non-Clifford gates using only Pauli t…
With continuing improvements on the quality of fabricated quantum devices, it becomes increasingly crucial to analyze noisy quantum process in greater details such as characterizing the non-Markovianity in a quantitative manner. In this…
We present a low-cost protocol for benchmarking applications on generic quantum hardware in the circuit model. Using families of Clifford circuits which mimic the application circuit structure, we are able to predict how measured…
We demonstrate a new technique that adapts single-qubit randomized benchmarking to two-qubit M{\o}lmer-S{\o}rensen gates. We use the controllable gate phase to generate Cliffords that act on a two-state subspace, enabling benchmarking of…
We study the effects of imperfections on the fidelity of the Toffoli gate recently realized in a circuit~QED setup using quantum control methods. The noise is introduced in the interqubits interactions. The coupling constants are no longer…
Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…
Quantum measurements with feed-forward are crucial components of fault-tolerant quantum computers. We show how the error rate of such a measurement can be directly estimated by fitting the probability that successive randomly compiled…
The rapid progress in the development of quantum devices is in large part due to the availability of a wide range of characterization techniques allowing to probe, test and adjust them. Nevertheless, these methods often make use of…
We initiate the study of parameterized complexity of $\textsf{QMA}$ problems in terms of the number of non-Clifford gates in the problem description. We show that for the problem of parameterized quantum circuit satisfiability, there exists…
In this work, we consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. This property allows us to design a class of noisy Hadamard-tests involving entangling and…
Reaching fault-tolerant quantum computation relies on the successful implementation of non-Clifford circuits with quantum error correction (QEC). In QEC, quantum gates and measurements encode quantum information into an error-protected…
Pauli channels are widely used to describe errors in quantum computers, particularly when noise is shaped via Pauli twirling. A common assumption is that such channels admit a Markovian generator, namely a Pauli-Lindblad model with…
Recent work has demonstrated that high-threshold quantum error correction is possible for biased-noise qubits, provided one can implement a controlled-not (CX) gate that preserves the bias. Bias-preserving CX gates have been proposed for…
We present a tomographic protocol for the characterization of multiqubit quantum channels. We discuss a specific class of input states, for which the set of Pauli measurements at the output of the channel directly relates to its Pauli…
We describe how randomized benchmarking can be used to reconstruct the unital part of any trace-preserving quantum map, which in turn is sufficient for the full characterization of any unitary evolution, or more generally, any unital…
We present a software library for the commutation of Pauli operators through quantum Clifford circuits, which is called Pauli tracking. Tracking Pauli operators allows one to reduce the number of Pauli gates that must be executed on quantum…
We introduce a general framework for weak transversal gates -- probabilistic implementation of logical unitaries realized by local physical unitaries -- and propose a novel partially fault-tolerant quantum computing architecture that…
As quantum devices make steady progress towards intermediate scale and fault-tolerant quantum computing, it is essential to develop rigorous and efficient measurement protocols that account for known sources of noise. Most existing quantum…
Quantum computers have the potential to outperform classical computers in a range of computational tasks, such as prime factorisation and unstructured searching. However, real-world quantum computers are subject to noise. Quantifying noise…
Due to the technical difficulty of building large quantum computers, it is important to be able to estimate how faithful a given implementation is to an ideal quantum computer. The common approach of completely characterizing the…
Classical simulations of noisy stabilizer circuits are often used to estimate the threshold of a quantum error-correcting code. Physical noise sources are efficiently approximated by random insertions of Pauli operators. For a single qubit,…