1 citations · 1 across the 6 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.CC2026
Separating ClonableQMA and QCMA Relative to a Classical Oracle
Alper Cakan, Kai-Min Chung, Wei-Hsiang Hung +1
Since the introduction of the complexity class QMA as a quantum-verifier analogue of NP (Kitaev, 1997), many have wondered whether quantum proofs are necessary or classical proofs…
cs.CC2026
Separating QMA from QCIP with a Classical Oracle, or, the Power of Quantum Proofs over Classical Interaction for Quantum Verifiers
Alper Cakan
Whether some problems require quantum proofs has been a central question in quantum complexity (Aharonov and Naveh, 2002; Aaronson and Kuperberg, CCC 2007). Recently, breakthrough…
quant-ph2026
Decisional Monogamy-of-Entanglement for Coset States and Applications to Unclonable Cryptography with Correlated Challenges
Amit Behera, Alper Cakan, Alper Çakan +1
A main application of quantum information in cryptography is copy-protection, where we encode a functionality (such as a decryption key or software) into a reusable quantum state s…