Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements
arXiv:1809.07552
Abstract
Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal measurement-based quantum computing and its verification. In this paper, we construct a universal hypergraph state that only requires and -basis measurements for universal measurement-based quantum computing. We also show that universal measurement-based quantum computing on our hypergraph state can be verified in polynomial time using only and -basis measurements. Furthermore, in order to demonstrate an advantage of our hypergraph state, we construct a verifiable blind quantum computing protocol that requires only and -basis measurements for the client.
arXiv comment12 pages, 8 figures, 1 table, close to published version
References in corpus (21)
- Fault-tolerant quantum computation by anyons
- Persistent entanglement in arrays of interacting particles
- Experimental One-Way Quantum Computing
- Fault-tolerant quantum computation with high threshold in two dimensions
- A fault-tolerant one-way quantum computer
- Unconditionally verifiable blind computation
- From three-photon GHZ states to ballistic universal quantum computation
- Blind quantum computation protocol in which Alice only makes measurements
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Quantum Hypergraph States
- Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
- Blind topological measurement-based quantum computation
- Hierarchy of universal entanglement in 2D measurement-based quantum computation
- Verification of Many-Qubit States
- Trading inverses for an irrep in the Solovay-Kitaev theorem
- Verified measurement-based quantum computing with hypergraph states
- Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
- Graph States, Pivot Minor, and Universality of (X,Z)-measurements
- One-way quantum computing in superconducting circuits
- Fault-tolerant verifiable blind quantum computing with logical state remote preparation
- Impossibility of blind quantum sampling for classical client