Self-Testing Graph States
From MaRDI portal
Abstract: We give a construction for a self-test for any connected graph state. In other words, for each connected graph state we give a set of non-local correlations that can only be achieved (quantumly) by that particular graph state and certain local measurements. The number of correlations considered is small, being linear in the number of vertices in the graph. We also prove robustness for the test.
Recommendations
- A graph-theoretical characterisation of state separation
- Testing of graph properties
- Graph states in phase space
- Self-testing of Quantum Circuits
- Testing equivalence of pure quantum states and graph states under SLOCC
- Parallel self-testing of the GHZ state with a proof by diagrams
- Quantum property testing for bounded-degree graphs
- Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
- Non-deterministic graph property testing
- A graph theoretical approach to states and unitary operations
Cites work
Cited in
(10)- Quantum verifiable protocol for secure modulo zero-sum randomness
- Parallel self-testing of the GHZ state with a proof by diagrams
- Robust self-testing of the singlet
- Maximally nonlocal subspaces
- Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
- Self-testing in parallel
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
- Scalable Bell inequalities for graph states of arbitrary prime local dimension and self-testing
- Constant-sized robust self-tests for states and measurements of unbounded dimension
- An operator-algebraic formulation of self-testing
This page was built for publication: Self-Testing Graph States
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453314)
