Outcome determinism in measurement-based quantum computation with qudits

Abstract

In measurement-based quantum computing (MBQC), computation is carried out by a sequence of measurements and corrections on an entangled state. Flow, and related concepts, are powerful techniques for characterising the dependence of the corrections on previous measurement outcomes. We introduce flow-based methods for MBQC with qudit graph states, which we call Zd-flow, when the local dimension is an odd prime. Our main results are proofs that Zd-flow is a necessary and sufficient condition for a strong form of outcome determinism. Along the way, we find a suitable generalisation of the concept of measurement planes to this setting and characterise the allowed measurements in a qudit MBQC. We also provide a polynomial-time algorithm for finding an optimal Zd-flow whenever one exists.

16 pages + 10 pages of appendices, 1 figure

References in corpus (7)

• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Asymptotic Improvements to Quantum Circuits via Qutrits
• Finding Optimal Flows Efficiently
• Properties of the extended Clifford group with applications to SIC-POVMs and MUBs
• Closed timelike curves in measurement-based quantum computation
• Flow conditions for continuous variable measurement-based quantum computing
• Proceedings 16th International Conference on Quantum Physics and Logic

Cited by in corpus (4)

• Resource-efficient photonic quantum computation with high-dimensional cluster states
• The power of qutrits for non-adaptive measurement-based quantum computing
• Measurement-based quantum computing with qudit stabilizer states
• Revealing effects of local dimension on variable-range interacting model by connecting Lieb-Robinson bounds and multipartite entanglement