Verification of Many-Qubit States

Abstract

Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli operators. First, we introduce a protocol for verifying ground states of Hamiltonians. We next explain how to verify quantum states generated by a certain class of quantum circuits. We finally propose an adaptive test of stabilizers that enables the verification of all polynomial-time-generated hypergraph states, which include output states of the Bremner-Montanaro-Shepherd-type instantaneous quantum polynomial time (IQP) circuits. Importantly, we do not make any assumption that the identically and independently distributed copies of the same states are given: Our protocols work even if some highly complicated entanglement is created among copies in any artificial way. As applications, we consider the verification of the quantum computational supremacy demonstration with IQP models, and verifiable blind quantum computing.

15 pages, 3 figures, published version

References in corpus (56)

• Fault-tolerant quantum computation by anyons
• Good Quantum Error-Correcting Codes Exist
• On the Measurement of Qubits
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Multiple Particle Interference and Quantum Error Correction
• Characterizing Quantum Supremacy in Near-Term Devices
• Quantum state tomography via compressed sensing
• On the Power of One Bit of Quantum Information
• Topological fault-tolerance in cluster state quantum computation
• Instantaneous non-local computation of low T-depth quantum circuits
• The Heisenberg Representation of Quantum Computers
• Direct Fidelity Estimation from Few Pauli Measurements
• Quantum advantage with shallow circuits
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Average-case complexity versus approximate simulation of commuting quantum computations
• Unconditionally verifiable blind computation
• Novel schemes for measurement-based quantum computation
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Blind quantum computation protocol in which Alice only makes measurements
• Quantum Hypergraph States
• Instantaneous Quantum Computation
• Affleck-Kennedy-Lieb-Tasaki State on a Honeycomb Lattice is a Universal Quantum Computational Resource
• Symmetry-protected phases for measurement-based quantum computation
• 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
• Reliable quantum certification for photonic quantum technologies
• Quantum computational capability of a 2D valence bond solid phase
• On the hardness of classically simulating the one clean qubit model
• Architectures for quantum simulation showing a quantum speedup
• Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
• Hierarchy of universal entanglement in 2D measurement-based quantum computation
• Universal quantum computer from a quantum magnet
• Resource quality of a symmetry-protected topologically ordered phase for quantum computation
• Direct certification of a class of quantum simulations
• Verified measurement-based quantum computing with hypergraph states
• Verifiable fault-tolerance in measurement-based quantum computation
• Fidelity witnesses for fermionic quantum simulations
• Hardness of classically sampling one clean qubit model with constant total variation distance error
• Measurement-based quantum computation in a 2D phase of matter
• 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
• Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-3/2 particles
• Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
• Power of Quantum Computation with Few Clean Qubits
• Measurement-Based Quantum Computation on Symmetry Breaking Thermal States
• The complexity of simulating constant-depth BosonSampling
• Noise Threshold of Quantum Supremacy
• 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
• Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)
• Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation
• Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
• Quantum Merlin-Arthur with noisy channel

Cited by in corpus (60)

• Computational advantage of quantum random sampling
• Theory of quantum system certification: a tutorial
• Efficient Verification of Pure Quantum States in the Adversarial Scenario
• Vulnerability of quantum classification to adversarial perturbations
• Efficient Verification of Hypergraph States
• General framework for verifying pure quantum states in the adversarial scenario
• Nonstabilizerness determining the hardness of direct fidelity estimation
• Optimal Verification of Two-Qubit Pure States
• Statistical Methods for Quantum State Verification and Fidelity Estimation
• Optimal verification of general bipartite pure states
• Efficient verification of bipartite pure states
• Efficient verification of Dicke states
• Sample complexity of device-independently certified "quantum supremacy"
• Optimal Verification of Greenberger-Horne-Zeilinger States
• Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
• Efficient verification of Boson Sampling
• Towards the standardization of quantum state verification using optimal strategies
• Efficient verification of quantum processes
• Sample-efficient device-independent quantum state verification and certification
• Verifying commuting quantum computations via fidelity estimation of weighted graph states
• Quantum verification and estimation with few copies
• Universally Optimal Verification of Entangled States with Nondemolition Measurements
• Efficient verification of continuous-variable quantum states and devices without assuming identical and independent operations
• Verification of graph states in an untrusted network
• Self-testing and certification using trusted quantum inputs
• Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
• Client-friendly continuous-variable blind and verifiable quantum computing
• Quantum Metrology with Delegated Tasks
• Efficient Verification of Ground States of Frustration-Free Hamiltonians
• Efficient verification of entangled continuous-variable quantum states with local measurements
• Efficient verification of bosonic quantum channels via benchmarking
• Authenticated teleportation and verification in a noisy network
• Theory of versatile fidelity estimation with confidence
• Divide-and-conquer verification method for noisy intermediate-scale quantum computation
• Robust quantum metrology with explicit symmetric states
• In situ characterization of linear-optical networks in randomized boson sampling
• Experimental optimal verification of three-dimensional entanglement on a silicon chip
• Approximate inverse measurement channel for shallow shadows
• Computational self-testing for entangled magic states
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm
• Catalytic Transformation from Computationally Universal to Strictly Universal Measurement-Based Quantum Computation
• Sumcheck-based delegation of quantum computing to rational server
• Public verifiable measurement-only blind quantum computation based on entanglement witnesses
• Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements
• Analogue Quantum Simulation: A Philosophical Prospectus
• Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center
• Worst-case Quantum Hypothesis Testing with Separable Measurements
• Tight concentration inequalities for quantum adversarial setups exploiting permutation symmetry
• Passive verification protocol for thermal graph states
• Continuous Variable Quantum Advantages and Applications in Quantum Optics
• Experimental Verification of Entangled States in the Adversarial Scenario
• Sampling and the complexity of nature
• Coarse-grained self-testing
• Hardness of efficiently generating ground states in postselected quantum computation
• Greenberger-Horne-Zeilinger States: Their Identifications and Robust Violations
• Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases
• Beating the Optimal Verification of Entangled States via Collective Strategies
• Phase Transitions and Noise Robustness of Quantum Graph States
• Prescriptive preparation and verification of nonstabilizer states
• Why cut-and-choose quantum state verification cannot be both efficient and secure