Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quantum states. The crucial quantity is the minimum length of classical bit strings from which the original pure states are approximately reconstructible. We derive asymptotically tight bounds on the minimum bit length required for probabilistic encodings with which one can approximately reconstruct the original pure state as an ensemble of the quantum states encoded in classical strings. We also show that such a probabilistic encoding asymptotically halves the bit length required for "deterministic" ones. This is based on the fact that the accuracy of approximating pure states by using a given subset of pure states can be increased quadratically if we use ensembles of pure states in the subset. Moreover, we show that a similar fact holds when we consider the approximation of unitary gates by using a given subset of unitary gates. This improves the reduction rate of the circuit size by using probabilistic circuit synthesis compared to previous results. This also demonstrates that the reduction is possible even for low-accuracy circuit synthesis, which might improve the accuracy of various NISQ algorithms.
Consider a general quantum stochastic source that emits at discrete time steps quantum pure states which are chosen from a finite alphabet according to some probability distribution which may depend on the whole history. Also, fix two positive integers
m and
l. We encode any tensor product of
m many states emitted by the quantum stochastic source by breaking the tensor product into
m many blocks where each block has length
l, and considering sequences of
m many isometries so that each isometry encodes one of these blocks into the Fock space, followed by the concatenation of their images. We only consider certain sequences of such isometries that we call \lq\lq special block codes\rq\rq\ in order to ensure that the string of encoded states is uniquely decodable. We compute the minimum average codeword length of these encodings which depends on the quantum source and the integers
m,
l, among all possible special block codes. Our result extends the result of [Bellomo, Bosyk, Holik and Zozor, Scientific Reports 7.1 (2017): 14765] where the minimum was computed for one block, i.e.\ for
m=1. Lastly, we give a simplified non-adaptive compression technique based on constrained special block codes for general quantum stochastic sources. For quantum stationary sources in particular, we show that the minimum average codeword length per symbol computed over all constrained special block codes is equal to the von-Neumann entropy rate of the source for an asymptotically long block size.
Consider a general quantum stochastic source that emits at discrete time steps quantum pure states which are chosen from a finite alphabet according to some probability distribution which may depend on the whole history. Also, fix two positive integers
mand l. We encode any tensor product of ml many states emitted by the given quantum source by breaking it into
mmany blocks where each block has length l, and considering sequences of
mmany isometries so that each isometry encodes one of these blocks into the Fock space, followed by the concatenation of their images. We only consider certain sequences of such isometries that we call “special block codes” in order to ensure that the string of encoded states is uniquely decodable. We compute the minimum average codeword length of these encodings which depends on the quantum source and the integers m, l, among all possible special block codes. Our result extends the result of [Bellomo, Bosyk, Holik and Zozor, Scientific Reports 7.1 (2017): 14765] where the minimum was computed for one block, i.e. for m = 1.
Abstract When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the circuit is probabilistically sampled, is able to reduce the approximation error compared to conventional deterministic synthesis. In this paper, we demonstrate that the optimal probabilistic synthesis quadratically reduces the approximation error. Moreover, we show that a deterministic synthesis algorithm can be efficiently converted into a probabilistic one that achieves this quadratic error reduction. We also numerically demonstrate how this conversion reduces the T -count and analytically prove that this conversion halves an information-theoretic lower bound on the circuit size. In order to derive these results, we prove general theorems about the optimal convex approximation of a quantum state. Furthermore, we demonstrate that this theorem can be used to analyze an entanglement measure.
Perfect encryption of a qubit state using the Quantum One-Time Pad (QOTP) requires 2 classical key bits. More generally, perfect QOTP encryption of a
2n-dimensional state requires
2n classical bits. However, almost-perfect encryption, with information-theoretic security, can be achieved with only little more than
1 key bit per qubit. In this paper we slightly improve the key length. We show that key length
n+32logε1 suffices to encrypt
n qubits in such a way that the cipherstate has trace distance
≤ε from the fully mixed state. The previous best result was
n+2logε1. Similar to the previous literature, we expand the key to a
2n-bit pseudorandom string which is then used as a QOTP key. In this expansion we make use of
2n bits of public randomness which are included as a classical part of the cipherstate. Our key expansion is slightly faster than in previous works.