Graph Non-Isomorphism Has a Succinct Quantum Certificate
نویسندگان
چکیده
This paper presents the first quantum computational characterization of the Graph Non-Isomorphism problem (GNI). We show that GNI is in a quantum non-deterministic polynomial-time class, i.e., quantum Merlin-Arthur game class (QMA) or quantum probabilistic NP (BQNP). In other words, given two graphs (G0, G1) ∈ GNI, (G0, G1) has a polynomial-size quantum certificate with which (G0, G1) ∈ GNI can be convinced by a polynomial-time (probabilistic) quantum Turing machine.
منابع مشابه
Isomorphism Checking in GROOVE
In this paper we show how isomorphism checking can be used as an effective technique for symmetry reduction in graph-based state spaces, despite the inherent complexity of the isomorphism problem. In particular, we show how one can use element-based graph certificate mappings to help in recognising nonisomorphic graphs. These are mappings that assign to all elements (edges and nodes) of a given...
متن کاملThe sum-annihilating essential ideal graph of a commutative ring
Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$is called an annihilating ideal if there exists $rin Rsetminus {0}$ such that $Ir=(0)$ and an ideal $I$ of$R$ is called an essential ideal if $I$ has non-zero intersectionwith every other non-zero ideal of $R$. Thesum-annihilating essential ideal graph of $R$, denoted by $mathcal{AE}_R$, isa graph whose vertex set is the set...
متن کاملA Survey of the Complexity of Succinctly Encoded Problems
Succinctness is one of the few ways that we have to get a handle on the complexity of large classes such as NEXP and EXPSPACE. The study of succinctly encoded problems was started by Galperin and Wigderson [3], who showed that many simple graph properties such as connectedness are NP-complete when the graph is represented by a succinct circuit. Papadimitriou and Yannakakis [4], building upon th...
متن کاملPhysically-motivated dynamical algorithms for the graph isomorphism problem
Submitted for the MAR05 Meeting of The American Physical Society Physically-motivated dynamical algorithms for the graph isomorphism problem SHIUEYUAN SHIAU, ROBERT JOYNT, S.N. COPPERSMITH, Physics Dept., Univ. of Wisconsin-Madison — The graph isomorphism problem (GI) plays a central role in the theory of computational complexity and has importance in physics and chemistry as well. No polynomia...
متن کاملSuccinct quantum proofs for properties of finite groups
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-type proof. Specifically, we consider quantum proofs for properties of black-box groups, which are finite groups whose elements are encoded as strings of a given length and whose group operations are perf...
متن کامل