Hierarchies of resources for measurement-based quantum computation
From MaRDI portal
Publication:6042386
DOI10.1088/1367-2630/acaee2zbMath1510.81014arXiv2203.09965MaRDI QIDQ6042386
Stephen D. Bartlett, Unnamed Author, Sam Roberts, Earl T. Campbell
Publication date: 10 May 2023
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.09965
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Other nonclassical models of computation (68Q09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gapped boundaries, group cohomology and fault-tolerant logical gates
- A fault-tolerant one-way quantum computer
- The resource theory of stabilizer quantum computation
- Hudson’s theorem for finite-dimensional quantum systems
- Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
- Maximum likelihood decoding of certain Reed - Muller codes (Corresp.)
- Best Affine and Quadratic Approximations of Particular Classes of Boolean Functions
- The sheaf-theoretic structure of non-locality and contextuality
- Non-adaptive measurement-based quantum computation and multi-party Bell inequalities
- Symmetry protection of measurement-based quantum computation in ground states
- Logical paradoxes in quantum computation
- Analysis of Boolean Functions
- Quantum advantage with shallow circuits
- T-Count Optimization and Reed–Muller Codes
This page was built for publication: Hierarchies of resources for measurement-based quantum computation