Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>
 gate

Garion, Shelly; Kanazawa, Naoki; Landa, H.; McKay, David; Sheldon, Sarah; Cross, Andrew W.; Wood, Christopher J.

doi:10.1103/physrevresearch.3.013204

Cited by 29 publications

(19 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CNOT gate was optimized by ORBIT after initial values were obtained using the XY4 sequence [36,37]. As the implementation method of the CNOT gate, we used Echoed cross-resonance (ECR) gate which is the same as the CNOT gate except for the single-qubit gates.…”

Section: Gate Calibrationmentioning

confidence: 99%

Generating time-domain linear cluster state by recycling superconducting qubits

Shirai¹,

Zhou²,

Sakata³

et al. 2021

Preprint

View full text Add to dashboard Cite

Cluster states, a type of highly entangled state, are essential resources for quantum information processing.Here we demonstrated the generation of a time-domain linear cluster state (t-LCS) using a superconducting quantum circuit consisting of only two transmon qubits. By recycling the physical qubits, the t-LCS equivalent up to four physical qubits was validated by quantum state tomography with fidelity of 59%. We further confirmed the true generation of t-LCS by examining the expectation value of an entanglement witness. Our demonstrated protocol of t-LCS generation allows efficient use of physical qubits which could lead to resourceefficient execution of quantum circuits on large scale.

show abstract

Section: Gate Calibrationmentioning

confidence: 99%

Generating time-domain linear cluster state by recycling superconducting qubits

Shirai¹,

Zhou²,

Sakata³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…We focus on two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the non-Clifford controlled-phase gate CS = diag(1, 1, 1, i). The CS gate has received recent attention as an alternative to the T-gate in methods for fault-tolerant quantum computing 30,31 and due to its natural implementation as an entangling operation in certain superconducting qubit systems [32][33][34][35] whose fidelity is approaching that of single-qubit gates 36,37 . Our algorithm produces an optimal circuit in a number of arithmetic operations linear in the length of the optimal decomposition.…”

Section: Introductionmentioning

confidence: 99%

Optimal two-qubit circuits for universal fault-tolerant quantum computation

Glaudell

Ross

2021

npj Quantum Inf

View full text Add to dashboard Cite

We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlled-phase gate CS = diag(1, 1, 1, i). The Clifford+CS gate set is universal for quantum computation and its elements can be implemented fault-tolerantly in most error-correcting schemes through magic state distillation. Since non-Clifford gates are typically more expensive to perform in a fault-tolerant manner, it is often desirable to construct circuits that use few CS gates. In the present paper, we introduce an efficient and optimal synthesis algorithm for two-qubit Clifford+CS operators. Our algorithm inputs a Clifford+CS operator U and outputs a Clifford+CS circuit for U, which uses the least possible number of CS gates. Because the algorithm is deterministic, the circuit it associates to a Clifford+CS operator can be viewed as a normal form for that operator. We give an explicit description of these normal forms and use this description to derive a worst-case lower bound of $$5{{\rm{log}}}_{2}(\frac{1}{\epsilon })+O(1)$$ 5 log 2 ( 1 ϵ ) + O ( 1 ) on the number of CS gates required to ϵ-approximate elements of SU(4). Our work leverages a wide variety of mathematical tools that may find further applications in the study of fault-tolerant quantum circuits.

show abstract

“…Quantum circuit users must therefore transpile their circuits to CNOT gates which often makes a poor usage of the limited coherence time. With the help of Qiskit pulse [34,35] users may extend * deg@zurich.ibm.com the set of two-qubit gates [36][37][38]. Such gates can in turn generate other multi-qubit gates more effectively than when the CNOT gate is the only two-qubit gate available [37].…”

Section: Introductionmentioning

confidence: 99%

Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware

Earnest,

Tornow,

Egger

2021

Preprint

View full text Add to dashboard Cite

We show a pulse-efficient circuit transpilation framework for noisy quantum hardware. This is achieved by scaling cross-resonance pulses and exposing each pulse as a gate to remove redundant single-qubit operations with the transpiler. Crucially, no additional calibration is needed to yield better results than a CNOT-based transpilation. This pulse-efficient circuit transpilation therefore enables a better usage of the finite coherence time without requiring knowledge of pulse-level details from the user. As demonstration, we realize a continuous family of cross-resonance-based gates for SU (4) by leveraging Cartan's decomposition. We measure the benefits of a pulse-efficient circuit transpilation with process tomography and observe up to a 50% error reduction in the fidelity of RZZ (θ) and arbitrary SU (4) gates on IBM Quantum devices. We apply this framework for quantum applications by running circuits of the Quantum Approximate Optimization Algorithm applied to MAXCUT. For an 11 qubit non-hardware native graph, our methodology reduces the overall schedule duration by up to 52% and errors by up to 38%. II. SCALING HARDWARE-NATIVE CROSS-RESONANCE GATESWe consider an all-microwave fixed-frequency transmon architecture that implements the echoed crossresonance gate [32]. A two-qubit system in which a control qubit is driven at the frequency of a target qubit

show abstract

Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled- S gate

Cited by 29 publications

References 35 publications

Generating time-domain linear cluster state by recycling superconducting qubits

Generating time-domain linear cluster state by recycling superconducting qubits

Optimal two-qubit circuits for universal fault-tolerant quantum computation

Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware

Contact Info

Product

Resources

About