2021
DOI: 10.1103/physrevx.11.041039
|View full text |Cite
|
Sign up to set email alerts
|

Randomized Compiling for Scalable Quantum Computing on a Noisy Superconducting Quantum Processor

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
85
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
2

Relationship

2
5

Authors

Journals

citations
Cited by 81 publications
(89 citation statements)
references
References 43 publications
4
85
0
Order By: Relevance
“…(U ) k are probabilities (we set P 0 = I ⊗n for convenience). Although not every noise process is a Pauli channel, under the assumptions A1 and A2 every process can be efficiently transformed into Pauli channels via Randomized Compiling [26,31], available in the software True-Q [30].…”
Section: A Notation and Assumptionsmentioning
confidence: 99%
See 3 more Smart Citations
“…(U ) k are probabilities (we set P 0 = I ⊗n for convenience). Although not every noise process is a Pauli channel, under the assumptions A1 and A2 every process can be efficiently transformed into Pauli channels via Randomized Compiling [26,31], available in the software True-Q [30].…”
Section: A Notation and Assumptionsmentioning
confidence: 99%
“…See the Supplemental Material for Ref. [26] for further details about CER and errors on this device.…”
Section: The Quantity Enoxmentioning
confidence: 99%
See 2 more Smart Citations
“…Fast microwave-entangling gates in coupled transmons system with similar J eff have been demonstrated [27,72], so we shall use this µ X value as a reference. More detail on the mapping between coupled spins model and interacting fluxoniums system is discussed in Appendix C.…”
Section: Multi-qubit Couplingmentioning
confidence: 99%