Efficient Classical Simulation and Benchmarking of Quantum Processes in the Weyl Basis
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Efficient Classical Simulation and Benchmarking of Quantum Processes in the Weyl Basis. / França, Daniel Stilck; Strelchuk, Sergii; Studziński, Michał.
In: Physical Review Letters, Vol. 126, No. 21, 210502, 2021.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Efficient Classical Simulation and Benchmarking of Quantum Processes in the Weyl Basis
AU - França, Daniel Stilck
AU - Strelchuk, Sergii
AU - Studziński, Michał
N1 - Publisher Copyright: © 2021 American Physical Society.
PY - 2021
Y1 - 2021
N2 - One of the crucial steps in building a scalable quantum computer is to identify the noise sources which lead to errors in the process of quantum evolution. Different implementations come with multiple hardware-dependent sources of noise and decoherence making the problem of their detection manyfoldly more complex. We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models which occur during the computation. We provide an efficiently computable estimate of the overhead required to compute expectation values on outputs of the noisy circuit relying only on the locality of the interactions and no further assumptions on the circuit structure. The overhead decreases with the noise rate and this enables us to compute analytic noise bounds that imply efficient classical simulability. We apply our methods to ansatz circuits that appear in the variational quantum eigensolver and establish an upper bound on classical simulation complexity as a function of noise, identifying regimes when they become classically efficiently simulatable.
AB - One of the crucial steps in building a scalable quantum computer is to identify the noise sources which lead to errors in the process of quantum evolution. Different implementations come with multiple hardware-dependent sources of noise and decoherence making the problem of their detection manyfoldly more complex. We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models which occur during the computation. We provide an efficiently computable estimate of the overhead required to compute expectation values on outputs of the noisy circuit relying only on the locality of the interactions and no further assumptions on the circuit structure. The overhead decreases with the noise rate and this enables us to compute analytic noise bounds that imply efficient classical simulability. We apply our methods to ansatz circuits that appear in the variational quantum eigensolver and establish an upper bound on classical simulation complexity as a function of noise, identifying regimes when they become classically efficiently simulatable.
UR - http://www.scopus.com/inward/record.url?scp=85107115812&partnerID=8YFLogxK
U2 - 10.1103/PhysRevLett.126.210502
DO - 10.1103/PhysRevLett.126.210502
M3 - Journal article
C2 - 34114840
AN - SCOPUS:85107115812
VL - 126
JO - Physical Review Letters
JF - Physical Review Letters
SN - 0031-9007
IS - 21
M1 - 210502
ER -
ID: 276656323