Classical shadow tomography, harnessing randomized informationally complete (IC) measurements, provides an effective avenue for predicting many properties of unknown quantum states. In
n-qubit systems, projections onto
2n+1 mutually unbiased bases (MUBs) are widely recognized as minimal and optimal IC measurements for full-state tomography. Mutually unbiased base circuits, structured as $\text{\ensuremath{-}}\mathrm{CZ}\text{\ensuremath{-}}S\text{\ensuremath{-}}H\text{\ensuremath{-}}$, form the minimal subset of the whole ${2}^{{n}^{2}+2n}{\ensuremath{\prod}}_{j=1}^{n}({4}^{j}\ensuremath{-}1)$ Clifford circuit ensemble. Each of them can be generated by
n special MUB circuits. We study how to use MUB circuits as the ensemble in classical shadow tomography. For general observables, the variance to predict their expectation value is shown to be exponential to the number of qubits
n. However, for a special class referred to as appropriate MUB-average (AMA) observables, the variance decreases to
poly(n). Additionally, we find that through biased sampling of MUB circuits, the variance for non-AMA observables can again be reduced to
poly(n) with the MUB-sparse condition. The performance and complexity of using the MUB and Clifford circuits as the ensemble in the classical shadow tomography are compared.
Mutually unbiased bases (MUBs) are widely used in quantum information processing and play an important role in quantum cryptography, quantum state tomography and communications. It's difficult to construct MUBs and remains unknown whether complete MUBs exist for any non prime power. Therefore, researchers have proposed the solution to construct approximately mutually unbiased bases (AMUBs) by weakening the inner product conditions. This paper constructs q AMUBs of ℂq, (q+1) AMUBs of ℂq-1 and q AMUBs of ℂq-1 by using character sums over Galois rings and finite fields, where q is a power of a prime. The first construction of q AMUBs of ℂq is new which illustrates K AMUBs of ℂK can be achieved. The second and third constructions in this paper include the partial results about AMUBs constructed by W. Wang et al. in [9].
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. The following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases (MUBs), you may perform any measurement, but then store at mostqqubits of quantum information, and an unlimited amount of classical information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits, and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. However, we show how to construct three bases, such that you need to store all qubits in order to compute f(x) perfectly. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also give an example where the extra information does not give any advantage at all.