Coherent randomized benchmarking
arXiv:2010.13810 · doi:10.1103/PhysRevResearch.3.033038
Abstract
Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits and devices. Here we propose to perform randomized benchmarking in a coherent way, where superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked, and in terms of efficiency and scalability. We show that e.g. universal gate sets, the set of qudit Pauli operators or more general sets including arbitrary unitaries, as well as a particular qudit Clifford gate using only the Pauli set, can be efficiently benchmarked. The price to pay is an additional complexity to add control to the involved quantum operations. However we demonstrate that this can be done by using auxiliary degrees of freedom that are naturally available in basically any physical realization, and are independent of the gates to be tested.
References in corpus (48)
- An Open-System Quantum Simulator with Trapped Ions
- Randomized Benchmarking of Quantum Gates
- Multi-particle entanglement of hot trapped 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
- Quantum computations without definite causal structure
- Scalable Noise Estimation with Random Unitary Operators
- Characterizing Quantum Gates via Randomized Benchmarking
- Quantum Process Tomography: Resource Analysis of Different Strategies
- Efficient measurement of quantum gate error by interleaved randomized benchmarking
- Quantum certification and benchmarking
- Experimental Superposition of Orders of Quantum Gates
- Characterization of addressability by simultaneous randomized benchmarking
- Computational advantage from quantum-controlled ordering of gates
- Randomized benchmarking and process tomography for gate errors in a solid-state qubit
- Characterizing large-scale quantum computers via cycle benchmarking
- Randomized benchmarking of single qubit gates in a 2D array of neutral atom qubits
- Process verification of two-qubit quantum gates by randomized benchmarking
- Adding control to arbitrary unknown quantum operations
- Randomized Benchmarking with Confidence
- Theory of quantum system certification: a tutorial
- Investigating the limits of randomized benchmarking protocols
- Randomized Benchmarking of Multi-Qubit Gates
- Quantum circuits cannot control unknown operations
- Robust Extraction of Tomographic Information via Randomized Benchmarking
- Implementing quantum control for unknown subroutines
- Characterizing Universal Gate Sets via Dihedral Benchmarking
- Experimental Quantum Communication Enhancement by Superposing Trajectories
- Scalable randomized benchmarking of non-Clifford gates
- Device-independent tomography of multipartite quantum states
- Efficient error characterization in Quantum Information Processing
- Coherent controlization using superconducting qubits
- Recovering quantum gates from few average gate fidelities
- Real Randomized Benchmarking
- Statistical analysis of randomized benchmarking
- Accelerated Randomized Benchmarking
- Multi-qubit Randomized Benchmarking Using Few Samples
- Highly Efficient Processing Multi-photon States
- Bounding the average gate fidelity of composite channels using the unitarity
- Randomized Benchmarking with Restricted Gate Sets
- Estimating the fidelity of T gates using standard interleaved randomized benchmarking
- Randomized benchmarking for individual quantum gates
- Approximate Randomized Benchmarking for Finite Groups
- Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
- Randomized Benchmarking under Different Gatesets
- Randomized benchmarking in measurement-based quantum computing
- Controlled quantum operations and combs, and their applications to universal controllization of divisible unitary operations