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
Cambridge University Press, Cambridge (2010)
Canonical reference. 86% of citing Pith papers cite this work as background.
38
Pith papers citing it
5,552
external citations · Crossref
Background
86% of classified citations
hub tools
citation-role summary
background 12
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.
citing papers explorer
-
Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems
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 Compilation Framework for Quantum Simulation of Non-unitary Dynamics
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.
-
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.
-
Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
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.
-
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.
-
Resource-Theoretic Quantifiers of Weak and Strong Symmetry Breaking: Strong Entanglement Asymmetry and Beyond
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.
-
Localization of quantum states within subspaces
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.
-
Efficient Simulation of High-Level Quantum Gates
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.
-
Quantum and Reality
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 Enables Image Classification with a Single Photon
Quantum compressed sensing reformulates image classification as a single-photon projective measurement, achieving 69% accuracy with one detection event and 95% with four.
-
A Complex-Valued Continuous-Variable Quantum Approximation Optimization Algorithm (CCV-QAOA)
CCV-QAOA is a new complex-valued continuous-variable variant of QAOA that solves real and complex multivariate optimization problems via a variational framework.
-
Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
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.
-
Accelerating Quantum Tensor Network Simulations with Unified Path Variations and Non-Degenerate Batched Sampling
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.
-
Error Correction in Lattice Quantum Electrodynamics with Quantum Reference Frames
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.
-
On higher dimensional integrality and multiplicative dependence in semigroup algebraic dynamics
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.
-
Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
-
Tensor-Parallel Emulation of Quantum Circuits with Block-Cyclic Distributed Matrix Product States
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.
-
Engineering of Anyons on M5-Probes via Flux Quantization
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.
-
Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
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.
-
Entanglement of Sections: The pushout of entangled and parameterized quantum information
The pushout of entangled and parameterized quantum information in monoidal categories yields the external tensor product on flat K-theory bundles.
-
How Quantum Contextuality disappears in the Classical Limit
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.
-
Entanglement and circuit complexity in finite-depth random linear optical networks
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.
-
Spin Correlation and Quantum Entanglement of Fermion Pairs in Transversely Polarized $e^-e^+$ Collisions
Transverse polarization in e+e- collisions generates maximally entangled fermion pairs in QED processes and boosts entanglement in electroweak and Bhabha scattering.
-
Recursive entropy in thermodynamics: expounding the statistical-physics basis of the zentropy approach
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.
-
Non-Markovian Light-Matter Dynamics in the Time Fractional Jaynes-Cummings Model with Modulated Coupling
Fractional time Schrödinger equations applied to the time-dependent Jaynes-Cummings model introduce non-Markovian memory that damps oscillations, controls entanglement, and preserves non-periodic dynamics under sinusoidal coupling.
-
Security of deterministic key distribution with higher-dimensional systems
Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic uncertainty relations.
-
Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers
Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.
-
Quantum Entanglement in the Dirac Field Quantization around Charged Black Holes
Electric charge of a Reissner-Nordström black hole enhances decoherence of Dirac entanglement inside the horizon but can temporarily boost accessible entanglement outside, while Hawking radiation transfers correlations to inaccessible regions causing apparent loss for external observers.
-
Dimeric Perylene-Bisimide Organic Molecules: Fractional-Time Control of Quantum Resources
Fractional time order modulates coherence, entanglement, and nonlocality in dimeric PBI molecules via dipole-dipole interactions.
-
Dephasing Effects on the Dynamical Evolution of Quantum Correlations and Coherence in Neutrino Oscillations
In neutrino oscillations treated as open quantum systems, coherence outlasts steering and negativity under amplitude damping, phase flip, and phase damping, showing memory-induced revivals in non-Markovian regimes.
-
Probing the Planck scale with quantum computation
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.
-
Diagnosing Effective Metal-Insulator and Hawking-Page Transitions: A Mixed-State Entanglement Perspective in Einstein-Born-Infeld-Massive Gravity
In Einstein-Born-Infeld massive gravity, the entanglement wedge cross-section detects effective metal-insulator and Hawking-Page transitions more sensitively than other measures and reveals a universal critical exponent of 1/3 near second-order points.
-
Universal Quantum Computer Simulation of 50 Qubits on Europe`s First Exascale Supercomputer Harnessing Its Heterogeneous CPU-GPU Architecture
JUQCS-50 achieves the first 50-qubit universal quantum computer simulation on the JUPITER supercomputer via CPU-GPU memory extension, adaptive encoding, and network optimization, delivering a 16.6-fold speedup over the prior 48-qubit record.
-
Exploring the non-convexity in machine learning using quantum-inspired optimization
A quantum-inspired global search method called QIEO outperforms traditional solvers in recovering sparse structures and robust fitting by maintaining a broad view of possible solutions.
-
Is Lindblad for me?
A review that contrasts common assumptions about the Lindblad equation with refined expectations drawn from examples, culminating in a checklist for assessing its breakdown.
-
Entanglement dynamics of a two-qutrits system coupled to a spin chain
Numerical study of two-qutrit entanglement in a spin environment finds correlation between fast decay and quantum phase transitions.
- Optimizing Quantum Entanglement Preservation in a Qubit Qubit System with Dzyaloshinskii Moriya Interaction under Noisy Magnetic Fields via Feedback Control
- TensorRocq: Enabling diagrammatic reasoning in Rocq