Solves quantum purity amplification for arbitrary n, m, eigenstates, and dimension d, with asymptotic input scaling O(m/(ε D_min²)) independent of d and non-asymptotic bounds from generalized Young diagrams.
hub Canonical reference
Quantum A lgorithm for Linear Systems of Equations
Canonical reference. 100% of citing Pith papers cite this work as background.
28
Pith papers citing it
2,575
external citations · Crossref
Background
100% of classified citations
hub tools
citation-role summary
background 10
citation-polarity summary
roles
background 10polarities
background 10representative 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.
Quantum signal processing angles admit closed-form expressions via orthogonal polynomial theory, allowing O(log(1/ε)) gate block-encodings of smooth functions through Hermite expansions and full characterization of SU(1,1)-QSP polynomials by roots.
A reduction from weak agnostic learning of class C to efficient tomography of states with bounded l1-extent w.r.t. C, with a concrete algorithm for stabilizer states running in poly(n, (ξ/ε)^log(ξ/ε)) time.
Quantum algorithm block-encodes Riccati solutions for m-particle m-hole RPA using Riesz projectors and QSVT, claiming linear system-size scaling under sparsity and polynomial cost in excitation rank m.
A classical polynomial-time algorithm for optimized sampling of lottery tickets in neural networks removes the exponential dependence on data dimension from prior classical approaches.
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
Quantum algorithms achieve polylog(N) complexity for high-dimensional linear SDEs by amplitude-encoding the solution and noise via Dyson series or Euler-Maruyama approximations plus quantum linear systems solvers.
A new method for unitary synthesis on quantum hardware cuts CNOT gates by up to 36% and compiles up to 553 times faster than standard tools on square and heavy-hex lattices.
Integrating amplitude estimation into QNN readout achieves O(1/N) estimation error with one shot instead of the usual O(1/sqrt(N)) Monte Carlo scaling.
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.
Quantum circuits for coherent multilayer neural network inference achieve quadratic to polylogarithmic speedups over classical methods depending on quantum data access models for inputs and weights.
End-to-end QSP-based quantum circuits solve linear PDEs on IBM hardware with tunable error and handle non-homogeneous Dirichlet boundaries for a plasma Poisson problem.
GQPINNs add symmetry awareness to quantum PINNs via equivariant circuits, yielding lower mean absolute error and fewer parameters than standard QPINNs on linear and nonlinear PDE benchmarks.
Presents LCNU-plus-embedding data loading for any polynomial Carleman-linearized autonomous system and applies it to the 3D LBE, yielding Ns ~ O(α²Q²) terms and explicit T-gate resource estimates for two solvers.
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.
A teleportation-based parallelization architecture for neutral-atom quantum error correction delivers up to 3x speedup over extractor methods at fixed space cost and enables simulated quantum advantage at 11,495 atoms and 15-hour runtime.
Quantum integer multiplier with O(log^2 n) circuit depth and T-depth via parallel partial products and binary adder tree in the Clifford+T model.
Data-driven approximation methods are derived for the unitary Koopman-von Neumann operator, its eigenvalues and eigenfunctions, with explicit quantum-circuit representations for finite-dimensional projections.
A quantum algorithm for rovibrational Hamiltonian simulation on fault-tolerant quantum computers using hybrid DVR and Walsh-Hadamard QROM, claiming exponential resource savings over prior quantum and classical methods.
Proposes a quantum-walker qRAM on a single binary tree using local operations that reduces resources while preserving optimal query complexity.
Quantum algorithm finds eigenvalues of parameterized matrix families by minimizing singular values and applies it to Schrödinger equation collocation with O(sqrt(N)) scaling.
Human-AI collaboration expanded a meta-idea on rational approximation into sign-embedding quantum algorithms for matrix problems, with humans retaining final judgment on routes and refinements.
Extends KMS-detailed balance constructions from open quantum systems to prepare microcanonical ensembles and other stationary states with criteria for efficient implementation.
citing papers explorer
-
Time-Delayed Publicly Verifiable Quantum Computation for Classical Verifiers
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.