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:2610.06808

Quantum 1-PCA with Pauli Measurements in Nearly Linear Time

Dutch Hansen, Jerry Li

quant-phcs.DSSubmitted Oct 5, 2026• Announced Oct 6, 2026• 1 citation
arXivHTMLPDF

Abstract

We consider the problem of quantum 1-PCA: given copies of an unknown $n$-qubit mixed state, recover a classical description of its leading eigenvector. Our goal is to do so using non-adaptive and single-qubit measurements. For an $n$-qubit state with top eigenvalue $λ$ and spectral gap at least $Δ> 0$, we give an algorithm that recovers the leading eigenvector to fidelity at least $1 - \varepsilon$ with high probability using $\tilde{O}\left( {2^n \cdot η^2} / {Δ^3 \varepsilon^3}\right)$ copies and $\tilde{O}((2^n/Δ\varepsilon) \cdot \operatorname{poly}(η/Δ\varepsilon))$ time, where $η= \max (1 - λ, \varepsilon)$. All of our measurements are non-adaptively chosen, and performed in single-qubit Pauli bases. When the spectral gap is constant and the desired accuracy is comparable to the noise level, i.e. $\varepsilon = Ω(η)$, our runtime and copy complexity become $\tilde{O} (2^n / \varepsilon)$. This generalizes the guarantees of Grewal et al. [arXiv:2601.04444], who achieved similar rates, but under the assumption $η= 0$, i.e., that the state was pure. Our results show that the same rates hold in the presence of state misspecification, up to polylogarithmic factors. From a technical perspective, our algorithm works by recursively constructing low-dimensional subspaces that approximately preserve the target eigenvector. To achieve nearly linear runtime dependence on the dimension of the Hilbert space, we develop a novel structured Pauli sampling scheme that enables fast batched computation of exponentially many projected Pauli matrices.

AI Summary

The paper studies quantum 1-PCA: given copies of an unknown $n$-qubit mixed state $\rho$, output a classical description of its unique leading eigenvector with fidelity at least $1-\varepsilon$. It asks whether nearly linear dependence on Hilbert-space dimension is achievable using only non-adaptive, single-copy, single-qubit Pauli-basis measurements, without assuming that $\rho$ is pure. Writing $d=2^n$, $\lambda$ for the largest eigenvalue, $\Delta>0$ for the spectral gap, and $\eta=\max(1-\lambda,\varepsilon)$, the algorithm uses $\tilde O(d\eta^2/(\Delta^3\varepsilon^3))$ copies and $\tilde O((d/(\Delta\varepsilon))\operatorname{poly}(\eta/(\Delta\varepsilon)))$ time, with logarithmic dependence on inverse failure probability. For constant gap and $\varepsilon=\Omega(\eta)$, both bounds reduce to $\tilde O(d/\varepsilon)$, recovering the pure-state rate while allowing mixed-state noise. The reconstruction proceeds backwards through computational-basis prefixes, maintaining low-dimensional subspaces that approximately contain the corresponding pieces of the target eigenvector. Subspaces are merged and pruned using estimated compressed density matrices; perturbation inequalities control accumulated loss. A structured sampling scheme selects Pauli operators from random affine families defined by symmetric binary matrices. Walsh–Hadamard transforms then batch-compute projected Pauli matrices, avoiding quadratic-in-$d$ processing. Spectral clipping and Lepskii’s method provide operator-norm estimation guarantees. The optimal-rate regime requires constant spectral gap and target error comparable to or larger than the noise mass. Outside it, the guarantees deteriorate polynomially in inverse gap and noise-to-error ratio. The algorithm requires supplied bounds on the gap and impurity, though not exact knowledge of $\lambda$. Runtime remains exponential in qubit count; the results are theoretical.

No sign of AI-generated textAI use disclosed
Multiple technical steps and optimizations were derived in discussion with GPT-5.6 and GPT-6.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Nearly Time-Optimal Pure State Tomography with Pauli Measurements

Sabee Grewal, Meghal Gupta, William He +2 more

We give an algorithm for pure state tomography with near-optimal copy and time complexity using only single-qubit measurements. Specifically, given $\widetilde{O}(2^n/ε)$ copies of an unknown $n$-qubit pure state $|ψ\rangle$, the algorithm performs only nonadaptive Pauli measurements, runs in time $\widetilde{O}(2^n/ε)$, and outputs $|\widehatψ \rangle$ with fidelity at least $1-ε$ with $|ψ\rangle$ with high probability. This is the first algorithm for pure state tomography that achieves near-optimal running time.

