Catalytic Transformation from Computationally Universal to Strictly Universal Measurement-Based Quantum Computation

Abstract

There are two types of universality in measurement-based quantum computation (MBQC): $strict$ and $computational$. It is well known that the former is stronger than the latter. We present a method of transforming from a certain type of computationally universal MBQC to a strictly universal one. Our method simply replaces a single qubit in a resource state with a Pauli-$Y$ eigenstate. We applied our method to show that hypergraph states can be made strictly universal with only Pauli measurements, while only computationally universal hypergraph states were known.

arXiv comment8 pages, 5 figures, v2: Close to published version. Comments welcome

References in corpus (31)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum cryptography: Public key distribution and coin tossing
• Persistent entanglement in arrays of interacting particles
• Measurement-based quantum computation with cluster states
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Entanglement-assisted local manipulation of pure quantum states
• Trading classical and quantum computational resources
• Towards a Distributed Quantum Computing Ecosystem
• Novel schemes for measurement-based quantum computation
• Quantum theory based on real numbers can be experimentally falsified
• Quantum Hypergraph States
• Affleck-Kennedy-Lieb-Tasaki State on a Honeycomb Lattice is a Universal Quantum Computational Resource
• Operational Resource Theory of Imaginarity
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Quantifying the Imaginarity of Quantum Mechanics
• Entanglement in spin chains and lattices with long-range Ising-type interactions
• Ruling out real-valued standard formalism of quantum theory
• Resource theory of imaginarity: Quantification and state conversion
• Hierarchy of universal entanglement in 2D measurement-based quantum computation
• Catalysis and activation of magic states in fault tolerant architectures
• Verification of Many-Qubit States
• Efficient Verification of Hypergraph States
• Efficient tensor network simulation of IBM's largest quantum processors
• Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
• Resource Theory of Imaginarity: New Distributed Scenarios
• Universal MBQC with generalised parity-phase interactions and Pauli measurements
• Quantum proofs can be verified using only single qubit measurements
• Latent Computational Complexity of Symmetry-Protected Topological Order with Fractional Symmetry
• Verifying commuting quantum computations via fidelity estimation of weighted graph states
• Transforming graph states to Bell-pairs is NP-Complete
• Graph states as ground states of two-body frustration-free Hamiltonians

Cited by in corpus (1)

• Reducing depth and measurement weights in Pauli-based computation