On deciding whether a Boolean function is constant or not

Deciding whether a quantum state has secret correlations is an NP-complete problem

From the NP-hardness of the quantum separability problem and the relation between bipartite entanglement and the secret key correlations, it is shown that the problem deciding whether a given quantum state has secret correlations in it or not is in NP-complete.

Quantum tests for the linearity and permutation invariance of Boolean functions

The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is epsilon-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require O(epsilon^{-2/3}) calls to the oracle, which is be…

判定C-Q信道是否保持一个比特是QCMA完全的

Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete

本文证明判定C-Q信道能否精确保持单个经典比特是QCMA完全的，通过矩阵分析刻画最优见证，为比特保持及正交性约束优化问题提供了简明的QCMA完全性证明。

Improved quantum test for linearity of a Boolean function

Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $ε$-far from having that property. The efficiency of the algorithm is judged by the number of calls to the oracle so that one can decide, with high probability, between these two alternatives. The best known quantum algorithm for testing whether a function is linear or $ε$-far $(0 < ε< \frac{1}{2})$ from linear functions requires $O(ε^{-\frac{2}{3}})$ many calls [Hillery and Andersson, Physical Review A 84, 062329 (2011)]. We show that this can be im…

The pitfalls of deciding whether a quantum channel is (conjugate) degradable and how to avoid them

To decide whether a quantum channel is degradable is relatively easy: one has to find at least one example of a degrading quantum channel. But in general, no conclusive criterion exists to show the opposite. Using elementary methods we derive a necessary and sufficient condition to decide under what circumstances the conclusion is unambiguous. The findings lead to an extension of the antidegradability region for qubit and qutrit transpose depolarizing channels. In the qubit case we reproduce the known results for the class of qubit depolarizing channels (due to their equivalence). One of the c…

A Quantum Algorithm for Testing Junta Variables and Learning Boolean Functions via Entanglement Measure

Given a black-box representing an unknown Boolean function $f$ of $n$ variables, in this paper we propose a fast quantum algorithm to test whether or not a certain variable in the function $f$ is a junta variable. The proposed algorithm creates entanglement between the variable under test and an auxiliary qubit, where the entanglement is measured using concurrence measure to decide if the variable is junta. The paper shows applications to the proposed algorithm in learning and categorization of Boolean functions.