arrow
返回

Quantum-assisted quantum compiling

delete2019-05-13
delete243
delete
OA
AI
S
Sumeet Khatri *
R
Ryan LaRose
A
Alexander Poremba
Ł
Łukasz Cincio
A
Andrew Sornborger
P
Patrick J. Coles
DOI:10.22331/q-2019-05-13-140delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary U and a trainable unitary V as the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlap Tr((VU)-U-dagger) but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.
Keyword:
ALGORITHMS
CIRCUIT
GATE

期刊

Quantum 封面图
Quantum
IF:
5.4
论文数:
951
被引数:
1.0W

机构

U
united states department of energy (doe)
学者数:
11.3W
论文数: 9.6W
被引数: 246
M
michigan state university
学者数:
3.6W
论文数: 3.2W
被引数: 44
引用论文

引用论文

A generative modeling approach for benchmarking and training shallow quantum circuits
err2019-05-27
err274
errOAAI
errBenedetti, Marcello; Garcia-Pintos, Delfina; Perdomo, Oscar; Leyton-Ortega, Vicente; Nam, Yunseong; Perdomo-Ortiz, Alejandro
err分享
err收藏
err分享
err收藏
Barren plateaus in quantum neural network training landscapes
err2018-11-16
err1.1K
errOAAI
errMcClean, Jarrod R.; Boixo, Sergio; Smelyanskiy, Vadim N.; Babbush, Ryan; Neven, Hartmut
err分享
err收藏
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器
err2014-07-23
err2.7K
errOAAI
errPeruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alan; O'Brien, Jeremy L.
err分享
err收藏
A software methodology for compiling quantum programs一种编译量子程序的软件方法
err2018-02-21
err100
errOAAI
errHaener, Thomas; Steiger, Damian S.; Svore, Krysta; Troyer, Matthias
err分享
err收藏
学者 查看更多内容