Verification of Many-Qubit States

Verification of Many-Qubit States

Blog Article

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 Part Diagram 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 5-Piece Sectional with Storage Consoles consider the verification of the quantum computational supremacy demonstration with IQP models, and verifiable blind quantum computing.