Measurement-based interleaved randomised benchmarking using IBM processors
arXiv:2203.14995 · doi:10.1088/1402-4896/acb298
Abstract
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 is of vital importance, since it is often the dominant factor preventing the successful realisation of advanced quantum computations. Here we propose and demonstrate an interleaved randomised benchmarking protocol for measurement-based quantum computers that can be used to estimate the fidelity of any single-qubit measurement-based gate. We tested the protocol on IBM superconducting quantum processors by estimating the fidelity of the Hadamard and T gates - a universal single-qubit gate set. Measurements were performed on entangled cluster states of up to 31 qubits. Our estimated gate fidelities show good agreement with those calculated from quantum process tomography. By artificially increasing noise, we were able to show that our protocol detects large noise variations in different implementations of a gate.
arXiv comment14 pages, 6 figures, appendix
References in corpus (68)
- Quantum Computing in the NISQ era and beyond
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Machine Learning
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Measurement-based quantum computation with cluster states
- Integrated Photonic Quantum Technologies
- Experimental One-Way Quantum Computing
- Measurement-based quantum computation
- Randomized Benchmarking of Quantum Gates
- An addressable quantum dot qubit with fault-tolerant control fidelity
- A Theory of Fault-Tolerant Quantum Computation
- Prescription for experimental determination of the dynamics of a quantum black box
- Resource-efficient linear optical quantum computation
- High-fidelity quantum logic gates using trapped-ion hyperfine qubits
- High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
- Robust randomized benchmarking of quantum processes
- Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Optical quantum computation using cluster states
- Perspectives of quantum annealing: Methods and implementations
- Scalable Noise Estimation with Random Unitary Operators
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Characterizing Quantum Gates via Randomized Benchmarking
- Efficient measurement of quantum gate error by interleaved randomized benchmarking
- A fault-tolerant one-way quantum computer
- Cluster-state quantum computation
- Randomized benchmarking of single qubit gates in a 2D array of neutral atom qubits
- Implementing optimal control pulse shaping for improved single-qubit gates
- Process verification of two-qubit quantum gates by randomized benchmarking
- Randomized Benchmarking with Confidence
- Three Qubit Randomized Benchmarking
- Comparing Experiments to the Fault-Tolerance Threshold
- Modelling and Simulating the Noisy Behaviour of Near-term Quantum Computers
- Randomized Benchmarking of Multi-Qubit Gates
- What randomized benchmarking actually measures
- Programmable four-photon graph states on a silicon chip
- Bounding quantum gate error rate based on reported average fidelity
- Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
- Robust Extraction of Tomographic Information via Randomized Benchmarking
- Entanglement in a 20-Qubit Superconducting Quantum Computer
- Characterizing Universal Gate Sets via Dihedral Benchmarking
- Producing cluster states in charge qubits and flux qubits
- Randomized benchmarking with gate-dependent noise
- Demonstration of Shor's factoring algorithm for N=21 on IBM quantum processors
- Efficient error characterization in Quantum Information Processing
- Randomized benchmarking of atomic qubits in an optical lattice
- Fusion-based quantum computation
- Quantum Dot Cluster State Computing with Encoded Qubits
- Real Randomized Benchmarking
- Accelerated Randomized Benchmarking
- Bounding the average gate fidelity of composite channels using the unitarity
- Randomized Benchmarking with Restricted Gate Sets
- Quantum circuits for exact unitary -designs and applications to higher-order randomized benchmarking
- Estimating the fidelity of T gates using standard interleaved randomized benchmarking
- From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
- Creation of resilient entangled states and a resource for measurement-based quantum computation with optical superlattices
- Benchmarking near-term quantum computers via random circuit sampling
- Bounding experimental quantum error rates relative to fault-tolerant thresholds
- Efficient quantum pseudorandomness with simple graph states
- Randomized Benchmarking under Different Gatesets
- Randomized benchmarking in measurement-based quantum computing
- Derandomizing quantum circuits with measurement based unitary designs
- Deterministic one-way logic gates on a cloud quantum computer
- Switch networks for photonic fusion-based quantum computing
- Implementation of single-qubit measurement-based t-designs using IBM processors