quant-pharXiv:2601.04444•Jan 9, 2026•5 citations

An efficient Pauli decomposition algorithm for structured matrices

Daniel J. Spencer, Kishor Bharti, Alexey V. Gorshkov

Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only $k = \mathsf{poly}(n)$ Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in $n$. We present a randomized classical algorithm that does take advantage of this sparsity and recovers the exact Pauli decomposition with success probability at least $1 - δ$, for any $δ$. Under the stated access model, the algorithm executes with query and runtime complexity that is polynomial in $n$, $k$, and $\log(1/δ)$. These results show that, even though finding the Pauli decomposition is exponentially hard for general matrices, it becomes efficiently solvable for matrices that are known to be sparse in the Pauli basis, a regime that is relevant to near-term quantum algorithms operating on structured classical input.

quant-pharXiv:2606.31952•Jul 1, 2026•0 citations

Pauli Measurements Are Not Optimal for Single-Copy Tomography

Jayadev Acharya, Abhilash Dharmavarapu, Yuhan Liu +1 more

Quantum state tomography is a fundamental problem in quantum computing. Given n copies of an unknown N -qubit state ρ∈ℂ d × d , d =2 N , the goal is to learn the state up to an accuracy ε in trace distance, say with at least constant probability 0.99. We are interested in the copy complexity, the minimum number of copies of ρ needed to fulfill the task. As current quantum devices are physically limited, Pauli measurements have attracted significant attention due to their ease of implementation. However, a large gap exists in the literature for tomography with Pauli measurements. The best-known upper bound is O ( N · 12 N /ε 2 ), and no non-trivial lower bound is known besides the general single-copy lower bound of Ω(8 N /ε 2 ), achieved by hard-to-implement structured POVMs such as MUB, SIC-POVM, and uniform POVM. We have made significant progress on this long-standing problem. We first prove a stronger upper bound of O (10 N /ε 2 ). To complement it, we also obtain a lower bound of Ω(9.118 N /ε 2 ), which holds even with adaptivity. To our knowledge, this demonstrates the first known separation between Pauli measurements and structured POVMs. The new lower bound is a consequence of a novel framework for adaptive quantum state tomography with measurement constraints. The main advantage is that we can use measurement-dependent hard instances to prove tight lower bounds for Pauli measurements, while prior lower-bound techniques for tomography only work with measurement-independent constructions. Moreover, we connect the copy complexity lower bound of tomography to the eigenvalues of the measurement information channel, which governs the measurement’s capacity to distinguish between states. To demonstrate the generality of the new framework, we obtain tight bounds for adaptive quantum state tomography with k -outcome measurements, where we recover existing results and establish new ones.

arXiv:2502.18170•ACM Symposium on Theory of Computing (STOC)•Jun 15, 2025•8 citations

Quantum principal component analysis without eigenvector recovery

Yewei Yuan, Michele Minervini, Mark M. Wilde +1 more

Principal component analysis (PCA) is traditionally implemented through a covariance or kernel matrix, leading-eigenvector extraction, and hard rank-$k$ projection. These steps can be computationally costly in high-dimensional and quantum-data settings, sensitive to small eigengaps, and unnecessary when downstream tasks only require principal-subspace scores. Such score-based objectives are important in applications such as anomaly detection, spectral-energy profiling, and other postselection tasks. To address these needs, we introduce a measurement-based soft PCA framework replacing the hard top-$k$ projector with an entropy-regularized Fermi--Dirac filter. This filter is the unique optimizer of an entropy-regularized variational formulation of PCA and converges to the classical PCA projector in the zero-temperature limit. This filter has a direct interpretation as a quantum measurement, which naturally suggests a quantum approach. For centered covariance operators represented by quantum feature states, a single fixed circuit, together with threshold calibration, accesses all optimal filters for different rank budgets or retained-variance levels without rank-dependent circuit updates or eigenvector recovery. For new inputs, the same calibrated quantum circuit yields soft principal subspace scores, spectral energy profiles, and postselected filtered states. The required centering of both training and test data is performed coherently inside the quantum protocol, which is particularly important for quantum data where no classical feature vectors or centered Gram matrix are directly available. By reframing PCA as a calibrated measurement task, this framework bypasses the need for iterative eigenvector extraction and achieves a dimension-independent sample complexity $O(η^{-2})$ for normalized fractional-rank or retained variance scoring at additive accuracy $η$.

