Related papers: Process verification of two-qubit quantum gates by…
We numerically study protocols consisting of repeated applications of two qubit gates used for generating random pure states. A necessary number of steps needed in order to generate states displaying bipartite entanglement typical of random…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
As progress is made towards the first generation of error-corrected quantum computers, robust characterization and validation protocols are required to assess the noise environments of physical quantum processors. While standard coherence…
We introduce a scheme to characterise a qudit T gate that has different noise than a set of Clifford gates. We developed our scheme through representation theory and ring theory to generalise non-Clifford interleaved benchmarking to qudit…
We present an algorithm for performing quantum process tomography on an unknown $n$-qubit unitary $C$ from the Clifford group. Our algorithm uses Bell basis measurements to deterministically learn $C$ with $4n + 3$ queries, which is the…
We show that the minimum experimental effort to characterize the proper functioning of a quantum device scales as 2^n for n qubits and requires classical computational resources ~ n^2 2^{3n}. This represents an exponential reduction…
In its many variants, randomized benchmarking (RB) is a broadly used technique for assessing the quality of gate implementations on quantum computers. A detailed theoretical understanding and general guarantees exist for the functioning and…
Designing quantum systems with the measurement speed and accuracy needed for quantum error correction using superconducting qubits requires iterative design and test informed by accurate models and characterization tools. We introduce a…
We estimate the success probability of quantum protocols composed of Clifford operations in the presence of Pauli errors. Our method is derived from the fault-point formalism previously used to determine the success rate of low-distance…
The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of…
We review an experimental technique used to correct state preparation and measurement errors on gate-based quantum computers, and discuss its rigorous justification. Within a specific biased quantum measurement model, we prove that nonideal…
In some quantum computing (QC) architectures, entanglement of an arbitrary number of qubits can be generated in a single operation. This property has many potential applications, and may specifically be useful for quantum error correction…
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…
As quantum devices progress towards a quantum advantage regime, they become harder to benchmark. A particularly relevant challenge is to assess the quality of the whole computation, beyond testing the performance of each single operation.…
To guarantee the normal functioning of quantum devices in different scenarios, appropriate benchmarking tool kits are quite significant. Inspired by the recent progress on quantum state verification, here we establish a general framework of…
Quantum process tomography of each directly implementable quantum gate used in the IBM quantum processors is performed to compute gate error in order to check viability of complex quantum operations in the superconductivity-based quantum…
The Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. In this work, we provide…
Besides noticeable challenges in implementing low-error single- and two-qubit quantum gates in superconducting quantum processors, the readout technique and analysis are a key factor in determining the efficiency and performance of quantum…
As quantum information processors grow in quantum bit (qubit) count and functionality, the control and measurement system becomes a limiting factor to large scale extensibility. To tackle this challenge and keep pace with rapidly evolving…
A major challenge in operating multi-qubit quantum processors is to mitigate multi-qubit coherent errors. For superconducting circuits, besides crosstalk originating from imperfect isolation of control lines, dispersive coupling between…