论文标题

在线凸优化可编程量子计算机以模拟时变量子通道

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

论文作者

Chittoor, Hari Hara Suthan, Simeone, Osvaldo, Banchi, Leonardo, Pirandola, Stefano

论文摘要

模拟量子通道是量子计算中的基本原始性,因为量子通道定义了一般(痕量保护)量子操作。不得使用有限的可编程量子处理器来精确模拟任意量子通道,这使得开发最佳的近似模拟技术很重要。在本文中,我们研究了挑战性的环境,其中要模拟的通道随时间而变化。我们建议使用矩阵启用梯度下降(MEGD),一种在线凸优化方法,并在分析上表明它在及时达到了宽松的遗憾。通过实验,我们使用可编程的广义传送处理器来验证随时间变化的驱动通道的主要结果。

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源