Simulating Quantum Circuits Using Efficient Tensor Network Contraction Algorithms with Subexponential Upper Bound

被引:0
作者
Wahl, Thorsten B. [1 ]
Strelchuk, Sergii [1 ]
机构
[1] Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Wilberforce Road, CB3 0WA, United Kingdom
来源
Physical Review Letters | 2023年 / 131卷 / 18期
关键词
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I
180601
中图分类号
学科分类号
摘要
Polynomial approximation - Quantum efficiency - Qubits - Timing circuits
引用
收藏
相关论文
empty
未找到相关数据