Hierarchies of resources for measurement-based quantum computation
arXiv:2203.09965 · doi:10.1088/1367-2630/acaee2
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.
arXiv comment15+10 pages, 3 figures
References in corpus (39)
- Measurement-based quantum computation with cluster states
- Improved Simulation of Stabilizer Circuits
- Symmetry protected topological orders and the group cohomology of their symmetry group
- Measurement-based quantum computation
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological fault-tolerance in cluster state quantum computation
- Contextuality supplies the magic for quantum computation
- All multipartite Bell correlation inequalities for two dichotomic observables per site
- The Resource Theory of Stabilizer Computation
- The Sheaf-Theoretic Structure Of Non-Locality and Contextuality
- Quantum advantage with shallow circuits
- A fault-tolerant one-way quantum computer
- Hudson's Theorem for finite-dimensional quantum systems
- Contextuality in Measurement-based Quantum Computation
- Estimating outcome probabilities of quantum circuits using quasiprobabilities
- Long-range quantum entanglement in noisy cluster states
- Computational power of correlations
- Reducing T-count with the ZX-calculus
- Contextuality as a resource for models of quantum computation on qubits
- Quantum advantage with noisy shallow circuits in 3D
- Wigner function negativity and contextuality in quantum computation on rebits
- Contextuality and Wigner function negativity in qubit quantum computation
- A computationally universal phase of quantum matter
- Hierarchy of universal entanglement in 2D measurement-based quantum computation
- Diagonal gates in the Clifford hierarchy
- Universal quantum computation using fractal symmetry-protected cluster phases
- Gapped boundaries, group cohomology and fault-tolerant logical gates
- Symmetry protection of measurement-based quantum computation in ground states
- Quantum Advantage from Sequential-Transformation Contextuality
- Non-adaptive Measurement-based Quantum Computation and Multi-party Bell Inequalities
- T-count optimization and Reed-Muller codes
- Universal fault-tolerant measurement-based quantum computation
- Symmetry-protected sign problem and magic in quantum phases of matter
- Semi-Clifford operations, structure of hierarchy, and gate complexity for fault-tolerant quantum computation
- Contextuality as a resource for measurement-based quantum computation beyond qubits
- Symmetry-protected self-correcting quantum memories
- Symmetry-protected topologically ordered states for universal quantum computation
- Quantum computational advantage with string order parameters of 1D symmetry-protected topological order
- Efficient quantum gate teleportation in higher dimensions