Fetching the paper…

Reading the bibliography…

Efficient tensor network simulation of IBM's largest quantum processors · Around

2023

Efficient tensor network simulation of IBM's largest quantum processors

Patra, Siddhartha, Jahromi, Saeed S., Singh, Sukhbinder et al.

Original
PDF
Post on X

Understand

We show how quantum-inspired 2d tensor networks can be used to efficiently and accurately simulate the largest quantum processors from IBM, namely Eagle (127 qubits), Osprey (433 qubits) and Condor (1121 qubits).

We simulate the dynamics of a complex quantum many-body system -- specifically, the kicked Ising experiment considered recently by IBM in Nature 618, p.
500-505 (2023) -- using graph-based Projected Entangled Pair States (gPEPS), which was proposed by some of us in PRB 99, 195105 (2019).
Our results show that simple tensor updates are already sufficient to achieve very large unprecedented accuracy with remarkably low computational resources for this model.

Built on

F. Verstraete and J. I. Cirac, Renormalization algorithms for quantum-many body systems in two and higher dimensions (2004),
2004
Earlier work this paper cites.
J. Jordan, R. Orús, G. Vidal, F. Verstraete, and J. I. Cirac, Classical simulation of infinite-size quantum lattice systems in two spatial dimensions,
2008
Earlier work this paper cites.
H. C. Jiang, Z. Y. Weng, and T. Xiang, Accurate determination of tensor network state of quantum lattice models in two dimensions,
2008
Earlier work this paper cites.
R. Orús and G. Vidal, Simulation of two-dimensional quantum systems on an infinite lattice revisited: Corner transfer matrix for tensor contraction,
2009
Earlier work this paper cites.
R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states,
2014
Earlier work this paper cites.
H. N. Phien, J. A. Bengua, H. D. Tuan, P. Corboz, and R. Orús, Infinite projected entangled pair states algorithm improved: Fast full update and gauge fixing,
2015
Earlier work this paper cites.

Similar

R. Orús, Tensor networks for complex quantum systems,
2019
Cited alongside, same era.
S. S. Jahromi and R. Orús, Universal tensor-network algorithm for any infinite lattice,
2019
Cited alongside, same era.
M. Kjaergaard, M. E. Schwartz, J. Braumüller, P. Krantz, J. I.-J. Wang, S. Gustavsson, and W. D. Oliver, Superconducting qubits: Current state of play,
2020
Cited alongside, same era.
R. Alkabetz and I. Arad, Tensor networks contraction and the belief propagation algorithm,
2021
Cited alongside, same era.
Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Evidence for the utility of quantum computing before fault tolerance,
2023
Cited alongside, same era.

Then

H.-J. Liao, K. Wang, Z.-S. Zhou, P. Zhang, and T. Xiang, Simulation of ibm’s kicked ising experiment with projected entangled pair operator (2023),
Original
2023
Closest in time.
S. Anand, K. Temme, A. Kandala, and M. Zaletel, Classical benchmarking of zero noise extrapolation beyond the exactly-verifiable regime (2023),
Original
2023
Closest in time.
T. Begusic, J. Gray, and G. K.-L. Chan, Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance (2023),
Original
2023
Closest in time.
T. Begusic and G. K.-L. Chan, Fast classical simulation of evidence for the utility of quantum computing before fault tolerance (2023),
Original
2023
Closest in time.
M. S. Rudolph, E. Fontana, Z. Holmes, and L. Cincio, Classical surrogate simulation of quantum systems with lowesa (2023),

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

J. Tindall, M. Fishman, M. Stoudenmire, and D. Sels, Efficient tensor network simulation of ibm’s eagle kicked ising experiment (2023),

2023

Cited alongside, same era.

M. Lubasch, J. I. Cirac, and M.-C. Bañuls, Unifying projected entangled pair state contractions,

Cited in the paper.

M. Lubasch, J. I. Cirac, and M.-C. Bañuls, Algorithms for finite projected entangled pair states,

Cited in the paper.

2023

Closest in time.

Y. Shao, F. Wei, S. Cheng, and Z. Liu, Simulating quantum mean values in noisy variational quantum algorithms: A polynomial-scale approach (2023),

2023

Closest in time.