Verified measurement-based quantum computing with hypergraph states
arXiv:1701.05688 · doi:10.1103/PhysRevA.96.062321
Abstract
Hypergraph states are generalizations of graph states where controlled- gates on edges are replaced with generalized controlled- gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states with a constant 1-norm error unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential single-qubit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying hypergraph states with only sequential single-qubit Pauli measurements. As applications, we consider verified blind quantum computing with hypergraph states, and quantum supremacy demonstrations with hypergraph states.
5 pages, 1 figure
References in corpus (21)
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Novel schemes for measurement-based quantum computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
- Quantum computation on the edge of a symmetry-protected topological order
- Identifying phases of quantum many-body systems that are universal for quantum computation
- Quantum computational capability of a 2D valence bond solid phase
- Hierarchy of universal entanglement in 2D measurement-based quantum computation
- Resource quality of a symmetry-protected topologically ordered phase for quantum computation
- Entanglement and nonclassical properties of hypergraph states
- Extreme violation of local realism in quantum hypergraph states
- Thermal States as Universal Resources for Quantum Computation with Always-on Interactions
- Quantum computation in correlation space and extremal entanglement
- Quantum de Finetti theorem under fully-one-way adaptive measurements
- Quantum proofs can be verified using only single qubit measurements
- Local unitary symmetries of hypergraph states
- Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
- Spin lattices with two-body Hamiltonians for which the ground state encodes a cluster state
- Quantum computation via measurements on the low-temperature state of a many-body system
- Locally inequivalent four qubit hypergraph states
Cited by in corpus (41)
- Verification of quantum computation: An overview of existing approaches
- Computational advantage of quantum random sampling
- Optimal verification of entangled states with local measurements
- Error protected qubits in a silicon photonic chip
- Efficient Verification of Pure Quantum States in the Adversarial Scenario
- Verification of Many-Qubit States
- General framework for verifying pure quantum states in the adversarial scenario
- Efficient Verification of Hypergraph States
- Nonstabilizerness determining the hardness of direct fidelity estimation
- Optimal Verification of Two-Qubit Pure States
- Statistical Methods for Quantum State Verification and Fidelity Estimation
- Resource-efficient verification of quantum computing using Serfling's bound
- Optimal verification of general bipartite pure states
- Efficient verification of Dicke states
- Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
- Towards the standardization of quantum state verification using optimal strategies
- Efficient verification of quantum processes
- Sample-efficient device-independent quantum state verification and certification
- Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
- Robust and efficient verification of graph states in blind measurement-based quantum computation
- Universally Optimal Verification of Entangled States with Nondemolition Measurements
- Efficient verification of continuous-variable quantum states and devices without assuming identical and independent operations
- Entanglement of random hypergraph states
- Efficient verification of entangled continuous-variable quantum states with local measurements
- Symmetric hypergraph states: Entanglement quantification and robust Bell nonlocality
- Divide-and-conquer verification method for noisy intermediate-scale quantum computation
- Fault-tolerant compiling of classically hard IQP circuits on hypercubes
- Entanglement Purification of Hypergraph States
- Efficient verification of arbitrary entangled states with homogeneous local measurements
- Learning Properties of Quantum States Without the I.I.D. Assumption
- Sumcheck-based delegation of quantum computing to rational server
- Computational self-testing for entangled magic states
- Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements
- Passive verification protocol for thermal graph states
- Parallel remote state preparation for fully device-independent verifiable blind quantum computation
- Blind quantum computing can always be made verifiable
- Experimental Verification of Entangled States in the Adversarial Scenario
- Sampling and the complexity of nature
- Prescriptive preparation and verification of nonstabilizer states
- Why cut-and-choose quantum state verification cannot be both efficient and secure
- Beating the Optimal Verification of Entangled States via Collective Strategies