Derives analytic expressions for randomized benchmarking under temporally correlated non-Markovian noise, identifies cases where correlations are invisible to RB, and shows they can affect diamond norm errors.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Computational complexity of random multi-qudit states and unitaries scales exponentially with qudit number, while physical complexity scales more slowly.
citing papers explorer
-
Blind-spots of Randomized Benchmarking Under Temporal Correlations
Derives analytic expressions for randomized benchmarking under temporally correlated non-Markovian noise, identifies cases where correlations are invisible to RB, and shows they can affect diamond norm errors.
-
Computational and physical complexity of synthesizing random multi-qudit quantum states and unitary operators
Computational complexity of random multi-qudit states and unitaries scales exponentially with qudit number, while physical complexity scales more slowly.