Deciding if a classical-quantum channel can exactly preserve a single bit is QCMA-complete, with optimal witnesses characterized as computational basis states (minimum) and |+>, |-> states (maximum).
Title resolution pending
1 Pith paper cite this work, alongside 99 external citations. Polarity classification is still indexing.
1
Pith paper citing it
99
external citations · OpenAlex
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete
Deciding if a classical-quantum channel can exactly preserve a single bit is QCMA-complete, with optimal witnesses characterized as computational basis states (minimum) and |+>, |-> states (maximum).