Fault-tolerance in qudit circuit design
arXiv:2202.06831 · doi:10.1103/PhysRevA.106.062433
Abstract
The efficient decomposition of multi-controlled gates is a significant factor in quantum compiling, both in circuit depth and T-gate count. Recent work has demonstrated that qudits have the potential to reduce resource requirements from linear to logarithmic depth and to avoid fractional phase rotations. Here we argue, based on the scaling of decoherence in high-index states, that circuit depth is not the primary factor, and that both the choice of entangling gate and interaction network topology act together to determine the spread of errors and ultimate failure rate in a circuit. We further show that for certain linear-depth circuits, additional error mitigation is possible via selective application of resources.
References in corpus (11)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Strong quantum computational advantage using a superconducting quantum processor
- Efficient Toffoli Gates Using Qudits
- High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits
- Single-step implementation of high fidelity -bit Toffoli gate
- Resilience of quantum random access memory to generic noise
- Generalized Toffoli gates using qudit catalysis
- Scalable algorithm simplification using quantum AND logic
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- A four-dimensional toric code with non-Clifford transversal gates
- Native three-body interaction in superconducting circuits