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
Universal quantum simulators
16 Pith papers cite this work. Polarity classification is still indexing.
16
Pith papers citing it
hub tools
citation-role summary
background 2
method 1
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.
A dual Fourier-PSF and contour-PSF framework resolves the smoothness-sparsity trade-off for efficient quantum simulation of singular and holomorphic matrix functions.
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
Symmetry-based classical post-processing projects out Trotter error components that violate symmetries while preserving ideal dynamics in quantum simulations.
A hybrid quantum-classical variational method using polynomial approximations to the energy functional enables finite element analysis of a 1D Neo-Hookean hyperelastic model on near-term quantum hardware.
Demonstration of utility-scale quantum simulation of collective dissipation in 1D qubit chains up to 86 emitters using Trotterized dynamic circuits, biased CDR error mitigation, and classical MC-TEBD validation on IBM hardware.
Mid-circuit stabilizer verification in six-qubit GSE-encoded Clifford Trotter steps reduces logical error rates by up to 54% on Barium ion hardware, with the gain vanishing if checks are deferred to circuit end.
GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.
A 50-qubit quantum processor produces dynamical structure factors for KCuF3 that quantitatively match neutron-scattering measurements of its spinon spectrum.
Proves intractability of DQPT estimation on quantum computers but equivalence of subsystem DQPT decision to quantum circuit simulation, with quadratic speedup for critical time search.
A hardware-calibrated truncated QFT reduces gate count 31-44% at 30 qubits while bounding total variation distance error by O(2^{-d}) and outperforming full QFT under moderate noise.
The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.
Quantum walks integrated with variational circuits and CUDA-Q acceleration generate high-fidelity adaptive probability distributions for 1D financial modeling and 2D digit patterns.
Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.
citing papers explorer
-
Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management
The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.
-
Krylov Complexity
Krylov complexity is a canonical, parameter-independent measure of operator spreading that probes chaotic dynamics to late times and admits a geometric interpretation in holographic duals.