aiqbenchInformații despre AI & calcul cuantic

...

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

This research significantly reduces the sample complexity required to simulate open quantum systems using the Wave Matrix Lindbladization algorithm, overcoming previous quadratic scaling limits that hindered scalability. By establishing tighter non-asymptotic bounds for random versus adversarial cases, the study clarifies theoretical performance thresholds essential for advancing practical applications in quantum chemistry and materials science.

Surse care acoperăQuantum Zeitgeist, AI Alignment Forum, LessWrong, arXiv

Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Quantum Simulations Now Need Far Fewer Measurements to Remain Accurate

Quantum Zeitgeist5 iunie 20266 min de cititArticolul și perspectiva sunt în engleză.

Previously, simulating open quantum systems with the Wave Matrix Lindbladization algorithm required computational effort scaling with the system dimension squared. Now, a refined analysis demonstrates a sample complexity bound of n_d^*(t,ε) ≤ (2d+3)/8 * ||L||∞^2 * (t^2/ε), a marked improvement over the prior O(d^2 t^2/ε) limit. This work also reveals a surprising contrast between expected and worst-case computational demands for these simulations.

A new set of bounds on the sample complexity needed for simulating Lindbladian dynamics using the Wave Matrix Lindbladization algorithm has been determined by Siheon Park of Seoul National University and colleagues. The team's work reveals a non-asymptotic sample complexity of $n^*(t, \varepsilon) \leq \left( \frac{2d+3}{8} \right) \|L\|_\infty^2 \left( \frac{t^2}{\varepsilon} \right)$, refining previous results and showing a sharp reduction in dimensional dependence. Notably, for random Lindblad operators where $\|L\|_\infty^2 = O(1/d)$, this complexity scales optimally as $O(t^2/\varepsilon)$, while a lower bound of $\Omega(dt^2/\varepsilon)$ is proven for specific adversarial cases, clarifying the interplay between typical and worst-case performance in sample-based quantum simulation and strengthening the…

Extras afișat conform termenilor RSS ai publicației · 104 cuvinte · textul integral și figurile sunt pe site-ul publicației

Citește pe Quantum Zeitgeist ↗Întreabă despre acest articol