2014/04/06 by Giulia Gualdi, David Licht, Daniel M. Reich +1
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum many-body systems #quant-ph
paper · pdf · doi:10.1103/physreva.90.032317
published as Phys. Rev. A 90, 032317 (2014)
arxiv created 2014/04/06 · openalex publication_date 2014/09/17 · arxiv updated 2014/10/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For qubits, Monte Carlo estimation of the average fidelity of Clifford unitaries is efficient: it requires a number of experiments that is independent of the number n of qubits and classical computational resources that scale only polynomially in n. Here, we identify the requirements for efficient Monte Carlo estimation and the corresponding properties of the measurement operator basis when replacing two-level qubits by p-level qudits. Our analysis illuminates the intimate connection between mutually unbiased measurements and the existence of unitaries that can be characterized efficiently. It allows us to propose a ``hierarchy'' of generalizations of the standard Pauli basis from qubits to qudits according to the associated scaling of resources required in Monte Carlo estimation of the average fidelity.