Related papers: Partial randomized benchmarking
The fidelity of quantum operations is often limited by incoherent errors, which typically can be modeled by fundamental Markovian noise processes such as amplitude damping and dephasing. In Phys. Rev. Lett. 129, 150504 (2022;…
Typical quantum gate tomography protocols struggle with a self-consistency problem: the gate operation cannot be reconstructed without knowledge of the initial state and final measurement, but such knowledge cannot be obtained without…
Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is…
State of the art qubit systems are reaching the gate fidelities required for scalable quantum computation architectures. Further improvements in the fidelity of quantum gates demands characterization and benchmarking protocols that are…
Working with trapped atoms at close distance to each other, we show that one can implement entangling gates based on non-independent qubits using a single pulse per qubit, or a single structured pulse. The optimal parameters depend on…
Cross-entropy benchmarking (XEB) with single-qubit reference sequences is widely used to characterize multi-qubit gates in large-scale quantum processors, despite the lack of a rigorous theoretical justification. Here we show that the…
Qubits encoded in a decoherence-free subsystem and realized in exchange-coupled silicon quantum dots are promising candidates for fault-tolerant quantum computing. Benefits of this approach include excellent coherence, low control…
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for…
This work presents a routing-aware pruning strategy for quantum circuits executed on Noisy Intermediate-Scale Quantum (NISQ) devices. We propose a method to remove parametric controlled rotations whose small rotation angles do not justify…
We use a gradient-based optimization scheme to find single-qubit rotations to be interwoven between timesteps of a noisy logical two-qubit entangling gate in order to suppress arbitrary logical and leakage errors in the two-qubit gate. We…
Randomized benchmarking (RB) is a widely used strategy to assess the quality of available quantum gates in a computational context. RB involves applying known random sequences of gates to an initial state and using the statistics of a final…
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 introduce Quantum Functional Information (QFI), a new metric to quantify the rarity and utility of quantum states and circuits. Unlike standard measures such as fidelity or entropy, QFI captures the balance between functionality and…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
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…
Quantum computers require high fidelity quantum gates. These gates are obtained by routine calibration tasks that eat into the availability of cloud-based devices. Restless circuit execution speeds-up characterization and calibration by…
Randomized Benchmarking allows to efficiently and scalably characterize the average error of an unitary 2-design such as the Clifford group $\mathcal{C}$ on a physical candidate for quantum computation, as long as there are no…
We present a simple, malleable and low-overhead approach for improving generic biased quantum error mitigation (QEM) methods, achieving up to 15% fidelity improvements over standard QEM on 100-qubit circuits with up to 2000 entangling…
Quantum computers will require encoding of quantum information to protect them from noise. Fault-tolerant quantum computing architectures illustrate how this might be done but have not yet shown a conclusive practical advantage. Here we…
Decoherence of quantum states is a major hurdle towards scalable and reliable quantum computing. Lower decoherence (i.e., higher fidelity) can alleviate the error correction overhead and obviate the need for energy-intensive noise reduction…