Hierarchies of resources for measurement-based quantum computation

DOI10.1088/1367-2630/ACAEE2zbMATH Open1510.81014arXiv2203.09965MaRDI QIDQ6042386FDOQ6042386

Authors: Sam Roberts, Earl T. Campbell, S. D. Bartlett 

Publication date: 10 May 2023

Published in: New Journal of Physics (Search for Journal in Brave)

Abstract: For certain restricted computational tasks, quantum mechanics provides a provable advantage over any possible classical implementation. Several of these results have been proven using the framework of measurement-based quantum computation (MBQC), where non-locality and more generally contextuality have been identified as necessary resources for certain quantum computations. Here, we consider the computational power of MBQC in more detail by refining its resource requirements, both on the allowed operations and the number of accessible qubits. More precisely, we identify which Boolean functions can be computed in non-adaptive MBQC, with local operations contained within a finite level in the Clifford hierarchy. Moreover, for non-adaptive MBQC restricted to certain subtheories such as stabiliser MBQC, we compute the minimal number of qubits required to compute a given Boolean function. Our results point towards hierarchies of resources that more sharply characterise the power of MBQC beyond the binary of contextuality vs non-contextuality.

Full work available at URL: https://arxiv.org/abs/2203.09965

Recommendations

• Non-adaptive measurement-based quantum computation and multi-party Bell inequalities
• Topos logic in measurement-based quantum computation
• The resource theory of stabilizer quantum computation
• The Role of Classical Computation in Measurement-Based Quantum Computation
• Determinism and computational power of real measurement-based quantum computation

zbMATH Keywords

nonlocalitycontextualitymeasurement-based quantum computationClifford hierarchy

Mathematics Subject Classification ID

Quantum computation (81P68) Other nonclassical models of computation (68Q09) Quantum measurement theory, state operations, state preparations (81P15)

Cites Work

• Analysis of Boolean Functions
• Title not available (Why is that?)
• The sheaf-theoretic structure of non-locality and contextuality
• Best Affine and Quadratic Approximations of Particular Classes of Boolean Functions
• Quantum advantage with shallow circuits
• Non-adaptive measurement-based quantum computation and multi-party Bell inequalities
• Hudson’s theorem for finite-dimensional quantum systems
• The resource theory of stabilizer quantum computation
• A fault-tolerant one-way quantum computer
• The LU-LC conjecture, diagonal local operations and quadratic forms over GF(2)
• Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
• Gapped boundaries, group cohomology and fault-tolerant logical gates
• Logical paradoxes in quantum computation
• T-Count Optimization and Reed–Muller Codes
• Symmetry protection of measurement-based quantum computation in ground states
• Minimum quantum resources for strong non-locality
• Maximum likelihood decoding of certain Reed - Muller codes (Corresp.)

Cited In (9)

• The power of qutrits for non-adaptive measurement-based quantum computing
• Measurement-based quantum computation and undecidable logic
• Topos logic in measurement-based quantum computation
• Symmetry constraints on temporal order in measurement-based quantum computation
• Symmetry constraints on temporal order in measurement-based quantum computation
• Non-adaptive measurement-based quantum computation and multi-party Bell inequalities
• Finding new multipartite entangled resources for measurement-based quantum computation
• Topological features of good resources for measurement-based quantum computation
• Groups of diagonal gates in the Clifford hierarchy

This page was built for publication: Hierarchies of resources for measurement-based quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042386)