REVIEW 8 cited by
Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator
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
Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator
read the original abstract
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation [Nature 618, 500 (2023)]. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. Its main feature is the ability to automatically identify the underlying low-rank and low-entanglement structures in the quantum circuit involving Clifford and near-Clifford gates. We assess our approach using the quantum circuit with 5+1 trotter steps which was previously considered beyond classical verification. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms. The results indicate that PEPO significantly outperforms existing methods, including the tensor network with belief propagation, the matrix product operator, and the Clifford perturbation theory, in both efficiency and accuracy. In particular, PEPO with bond dimension $\chi=2$ already gives similar accuracy to the CPT with $K=10$ and MPO with bond dimension $\chi=1024$. And PEPO with $\chi=184$ provides exact results in $3$ seconds using a single CPU. Furthermore, we apply our method to the circuit with 20 Trotter steps. We observe the monotonic and consistent convergence of the results with $\chi$, allowing us to estimate the outcome with $\chi\to\infty$ through extrapolations. We then compare the extrapolated results to those achieved in quantum hardware and with existing tensor network methods. Additionally, we discuss the potential usefulness of our approach in simulating quantum circuits, especially in scenarios involving near-Clifford circuits and quantum approximate optimization algorithms. Our approach is the first use of PEPO in solving the time evolution problem, and our results suggest it could be a powerful tool for exploring the dynamical properties of quantum many-body systems.
Forward citations
Cited by 8 Pith papers
-
Algorithmic Locality via Provable Convergence in Quantum Tensor Networks
For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affe...
-
Belief Propagation and Tensor Network Expansions for Many-Body Quantum Systems: Rigorous Results and Fundamental Limits
For PEPS states with loop-decay, BP with cluster corrections approximates local observables exponentially accurately, and loop-decay necessarily implies exponential decay of connected correlations, ruling out BP at cr...
-
Efficient classical simulation of large-scale unitary cluster Jastrow circuits
A one-layer UCJ quantum chemistry circuit can have its energy computed classically in O(N^7) time, so single-layer UCJ circuits cannot provide quantum advantage for energy estimation.
-
Use of Faulty States in Cat-Code Error Correction
Proposes multi-component bridge states outside cat code space for syndrome extraction in teleportation-based cat code QEC when nonlinear interactions are limiting.
-
Pushing the Classical Frontier of 1D Fermi-Hubbard Quench Dynamics Beyond Current Quantum Simulations
Symmetric TDVP on GPUs achieves converged 1D Fermi-Hubbard quench dynamics at chi~62000 up to t=7, certifying the high-entanglement regime and lowering the reported quantum advantage to ~36x.
-
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...
-
Quantum-inspired tensor networks in machine learning models
Tensor networks developed for quantum states are reviewed as tools for machine learning models, with assessment of their potential computational, explanatory, and privacy advantages alongside remaining challenges.
-
The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
A synthesis of expert insights from the ADAC Quantum Computing Working Group and member survey on the complementary roles of quantum and classical high-performance computing in future hybrid infrastructures.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.