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

arXiv:1801.05721 · Leibniz international proceedings in informatics

A Compressed Classical Description of Quantum States

David Gosset, John A. Smolin

Published Jan 17, 2018• 19 citations
arXivHTMLPDF

Abstract

We show how to approximately represent a quantum state using the square root of the usual amount of classical memory. The classical representation of an $n$-qubit state $ψ$ consists of its inner products with $O(\sqrt{2^n})$ stabilizer states. A quantum state initially specified by its $2^n$ entries in the computational basis can be compressed to this form in time $O(2^n \mathrm{poly}(n))$, and, subsequently, the compressed description can be used to additively approximate the expectation value of an arbitrary observable. Our compression scheme directly gives a new protocol for the vector in subspace problem with randomized one-way communication complexity that matches (up to polylogarithmic factors) the optimal upper bound, due to Raz. We obtain an exponential improvement over Raz's protocol in terms of computational efficiency.

DOI
10.4230/lipics.tqc.2019.8

Related papers

Lower Bounds on Relative Error Quantum Compression and Classical Shadows

Sankar, Kaushik

We study the question of how much classical communication is needed when Alice is given a classical description of a quantum state $|ψ\rangle$ for Bob to recover any expectation value $\langle ψ| M |ψ\rangle$ given an observable $M$ with $M$ Hermitian and $||M||_{\text{op}} \leq 1$. This task, whose study was initiated by Raz (ACM 1999) and more recently investigated by Gosset and Smolin (TQC 2019), can be thought of as a fully classical version of the pure state case of the well-known classical shadows problem in quantum learning theory. We show how the hardness of these two seemingly distinct problems are connected. We first consider the relative error version of the communication question and prove a lower bound of $Ω(\sqrt{2^{n}}ε^{-2})$ on the one-way randomized classical communication, improving upon an additive error lower bound of $Ω(\sqrt{2^{n}})$ as shown by Gosset and Smolin. Notably, we show that this lower bound holds not only for the set of all observables but also when restricted to just the class of Pauli observables. This fact implies a $Ω(\sqrt{2^{n}})$ versus $O(\text{poly}(n))$ separation in the compression size between the relative and additive error settings for non-adaptive Pauli classical shadows with classical memory. Extending this framework, we prove randomized communication lower bounds for other relative error one-way classical communication tasks: an $Ω(2^{n}ε^{-2})$ lower bound when instead Alice is given an observable and Bob is given a quantum state and they are asked to estimate the expectation value, an $Ω(\sqrt{n}ε^{-2})$ lower bound when restricted to Paulis, and an $Ω(\sqrt{2^{n}}ε^{-2})$ lower bound when Alice and Bob are both given quantum states and asked to estimate the inner product.

arXiv:2506.21345•Jun 26, 2025•1 citation

Multiple-basis representation of quantum states

Adrián Pérez-Salinas, Patrick Emonts, Jordi Tura +1 more

Classical simulation of quantum physics is a central approach to investigating physical phenomena. Quantum computers enhance computational capabilities beyond those of classical resources, but it remains unclear to what extent existing limited quantum computers can contribute to this enhancement. In this work, we explore a new hybrid, efficient quantum-classical representation of quantum states, the multiple-basis representation. This representation consists of a linear combination of states that are sparse in some given and different bases, specified by quantum circuits. Such representation is particularly appealing when considering depth-limited quantum circuits within reach of current hardware. We analyze the expressivity of multiple-basis representation states depending on the classical simulability of their quantum circuits. In particular, we show that multiple-basis representation states include, but are not restricted to, both matrix-product states and stabilizer states. Furthermore, we find cases in which this representation can be used, namely approximation of ground states, simulation of deeper computations by specifying bases with shallow circuits, and a tomographical protocol to describe states as multiple-basis representations. We envision this work to open the path of simultaneous use of several hardware-friendly bases, a natural description of hybrid computational methods accessible for near-term hardware.

