works on

From the 2 of 96 papers with an AI index.

most citedThe Dark Energy Survey Supernova Program: A Reanalysis Of Cosmology Results And Evidence For Evolving Dark Energy With An Updated Type Ia Supernova Calibration

38 citations

Showing quant-phShow all

9 papers · 1 filter

quant-ph2026

Locally Purified Maximally Mixed States At Scale: Entanglement Pruning and Symmetries

Amit Jamadagni, Eugene Dumitrescu

Locally Purified Density Operators (LPDOs) are state-of-the-art tensor network ansatze candidates that efficiently represent mixed quantum states at scale. However, given their non…

quant-ph2026

Sampling two-dimensional isometric tensor network states

Alec Dektor, Eugene Dumitrescu, Chao Yang

Sampling a quantum system's underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Ten…

quant-ph2026

Diagonal-Budgeted Trotterization for Efficient Quantum Hamiltonian Simulation

Srikar Chundury, Blake Burgstahler, Jiajia Li +2

Efficient classical simulation of quantum Hamiltonian dynamics is often bottlenecked by exponential state growth and the overhead of generic sparse linear algebra. We introduce dia…

quant-ph2026

Quantum solver for single-impurity Anderson models with particle-hole symmetry

Mariia Karabin, Tanvir Sohail, Dmytro Bykov +8

Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottlen…

quant-ph2026

Robust design under uncertainty in quantum error mitigation

Maksym Prodius, Piotr Czarnik, Michael McKerns +2

Error mitigation techniques are crucial to achieving near-term quantum advantage. Classical post-processing of quantum computation outcomes is a popular approach for error mitigati…

quant-ph2026

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

Jai Moondra, Phillip C. Lotshaw, Philip C. Lotshaw +2

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut prob…