Pith. sign in

REVIEW 2 cited by

Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics

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 2404.08053 v2 pith:IMWQ52TF submitted 2024-04-11 quant-ph cond-mat.stat-mechcond-mat.str-el

classification quant-phcond-mat.stat-mechcond-mat.str-el
keywords quantumhamiltonianoptimizationqubitsresultssimulationbenchmarkcritical
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The real-time simulation of large many-body quantum systems is a formidable task, that may only be achievable with a genuine quantum computational platform. Currently, quantum hardware with a number of qubits sufficient to make classical emulation challenging is available. This condition is necessary for the pursuit of a so-called quantum advantage, but it also makes verifying the results very difficult. In this manuscript, we flip the perspective and utilize known theoretical results about many-body quantum critical dynamics to benchmark quantum hardware and various error mitigation techniques on up to 133 qubits. In particular, we benchmark against known universal scaling laws in the Hamiltonian simulation of a time-dependent transverse field Ising Hamiltonian. Incorporating only basic error mitigation and suppression methods, our study shows reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates, before noise becomes prevalent. These results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning. We demonstrate this on the example of digitized quantum annealing for optimization and identify an optimal working point in terms of both circuit depth and time step on a 133-site optimization problem.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Genuine Multipartite Entanglement in Quantum Optimization

    quant-ph 2024-11 conditional novelty 6.0 of 10

    In slow Trotterized annealing on MaxCut, genuine multipartite entanglement rises to a barrier near the minimum gap and falls again, and the chance of finding the optimum is bounded by one minus the final entanglement.

  2. Towards secondary structure prediction of longer mRNA sequences using a quantum-centric optimization scheme

    quant-ph 2025-05 conditional novelty 5.0 of 10

    Hybrid CVaR and IQP quantum workflows find CPLEX-verified optimal solutions for mRNA-folding QUBO instances up to 156 qubits, but simulated scaling shows steeply declining success rates.

Pith tools