arXiv:2411.03110•Nov 5, 2024•1 citation

Tight Bounds on the Randomized Communication Complexity of Vector-in-Subspace

Chengu Wang

We prove that the randomized communication complexity of Vector-in-Subspace in $\mathbb R^n$ with error at most $1/3$ is $Θ(\sqrt n)$. Alice holds a unit vector $u$ and Bob holds an $n/2$-dimensional subspace $H$; they must distinguish $u\in H$ from $u\in H^\perp$. An exact one-way quantum protocol uses $O(\log n)$ qubits, making the problem a geometric example of an exponential quantum advantage over interactive classical communication. Our lower bound matches Raz's $O(\sqrt n)$ upper bound, improves the $Ω(n^{1/3})$ lower bound of Klartag and Regev, and removes the total-rank restriction in Grupel's $Ω(\sqrt n)$ result. The proof establishes a Gaussian moment bound over complete rectangle partitions. A complex Gaussian representation yields a vanishing even moment whose cancellation is preserved when averaging over the partition. We control the signed conditional moments around a real center by decomposing conditional Gaussian measures into fixed coordinates and sub-Gaussian components. Combining this estimate with spherical harmonic analysis gives the communication lower bound.

cs.CCCross-listedarXiv:2610.30052•Oct 22, 2026•0 citations

An approximate description of quantum states

Marco Paini, Amir Kalev

We introduce an approximate description of an $N$-qubit state, which contains sufficient information to estimate the expectation value of any observable with precision independent of $N$. We show, in fact, that the error in the estimation of the observables' expectation values decreases as the inverse of the square root of the number of the system's identical preparations and increases, at most, linearly in a suitably defined, $N$-independent, seminorm of the observables. Building the approximate description of the $N$-qubit state only requires repetitions of single-qubit rotations followed by single-qubit measurements and can be considered for implementation on today's Noisy Intermediate-Scale Quantum (NISQ) computers. The access to the expectation values of all observables for a given state leads to an efficient variational method for the determination of the minimum eigenvalue of an observable. The method represents one example of the practical significance of the approximate description of the $N$-qubit state. We conclude by briefly discussing extensions to generative modelling and with fermionic operators.

arXiv:1910.10543•Oct 23, 2019•73 citations

Learning Arbitrary Lindbladians from Time Evolution

Zhili Chen, Zhan Yu

We study the problem of learning arbitrary $n$-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an $n$-qubit Lindbladian of dynamical strength at most $Λ$, the algorithm estimates every coefficient to error $\varepsilon$ using $\widetilde O(Λ^2/\varepsilon^2)$ experiments and $\widetilde O(Λ/\varepsilon^2)$ total evolution time, with classical running time polynomial in $n$ and $Λ/\varepsilon$. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution. For constant $k$, our algorithm learns generic $k$-local Lindbladians of local dynamical strength at most $Λ_{\mathrm{loc}}$ using $\widetilde O(n^2Λ_{\mathrm{loc}}^2/\varepsilon^2)$ experiments and $\widetilde O(nΛ_{\mathrm{loc}}/\varepsilon^2)$ total evolution time, improving the upper bounds of prior works in terms of the dependence on $n$. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of $3$-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed $k \geq 3$.

quant-pharXiv:2607.28610•Jul 31, 2026•5 citations

Estimating expectation values using approximate quantum states

Marco Paini, Amir Kalev, Dan Padilha +1 more

We introduce an approximate description of an N -qubit state, which contains sufficient information to estimate the expectation value of any observable to a precision that is upper bounded by the ratio of a suitably-defined seminorm of the observable to the square root of the number of the system's identical preparations M , with no explicit dependence on N . We describe an operational procedure for constructing the approximate description of the state that requires, besides the quantum state preparation, only single-qubit rotations followed by single-qubit measurements. We show that following this procedure, the cardinality of the resulting description of the state grows as 3MN . We test the proposed method on Rigetti's quantum processor unit with 12, 16 and 25 qubits for random states and random observables, and find an excellent agreement with the theory, despite experimental errors.

