返回
Classical variational simulation of the Quantum Approximate Optimization Algorithm
DOI:10.1038/s41534-021-00440-z.png)
摘要
En 中文
A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating quantum systems is an important component of addressing this question. We introduce a method to simulate layered quantum circuits consisting of parametrized gates, an architecture behind many variational quantum algorithms suitable for near-term quantum computers. A neural-network parametrization of the many-qubit wavefunction is used, focusing on states relevant for the Quantum Approximate Optimization Algorithm (QAOA). For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers, approximately implementing 324 RZZ gates and 216 RX gates without requiring large-scale computational resources. For larger systems, our approach can be used to provide accurate QAOA simulations at previously unexplored parameter values and to benchmark the next generation of experiments in the Noisy Intermediate-Scale Quantum (NISQ) era.
Keyword:
MONTE-CARLO
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.4K
被引数:
8.1K
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器
NATURE COMMUNICATIONS
IF15.7
Bioreductive deposition of palladium (0) nanoparticles onShewanella oneidensiswith catalytic activity towards reductive dechlorination of polychlorinated biphenyls钯 (0) 纳米颗粒在 Shewanella oneidensis 上的生物还原沉积,对多氯联苯的还原脱氯具有催化活性
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator使用陷阱离子量子模拟器对远程Ising模型进行量子近似优化