quant-pharXiv:2605.27942•May 28, 2026•2 citations

Improved Quantum Algorithms for Fidelity Estimation

András Gilyén, Alexander Poremba

Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one works with mixed states over Hilbert spaces of very high dimension. Although, there has been some progress on fidelity estimation, all prior work either requires a large number of identical copies of the relevant states, or relies on unproven heuristics. In this work, we improve on both of these aspects by developing new and efficient quantum algorithms for fidelity estimation with provable performance guarantees in case at least one of the states is approximately low-rank. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation, as well as density matrix exponentiation and quantum spectral sampling. As a complementary result, we prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general, by giving a sample complexity lower bound that depends polynomially on the dimension. Moreover, if circuit descriptions for the relevant states are provided, we show that the task is hard for the complexity class called (honest verifier) quantum statistical zero knowledge via a reduction to a closely related result by Watrous.

arXiv:2203.15993•Mar 30, 2022•75 citations

Learning sparse quantum states from single-qubit measurements

Su-un Lee, Liang Jiang, Kunal Sharma

We study the problem of learning a sparse quantum state, an $n$-qubit quantum state whose density matrix has at most $s$ nonzero matrix entries in an unknown product basis. While such states admit compact classical descriptions, they can carry long-range entanglement that prevents reconstruction from local reduced density matrices alone. Therefore, previous learning approaches addressed such long-range-entangled states using many entangling gates to extract the necessary information. In this work, we show that sparse states can nevertheless be efficiently learned using only single-qubit measurements. Specifically, when the sparsity $s$ is constant, our algorithm can learn sparse states from single-qubit measurements with polynomial sample complexity and classical computational complexity. When $s$ grows polynomially with $n$, sparse states can still be learned from single-qubit measurements with polynomial sample complexity, although efficient classical computation is not guaranteed in general. In this regime, however, the classical computational complexity becomes quasipolynomial when the state is sparse in an unknown basis that is a product of a known fixed finite set of single-qubit bases (e.g., eigenbases of Pauli operators). These results establish efficient learning of sparse states with long-range entanglement without entangling gates, and the single-qubit measurement requirements make our algorithms compatible with current quantum devices.

