A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
hub Canonical reference
Nielsen and Isaac L
Canonical reference. 88% of citing Pith papers cite this work as background.
60
Pith papers citing it
5,696
external citations · Crossref
Background
88% of classified citations
hub tools
citation-role summary
background 14
method 2
citation-polarity summary
representative citing papers
Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.
A coherence law based on the readout-visible aligned coherence rate (a Rayleigh quotient of the noise generator) predicts gradient survival in noisy U(1)-equivariant QNNs, with simulations confirming R²=0.979 and a special channel test showing no loss where predicted.
Sample complexity for fidelity estimation to a rank-r reference state is O(r²/ε²) with lower bound Ω(r/ε²); O(r²/ε⁴) when unknown state also has rank ≤r.
Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
Defines the first stochastic semantics for TAPNs and implements SMC algorithms in TAPAAL, with a proof of well-behaved semantics and case-study demonstrations.
A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
Zero-noise extrapolation has a finite-shot help-harm boundary below which it increases local mean-squared error due to variance penalties outweighing bias reduction.
StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
A resource theory for strong symmetry breaking is formulated, with the variance of the conserved quantity characterizing its asymptotic manipulation for U(1) symmetry and enabling tracking of weak-to-strong conversion in open systems.
Introduces a localization probability lambda for quantum states in subspaces that is stricter than standard overlap Tr(P rho), derived from Schur complement operator decomposition and possessing concavity and super-additivity.
A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
Hermitian forms on Hilbert spaces arise from the monoid structure of complex conjugation in Z/2-equivariant real linear types within LHoTT, requiring only a negative unit term.
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer benchmarks.
Two approaches (PTM singular vector optimization and sequential basis matching) allow BB84 and six-state QKD to achieve equivalent key rates over unital channels without a shared reference frame by absorbing frame misalignment into the channel.
QnRL is a distributional quantum RL framework that distills conditional action policies from moments of quantum generative models in Hilbert space via the QuAK algorithm, reporting higher scores and fewer parameters than baselines.
Quantum compressed sensing reformulates image classification as a single-photon projective measurement, achieving 69% accuracy with one detection event and 95% with four.
CCV-QAOA is a new complex-valued continuous-variable variant of QAOA that solves real and complex multivariate optimization problems via a variational framework.
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
New techniques for error-independent unified path variation, non-degenerate batched sampling, and flexible contraction accelerate tensor network quantum trajectory simulations by more than 10^8 times.
Lattice QED is established as a quantum error-correcting code beyond stabilizers, with explicit recovery operations constructed via quantum reference frames for gauge and fermionic sectors.
Non-density of integral points in semigroup orbits implies sparsity of multiplicative dependence in higher dimensions, generalizing Northcott-Siegel theorems and following from Vojta's conjecture.
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
citing papers explorer
-
The finite-shot help-harm boundary of zero-noise extrapolation
Zero-noise extrapolation has a finite-shot help-harm boundary below which it increases local mean-squared error due to variance penalties outweighing bias reduction.
-
Accessible Quantum Correlations Under Complexity Constraints
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.