Design an algorithm that can implement randomized benchmarking with different primitive gate set on IBM Q device.
Description
Randomized benchmarking (RB) is a protocol to extract the gate operation error of quantum computing, regardless of the state preparation and measurement (SPAM) error. Currently qiskit ignis package provide RB functions for Clifford elements decomposed by the gate set {I, X, Y, Z, H, S, Sdg, CX, CZ, SWAP}. While in reality a quantum computing device would generate gates from different set. The goal of this issue is to provide a general package that can implement RB protocol for any given primitive set.
A package that can generate Clifford gates from any given primitive set then applying on RB protocol. Or an example code that running RB successfully with different primitive set. Comparing RB results with different primitive sets.
Abstract
Design an algorithm that can implement randomized benchmarking with different primitive gate set on IBM Q device.
Description
Randomized benchmarking (RB) is a protocol to extract the gate operation error of quantum computing, regardless of the state preparation and measurement (SPAM) error. Currently
qiskit ignispackage provide RB functions for Clifford elements decomposed by the gate set {I, X, Y, Z, H, S, Sdg, CX, CZ, SWAP}. While in reality a quantum computing device would generate gates from different set. The goal of this issue is to provide a general package that can implement RB protocol for any given primitive set.Members
@slackhandleemail:example@example.comDeliverable
A package that can generate Clifford gates from any given primitive set then applying on RB protocol. Or an example code that running RB successfully with different primitive set. Comparing RB results with different primitive sets.