REVIEW 15 cited by
Classical surrogate simulation of quantum systems with LOWESA
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We introduce LOWESA as a classical algorithm for faithfully simulating quantum systems via a classically constructed surrogate expectation landscape. After an initial overhead to build the surrogate landscape, one can rapidly study entire families of Hamiltonians, initial states and target observables. As a case study, we simulate the 127-qubit transverse-field Ising quantum system on a heavy-hexagon lattice with up to 20 Trotter steps which was recently presented in Nature 618, 500-505 (2023). Specifically, we approximately reconstruct (in minutes to hours on a laptop) the entire expectation landscape spanned by the heavy-hex Ising model. The expectation of a given observable can then be evaluated at different parameter values, i.e. with different onsite magnetic fields and coupling strengths, in fractions of a second on a laptop. This highlights that LOWESA can attain state-of-the-art performance in quantum simulation tasks, with the potential to become the algorithm of choice for scanning a wide range of systems quickly.
Forward citations
Cited by 15 Pith papers
-
Backpropagating Pauli Propagation
A backward-propagation algorithm computes gradients for sparse Pauli dynamics in O(1) passes and O(N_P) memory, with gradient accuracy empirically comparable to the simulation's own energy accuracy.
-
QCommute: a tool for symbolic computation of nested commutators in quantum many-body spin-1/2 systems
QCommute is a new C++ tool for algebraic symbolic computation of nested commutators in quantum spin-1/2 many-body systems on hypercubic lattices in the thermodynamic limit.
-
Simulating dynamics of the two-dimensional transverse-field Ising model: a comparative study of large-scale classical numerics
Classical simulations of the 2D transverse-field Ising model are reliable for quasi-adiabatic annealing across methods, but near-critical post-quench dynamics defeats MPS, TTN, 2DTN-BP, and NQS beyond tJ≈2.
-
Majorana string simulation of nonequilibrium dynamics in two-dimensional lattice fermion systems
Majorana-string propagation with truncation simulates real-time Fermi-Hubbard dynamics accurately on short-to-intermediate timescales in one and two dimensions.
-
Scalable Simulation of Quantum Many-Body Dynamics with Or-Represented Quantum Algebra
ORQA, a Pauli-string based simulation framework, is parallelized to run on Fugaku with up to 2^17 processes, tracking over a trillion Pauli strings and reproducing kicked Ising results.
-
Variational Quantum Simulations of a Two-Dimensional Frustrated Transverse-Field Ising Model on a Trapped-Ion Quantum Computer
A 16-qubit trapped-ion processor, running classically pretrained VQE circuits without error mitigation, reproduces the ferromagnetic and stripe phases of a 2D frustrated transverse-field Ising model.
-
Classically Augmented Zero-Noise Extrapolation
Classically Augmented Zero-Noise Extrapolation replaces high-noise Richardson nodes with classically simulated estimates, yielding exponential sampling-variance reduction for linear node spacings at fixed cutoff.
-
Limits of Clifford Disentangling in Tensor Network States
Clifford disentangling of tensor-network states works only up to a linear number of T gates; beyond that, magic accumulation defeats it, and a no-go theorem blocks universal single-qubit disentangling.
-
Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processors
Classical surrogates using truncated trigonometric expansions emulate noisy quantum processors and cut measurement overhead in VQE pre-training and Floquet phase identification.
-
Pauli Propagation: A Computational Framework for Simulating Quantum Systems
Pauli propagation, a classical method that evolves Pauli operators through quantum circuits, is presented as a unified algorithmic framework together with the Julia package PauliPropagation.jl that implements it.
-
Toward Total Recall: Enhancing FAIRness through AI-Driven Metadata Standardization
Combining GPT-4 with CEDAR metadata templates to standardize biomedical metadata substantially improves exact-match retrieval recall over raw metadata.
-
The vast world of quantum advantage
Assuming quantum computers are strictly more powerful than classical ones, the problem of deciding whether a given quantum circuit beats a specific classical simulation heuristic is solvable by quantum computers but n...
-
Strategic Plan for Neutral Atom Quantum Computation
If qubit-count growth (~1.8x/yr) and gate-error reduction (~0.62x/yr) continue, neutral-atom quantum computers could reach practical quantum advantage within a decade, this roadmap projects.
-
Hybrid Quantum Neural Networks: Theory, Implementations, and Applications
A balanced review of hybrid quantum neural networks, concluding that quantum layers help on structured, small-scale and quantum-native problems but do not yet beat classical models on generic benchmarks.
-
Artificial intelligence for representing and characterizing quantum systems
A review organizes AI-based quantum system characterization into ML, deep learning, and language model paradigms, covering property prediction and implicit state reconstruction.
Discussion (0). Continue with ORCID to comment.