Pith. sign in

REVIEW 5 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

arxiv 2308.03082 v1 pith:SONSBRDG submitted 2023-08-06 quant-ph cond-mat.stat-mechcond-mat.str-el

classification quant-phcond-mat.stat-mechcond-mat.str-el
keywords quantumpeporesultsapproachcircuitcliffordoperatoraccuracy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 6 citations worldwide. Full citation record

  1. Efficient classical simulation of large-scale unitary cluster Jastrow circuits

    quant-ph 2026-07 conditional novelty 7.0 of 10

    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.

  2. Scalable Simulation of Quantum Many-Body Dynamics with Or-Represented Quantum Algebra

    quant-ph 2025-06 conditional novelty 6.0 of 10

    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.

  3. Variational Quantum Simulations of a Two-Dimensional Frustrated Transverse-Field Ising Model on a Trapped-Ion Quantum Computer

    quant-ph 2025-05 conditional novelty 6.0 of 10

    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.

  4. Characterizing Pauli Propagation via Operator Complexity

    quant-ph 2025-10 conditional novelty 5.0 of 10

    Truncation error in Pauli propagation is bounded by Operator Stabilizer Rényi entropy, giving a Top-K budget formula, and the 1D XY chain's evolved local operator has O(s²) Pauli terms.

  5. Pauli Propagation: A Computational Framework for Simulating Quantum Systems

    quant-ph 2025-05 conditional novelty 5.0 of 10

    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.

Pith tools