Randomised benchmarking for universal qudit gates
arXiv:2407.10396 · doi:10.1088/1367-2630/ad6635
Abstract
We aim to establish a scalable scheme for characterising diagonal non-Clifford gates for single- and multi-qudit systems; \(d\) is a prime-power integer. By employing cyclic operators and a qudit T gate, we generalise the dihedral benchmarking scheme for single- and multi-qudit circuits. Our results establish a path for experimentally benchmarking qudit systems and are of theoretical and experimental interest because our scheme is optimal insofar as it does not require preparation of the full qudit Clifford gate set to characterise a non-Clifford gate. Moreover, combined with Clifford randomised benchmarking, our scheme is useful to characterise the generators of a universal gate set.
33 pages; 8 tables
References in corpus (14)
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- High-dimensional quantum communication: benefits, progress, and future challenges
- Characterization of addressability by simultaneous randomized benchmarking
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Quantum Simulating Nature's Fundamental Fields
- Experimental Realization of a Quantum Integer-Spin Chain with Controllable Interactions
- State-independent experimental tests of quantum contextuality in a three dimensional system
- Efficient preparation and detection of microwave dressed-state qubits and qutrits with trapped ions
- Low-cost Fredkin gate with auxiliary space
- Experimental investigation of quantum correlations in a two-qutrit spin system
- Optimal synthesis of the Fredkin gate in a multilevel system
- Rolling quantum dice with a superconducting qubit
- Benchmarking of universal qutrit gates