arXiv:2011.04754•Quantum•Mar 16, 2021•30 citations
We show how to approximately represent a quantum state using the square root of the usual amount of classical memory. The classical representation of an nnn-qubit state ψψψ consists of its inner products with O(2n)O(\sqrt{2^n})O(2n​) stabilizer states. A quantum state initially specified by its 2n2^n2n entries in the computational basis can be compressed to this form in time O(2npoly(n))O(2^n \mathrm{poly}(n))O(2npoly(n)), and, subsequently, the compressed description can be used to additively approximate the expectation value of an arbitrary observable. Our compression scheme directly gives a new protocol for the vector in subspace problem with randomized one-way communication complexity that matches (up to polylogarithmic factors) the optimal upper bound, due to Raz. We obtain an exponential improvement over Raz's protocol in terms of computational efficiency.
We study the question of how much classical communication is needed when Alice is given a classical description of a quantum state ∣ψ⟩|ψ\rangle∣ψ⟩ for Bob to recover any expectation value ⟨ψ∣M∣ψ⟩\langle ψ| M |ψ\rangle⟨ψ∣M∣ψ⟩ given an observable MMM with MMM Hermitian and ∣∣M∣∣op≤1||M||_{\text{op}} \leq 1∣∣M∣∣op​≤1. This task, whose study was initiated by Raz (ACM 1999) and more recently investigated by Gosset and Smolin (TQC 2019), can be thought of as a fully classical version of the pure state case of the well-known classical shadows problem in quantum learning theory. We show how the hardness of these two seemingly distinct problems are connected. We first consider the relative error version of the communication question and prove a lower bound of Ω(2nε−2)Ω(\sqrt{2^{n}}ε^{-2})Ω(2n​ε−2) on the one-way randomized classical communication, improving upon an additive error lower bound of Ω(2n)Ω(\sqrt{2^{n}})Ω(2n​) as shown by Gosset and Smolin. Notably, we show that this lower bound holds not only for the set of all observables but also when restricted to just the class of Pauli observables. This fact implies a Ω(2n)Ω(\sqrt{2^{n}})Ω(2n​) versus O(poly(n))O(\text{poly}(n))O(poly(n)) separation in the compression size between the relative and additive error settings for non-adaptive Pauli classical shadows with classical memory. Extending this framework, we prove randomized communication lower bounds for other relative error one-way classical communication tasks: an Ω(2nε−2)Ω(2^{n}ε^{-2})Ω(2nε−2) lower bound when instead Alice is given an observable and Bob is given a quantum state and they are asked to estimate the expectation value, an Ω(nε−2)Ω(\sqrt{n}ε^{-2})Ω(n​ε−2) lower bound when restricted to Paulis, and an Ω(2nε−2)Ω(\sqrt{2^{n}}ε^{-2})Ω(2n​ε−2) lower bound when Alice and Bob are both given quantum states and asked to estimate the inner product.
Classical simulation of quantum physics is a central approach to investigating physical phenomena. Quantum computers enhance computational capabilities beyond those of classical resources, but it remains unclear to what extent existing limited quantum computers can contribute to this enhancement. In this work, we explore a new hybrid, efficient quantum-classical representation of quantum states, the multiple-basis representation. This representation consists of a linear combination of states that are sparse in some given and different bases, specified by quantum circuits. Such representation is particularly appealing when considering depth-limited quantum circuits within reach of current hardware. We analyze the expressivity of multiple-basis representation states depending on the classical simulability of their quantum circuits. In particular, we show that multiple-basis representation states include, but are not restricted to, both matrix-product states and stabilizer states. Furthermore, we find cases in which this representation can be used, namely approximation of ground states, simulation of deeper computations by specifying bases with shallow circuits, and a tomographical protocol to describe states as multiple-basis representations. We envision this work to open the path of simultaneous use of several hardware-friendly bases, a natural description of hybrid computational methods accessible for near-term hardware.
We prove that the randomized communication complexity of Vector-in-Subspace in Rn\mathbb R^nRn with error at most 1/31/31/3 is Θ(n)Θ(\sqrt n)Θ(n​). Alice holds a unit vector uuu and Bob holds an n/2n/2n/2-dimensional subspace HHH; they must distinguish u∈Hu\in Hu∈H from u∈H⊥u\in H^\perpu∈H⊥. An exact one-way quantum protocol uses O(log⁡n)O(\log n)O(logn) qubits, making the problem a geometric example of an exponential quantum advantage over interactive classical communication. Our lower bound matches Raz's O(n)O(\sqrt n)O(n​) upper bound, improves the Ω(n1/3)Ω(n^{1/3})Ω(n1/3) lower bound of Klartag and Regev, and removes the total-rank restriction in Grupel's Ω(n)Ω(\sqrt n)Ω(n​) result. The proof establishes a Gaussian moment bound over complete rectangle partitions. A complex Gaussian representation yields a vanishing even moment whose cancellation is preserved when averaging over the partition. We control the signed conditional moments around a real center by decomposing conditional Gaussian measures into fixed coordinates and sub-Gaussian components. Combining this estimate with spherical harmonic analysis gives the communication lower bound.
We introduce an approximate description of an NNN-qubit state, which contains sufficient information to estimate the expectation value of any observable with precision independent of NNN. We show, in fact, that the error in the estimation of the observables' expectation values decreases as the inverse of the square root of the number of the system's identical preparations and increases, at most, linearly in a suitably defined, NNN-independent, seminorm of the observables. Building the approximate description of the NNN-qubit state only requires repetitions of single-qubit rotations followed by single-qubit measurements and can be considered for implementation on today's Noisy Intermediate-Scale Quantum (NISQ) computers. The access to the expectation values of all observables for a given state leads to an efficient variational method for the determination of the minimum eigenvalue of an observable. The method represents one example of the practical significance of the approximate description of the NNN-qubit state. We conclude by briefly discussing extensions to generative modelling and with fermionic operators.
We study the problem of learning arbitrary nnn-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an nnn-qubit Lindbladian of dynamical strength at most ΛΛΛ, the algorithm estimates every coefficient to error ε\varepsilonε using O~(Λ2/ε2)\widetilde O(Λ^2/\varepsilon^2)O(Λ2/ε2) experiments and O~(Λ/ε2)\widetilde O(Λ/\varepsilon^2)O(Λ/ε2) total evolution time, with classical running time polynomial in nnn and Λ/εΛ/\varepsilonΛ/ε. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution. For constant kkk, our algorithm learns generic kkk-local Lindbladians of local dynamical strength at most ΛlocΛ_{\mathrm{loc}}Λloc​ using O~(n2Λloc2/ε2)\widetilde O(n^2Λ_{\mathrm{loc}}^2/\varepsilon^2)O(n2Λloc2​/ε2) experiments and O~(nΛloc/ε2)\widetilde O(nΛ_{\mathrm{loc}}/\varepsilon^2)O(nΛloc​/ε2) total evolution time, improving the upper bounds of prior works in terms of the dependence on nnn. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 333-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed k≥3k \geq 3k≥3.
We introduce an approximate description of an N -qubit state, which contains sufficient information to estimate the expectation value of any observable to a precision that is upper bounded by the ratio of a suitably-defined seminorm of the observable to the square root of the number of the system's identical preparations M , with no explicit dependence on N . We describe an operational procedure for constructing the approximate description of the state that requires, besides the quantum state preparation, only single-qubit rotations followed by single-qubit measurements. We show that following this procedure, the cardinality of the resulting description of the state grows as 3MN . We test the proposed method on Rigetti's quantum processor unit with 12, 16 and 25 qubits for random states and random observables, and find an excellent agreement with the theory, despite experimental errors.