quant-pharXiv:2609.35648•Sep 29, 2026•0 citations
We consider the problem of quantum 1-PCA: given copies of an unknown nnn-qubit mixed state, recover a classical description of its leading eigenvector. Our goal is to do so using non-adaptive and single-qubit measurements. For an nnn-qubit state with top eigenvalue λλλ and spectral gap at least Δ>0Δ> 0Δ>0, we give an algorithm that recovers the leading eigenvector to fidelity at least 1−ε1 - \varepsilon1−ε with high probability using O~(2n⋅η2/Δ3ε3)\tilde{O}\left( {2^n \cdot η^2} / {Δ^3 \varepsilon^3}\right)O~(2n⋅η2/Δ3ε3) copies and O~((2n/Δε)⋅poly⁡(η/Δε))\tilde{O}((2^n/Δ\varepsilon) \cdot \operatorname{poly}(η/Δ\varepsilon))O~((2n/Δε)⋅poly(η/Δε)) time, where η=max⁡(1−λ,ε)η= \max (1 - λ, \varepsilon)η=max(1−λ,ε). All of our measurements are non-adaptively chosen, and performed in single-qubit Pauli bases. When the spectral gap is constant and the desired accuracy is comparable to the noise level, i.e. ε=Ω(η)\varepsilon = Ω(η)ε=Ω(η), our runtime and copy complexity become O~(2n/ε)\tilde{O} (2^n / \varepsilon)O~(2n/ε). This generalizes the guarantees of Grewal et al. [arXiv:2601.04444], who achieved similar rates, but under the assumption η=0η= 0η=0, i.e., that the state was pure. Our results show that the same rates hold in the presence of state misspecification, up to polylogarithmic factors. From a technical perspective, our algorithm works by recursively constructing low-dimensional subspaces that approximately preserve the target eigenvector. To achieve nearly linear runtime dependence on the dimension of the Hilbert space, we develop a novel structured Pauli sampling scheme that enables fast batched computation of exponentially many projected Pauli matrices.
The paper studies quantum 1-PCA: given copies of an unknown nnn-qubit mixed state ρ\rhoρ, output a classical description of its unique leading eigenvector with fidelity at least 1−ε1-\varepsilon1−ε. It asks whether nearly linear dependence on Hilbert-space dimension is achievable using only non-adaptive, single-copy, single-qubit Pauli-basis measurements, without assuming that ρ\rhoρ is pure.
Writing d=2nd=2^nd=2n, λ\lambdaλ for the largest eigenvalue, Δ>0\Delta>0Δ>0 for the spectral gap, and η=max⁡(1−λ,ε)\eta=\max(1-\lambda,\varepsilon)η=max(1−λ,ε), the algorithm uses O~(dη2/(Δ3ε3))\tilde O(d\eta^2/(\Delta^3\varepsilon^3))O~(dη2/(Δ3ε3)) copies and O~((d/(Δε))poly⁡(η/(Δε)))\tilde O((d/(\Delta\varepsilon))\operatorname{poly}(\eta/(\Delta\varepsilon)))O~((d/(Δε))poly(η/(Δε))) time, with logarithmic dependence on inverse failure probability. For constant gap and ε=Ω(η)\varepsilon=\Omega(\eta)ε=Ω(η), both bounds reduce to O~(d/ε)\tilde O(d/\varepsilon)O~(d/ε), recovering the pure-state rate while allowing mixed-state noise.
The reconstruction proceeds backwards through computational-basis prefixes, maintaining low-dimensional subspaces that approximately contain the corresponding pieces of the target eigenvector. Subspaces are merged and pruned using estimated compressed density matrices; perturbation inequalities control accumulated loss. A structured sampling scheme selects Pauli operators from random affine families defined by symmetric binary matrices. Walsh–Hadamard transforms then batch-compute projected Pauli matrices, avoiding quadratic-in-ddd processing. Spectral clipping and Lepskii’s method provide operator-norm estimation guarantees.
The optimal-rate regime requires constant spectral gap and target error comparable to or larger than the noise mass. Outside it, the guarantees deteriorate polynomially in inverse gap and noise-to-error ratio. The algorithm requires supplied bounds on the gap and impurity, though not exact knowledge of λ\lambdaλ. Runtime remains exponential in qubit count; the results are theoretical.
We give an algorithm for pure state tomography with near-optimal copy and time complexity using only single-qubit measurements. Specifically, given O~(2n/ε)\widetilde{O}(2^n/ε)O(2n/ε) copies of an unknown nnn-qubit pure state ∣ψ⟩|ψ\rangle∣ψ⟩, the algorithm performs only nonadaptive Pauli measurements, runs in time O~(2n/ε)\widetilde{O}(2^n/ε)O(2n/ε), and outputs ∣ψ^⟩|\widehatψ \rangle∣ψ​⟩ with fidelity at least 1−ε1-ε1−ε with ∣ψ⟩|ψ\rangle∣ψ⟩ with high probability. This is the first algorithm for pure state tomography that achieves near-optimal running time.
Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only k=poly(n)k = \mathsf{poly}(n)k=poly(n) Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in nnn. We present a randomized classical algorithm that does take advantage of this sparsity and recovers the exact Pauli decomposition with success probability at least 1−δ1 - δ1−δ, for any δδδ. Under the stated access model, the algorithm executes with query and runtime complexity that is polynomial in nnn, kkk, and log⁡(1/δ)\log(1/δ)log(1/δ). These results show that, even though finding the Pauli decomposition is exponentially hard for general matrices, it becomes efficiently solvable for matrices that are known to be sparse in the Pauli basis, a regime that is relevant to near-term quantum algorithms operating on structured classical input.
Quantum state tomography is a fundamental problem in quantum computing. Given n copies of an unknown N -qubit state ρ∈ℂ d × d , d =2 N , the goal is to learn the state up to an accuracy ε in trace distance, say with at least constant probability 0.99. We are interested in the copy complexity, the minimum number of copies of ρ needed to fulfill the task. As current quantum devices are physically limited, Pauli measurements have attracted significant attention due to their ease of implementation. However, a large gap exists in the literature for tomography with Pauli measurements. The best-known upper bound is O ( N · 12 N /ε 2 ), and no non-trivial lower bound is known besides the general single-copy lower bound of Ω(8 N /ε 2 ), achieved by hard-to-implement structured POVMs such as MUB, SIC-POVM, and uniform POVM. We have made significant progress on this long-standing problem. We first prove a stronger upper bound of O (10 N /ε 2 ). To complement it, we also obtain a lower bound of Ω(9.118 N /ε 2 ), which holds even with adaptivity. To our knowledge, this demonstrates the first known separation between Pauli measurements and structured POVMs. The new lower bound is a consequence of a novel framework for adaptive quantum state tomography with measurement constraints. The main advantage is that we can use measurement-dependent hard instances to prove tight lower bounds for Pauli measurements, while prior lower-bound techniques for tomography only work with measurement-independent constructions. Moreover, we connect the copy complexity lower bound of tomography to the eigenvalues of the measurement information channel, which governs the measurement’s capacity to distinguish between states. To demonstrate the generality of the new framework, we obtain tight bounds for adaptive quantum state tomography with k -outcome measurements, where we recover existing results and establish new ones.
Principal component analysis (PCA) is traditionally implemented through a covariance or kernel matrix, leading-eigenvector extraction, and hard rank-kkk projection. These steps can be computationally costly in high-dimensional and quantum-data settings, sensitive to small eigengaps, and unnecessary when downstream tasks only require principal-subspace scores. Such score-based objectives are important in applications such as anomaly detection, spectral-energy profiling, and other postselection tasks. To address these needs, we introduce a measurement-based soft PCA framework replacing the hard top-kkk projector with an entropy-regularized Fermi--Dirac filter. This filter is the unique optimizer of an entropy-regularized variational formulation of PCA and converges to the classical PCA projector in the zero-temperature limit. This filter has a direct interpretation as a quantum measurement, which naturally suggests a quantum approach. For centered covariance operators represented by quantum feature states, a single fixed circuit, together with threshold calibration, accesses all optimal filters for different rank budgets or retained-variance levels without rank-dependent circuit updates or eigenvector recovery. For new inputs, the same calibrated quantum circuit yields soft principal subspace scores, spectral energy profiles, and postselected filtered states. The required centering of both training and test data is performed coherently inside the quantum protocol, which is particularly important for quantum data where no classical feature vectors or centered Gram matrix are directly available. By reframing PCA as a calibrated measurement task, this framework bypasses the need for iterative eigenvector extraction and achieves a dimension-independent sample complexity O(η−2)O(η^{-2})O(η−2) for normalized fractional-rank or retained variance scoring at additive accuracy ηηη.
Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one works with mixed states over Hilbert spaces of very high dimension. Although, there has been some progress on fidelity estimation, all prior work either requires a large number of identical copies of the relevant states, or relies on unproven heuristics. In this work, we improve on both of these aspects by developing new and efficient quantum algorithms for fidelity estimation with provable performance guarantees in case at least one of the states is approximately low-rank. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation, as well as density matrix exponentiation and quantum spectral sampling. As a complementary result, we prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general, by giving a sample complexity lower bound that depends polynomially on the dimension. Moreover, if circuit descriptions for the relevant states are provided, we show that the task is hard for the complexity class called (honest verifier) quantum statistical zero knowledge via a reduction to a closely related result by Watrous.
We study the problem of learning a sparse quantum state, an nnn-qubit quantum state whose density matrix has at most sss nonzero matrix entries in an unknown product basis. While such states admit compact classical descriptions, they can carry long-range entanglement that prevents reconstruction from local reduced density matrices alone. Therefore, previous learning approaches addressed such long-range-entangled states using many entangling gates to extract the necessary information. In this work, we show that sparse states can nevertheless be efficiently learned using only single-qubit measurements. Specifically, when the sparsity sss is constant, our algorithm can learn sparse states from single-qubit measurements with polynomial sample complexity and classical computational complexity. When sss grows polynomially with nnn, sparse states can still be learned from single-qubit measurements with polynomial sample complexity, although efficient classical computation is not guaranteed in general. In this regime, however, the classical computational complexity becomes quasipolynomial when the state is sparse in an unknown basis that is a product of a known fixed finite set of single-qubit bases (e.g., eigenbases of Pauli operators). These results establish efficient learning of sparse states with long-range entanglement without entangling gates, and the single-qubit measurement requirements make our algorithms compatible with current quantum devices.