REVIEW 21 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 21 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.
-
Tensor network surrogate models for variational quantum computation
Tensor network simulations act as effective surrogate models for training QAOA on large 2D lattices, overcoming limits of parameter transfer from small instances and remaining classically feasible with moderate bond d...
-
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.
-
QCommute: a tool for symbolic computation of nested commutators in quantum many-body spin-1/2 systems
A new open-source C++ package computes nested commutators [H,[H,...A]] exactly and symbolically in the thermodynamic limit for spin-1/2 hypercubic lattices.
-
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.
-
Sampling (noisy) quantum circuits through randomized rounding
Gaussian randomized rounding on two-qubit marginals of depth-D circuits with local depolarizing noise p yields samples whose expected Max-Cut cost matches the noisy quantum device up to an approximation ratio of 1-O[(1-p)^D].
-
Quantum Convolutional Neural Networks are Effectively Classically Simulable
QCNNs are classically simulable via Pauli shadows on low-bodyness subspaces of locally-easy datasets, with explicit simulation demonstrated up to 1024 qubits for phases of matter classification.
-
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.
-
Computing noise-canceling observables via Pauli propagation
Hybrid framework combines Pauli propagation with noise-canceling channels to compute observables more accurately on quantum hardware with lower classical and quantum resource costs.
-
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.
-
Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
Systematic numerical study of QAOA parameter transfer on heavy-hex Ising models with local cubic terms shows transferred angles from small instances yield improving expectation values up to 49 layers on instances up t...
-
Entanglement Distance of Two- and Multi-Qubit Variational States and Its Quantification with Quantum Computing
Recurrence relations yield analytical expressions for entanglement distance in variational qubit states, revealing how correlations spread with circuit depth in one-dimensional chains.
-
Entanglement Distance of Two- and Multi-Qubit Variational States and Its Quantification with Quantum Computing
Recurrence relations and closed-form expressions are derived for entanglement distance in variational qubit states with RY and CZ gates, validated via AerSimulator runs.
-
Mind the gaps: The fraught road to quantum advantage
The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.
-
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.
-
Mind the gaps: The fraught road to quantum advantage
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
-
Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs
Classical solvers solve random Ising models on heavy-hex graphs efficiently, with Gurobi showing linear or weakly quadratic scaling up to 100k variables and simulated annealing showing exponential time-to-solution wit...
-
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). Sign in to comment.