Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Halving the length of approximate classical representations of pure quantum states with probabilistic encoding

Seiseki Akibue, Go Kato, Seiichiro Tani

Published Nov 10, 2021• 0 citations
OpenAlex

Abstract

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 the quantum states encoded in classical strings. Our results imply that such a probabilistic encoding asymptotically halves the bit length required for ``deterministic ones.

Related papers

Quadratic improvement on accuracy of approximating pure quantum states and unitary gates by probabilistic implementation

Seiseki Akibue, Go Kato, Seiichiro Tani

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.

arXiv:2111.05531•Nov 10, 2021•5 citations

Optimal lower bound for lossless quantum block encoding

George Androulakis, Rabins Wosti

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.

arXiv:2305.18748•Quantum Information and Computation•Nov 1, 2024•0 citations

Optimal Lower Bound of the Average Indeterminate Length Lossless Quantum Block Encoding

George Androulakis, Rabins Wosti

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 ml many states emitted by the given quantum source by breaking it 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 “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.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•0 citations

Probabilistic state synthesis based on optimal convex approximation

Seiseki Akibue, Go Kato, Seiichiro Tani

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.

arXiv:2303.10860•npj Quantum Information•Jan 3, 2024•10 citations

Efficient state preparation for a register of quantum bits

Andrei N. Soklakov, Rüdiger Schack

We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of encoding a classical probability distribution in a quantum register.

arXiv:quant-ph/0408045•Physical Review A•Jan 9, 2006•125 citations

Approximate quantum encryption with even shorter keys

Temel, Mehmet, Boris Škorić

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 $2^n$-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+\frac23\log\frac1\varepsilon$ suffices to encrypt $n$ qubits in such a way that the cipherstate has trace distance $\leq\varepsilon$ from the fully mixed state. The previous best result was $n+2\log\frac1\varepsilon$. 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.

•Jan 1, 2022•1 citation
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 the quantum states encoded in classical strings. Our results imply that such a probabilistic encoding asymptotically halves the bit length required for ``deterministic ones.
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 mmm and lll. We encode any tensor product of mmm many states emitted by the quantum stochastic source by breaking the tensor product into mmm many blocks where each block has length lll, and considering sequences of mmm 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 mmm, lll, 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=1m=1m=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 integersmmmand l. We encode any tensor product of ml many states emitted by the given quantum source by breaking it intommmmany blocks where each block has length l, and considering sequences ofmmmmany 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 2n2^n2n-dimensional state requires 2n2n2n classical bits. However, almost-perfect encryption, with information-theoretic security, can be achieved with only little more than 111 key bit per qubit. In this paper we slightly improve the key length. We show that key length n+23log⁡1εn+\frac23\log\frac1\varepsilonn+32​logε1​ suffices to encrypt nnn qubits in such a way that the cipherstate has trace distance ≤ε\leq\varepsilon≤ε from the fully mixed state. The previous best result was n+2log⁡1εn+2\log\frac1\varepsilonn+2logε1​. Similar to the previous literature, we expand the key to a 2n2n2n-bit pseudorandom string which is then used as a QOTP key. In this expansion we make use of 2n2n2n bits of public randomness which are included as a classical part of the cipherstate. Our key expansion is slightly faster than in previous works.