Unitary complexity in polynomial space
Proving quantum commitments exist unconditionally requires solving either the unitary synthesis problem or the BPP vs NEXP question, linking cryptographic assumptions to classical complexity open problems.
1 stories, newest first · one card per story
Proving quantum commitments exist unconditionally requires solving either the unitary synthesis problem or the BPP vs NEXP question, linking cryptographic assumptions to classical complexity open problems.
Today 1.6K readers · 2.4K views · 775 reads · all time 189K views