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.
\ Berry , author Andrew M
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 5roles
background 1polarities
background 1representative citing papers
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.
Quadratic bosonic Hamiltonian simulation is BQP-complete for a broad class that includes classical oscillator networks and continuous-time quantum walks, but becomes PostBQP-hard when extended to more general quadratic interactions.
A generative optimization loop using diffusion models, PINNs, and GNNs achieves 85.6% of fourth-order Qiskit fidelity at 21.8% circuit depth for transverse-field Ising model Trotter-Suzuki decomposition.
Chemical properties and symmetries, not variational energy, should guide UHF trial selection for ph-AFQMC on iron-sulfur clusters, yielding accurate energies despite suboptimal sampling and bias compensation.
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 Polylogarithmic-Depth Quantum Multiplier
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.
-
Complexity of Quadratic Bosonic Hamiltonian Simulation: $\mathsf{BQP}$-Completeness and $\mathsf{PostBQP}$-Hardness
Quadratic bosonic Hamiltonian simulation is BQP-complete for a broad class that includes classical oscillator networks and continuous-time quantum walks, but becomes PostBQP-hard when extended to more general quadratic interactions.
-
Physics Guided Generative Optimization for Trotter Suzuki Decomposition
A generative optimization loop using diffusion models, PINNs, and GNNs achieves 85.6% of fourth-order Qiskit fidelity at 21.8% circuit depth for transverse-field Ising model Trotter-Suzuki decomposition.
-
Selecting optimal unrestricted Hartree-Fock trial wavefunctions for phaseless auxiliary-field quantum Monte Carlo: Accuracy and limitations in modeling three iron-sulfur clusters
Chemical properties and symmetries, not variational energy, should guide UHF trial selection for ph-AFQMC on iron-sulfur clusters, yielding accurate energies despite suboptimal sampling and bias compensation.