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.
hub Canonical reference
Nielsen and Isaac L
Canonical reference. 87% of citing Pith papers cite this work as background.
38
Pith papers citing it
5,653
external citations · Crossref
Background
87% of classified citations
hub tools
citation-role summary
background 13
method 2
citation-polarity summary
representative citing papers
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.
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.
Presents a tensor-parallel distributed MPS method with block-cyclic partitioning and pivoted QR that emulates Google's RCS benchmark at bond dimension 16384 on 32 nodes, claiming three orders of magnitude better accuracy than prior methods.
Flux quantization of the M5-brane tensor field in twisted Cohomotopy yields Pontrjagin homology observables that reproduce abelian Chern-Simons theory and braid actions on defect anyons.
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
The pushout of entangled and parameterized quantum information in monoidal categories yields the external tensor product on flat K-theory bundles.
Depolarizing channels suppress the correlations needed to witness both state-dependent and state-independent contextuality in sequential KCBS and Peres-Mermin implementations, leading to classicalization.
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
Transverse polarization in e+e- collisions generates maximally entangled fermion pairs in QED processes and boosts entanglement in electroweak and Bhabha scattering.
The zentropy approach receives a statistical-physics foundation via recursive entropy maximization, yielding partition functions for coarse-grained configurations and clarifying temperature-dependent states in thermodynamic systems.